java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:36:16,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:36:16,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:36:16,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:36:16,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:36:16,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:36:16,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:36:16,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:36:16,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:36:16,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:36:16,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:36:16,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:36:16,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:36:16,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:36:16,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:36:16,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:36:16,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:36:16,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:36:16,119 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:36:16,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:36:16,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:36:16,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:36:16,126 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:36:16,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:36:16,127 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:36:16,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:36:16,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:36:16,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:36:16,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:36:16,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:36:16,133 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:36:16,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:36:16,134 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:36:16,134 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:36:16,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:36:16,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:36:16,136 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:36:16,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:36:16,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:36:16,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:36:16,166 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:36:16,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:36:16,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:36:16,170 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:36:16,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:36:16,171 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:36:16,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:36:16,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:36:16,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:36:16,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:36:16,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:36:16,172 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:36:16,175 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:36:16,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:36:16,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:36:16,177 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:36:16,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:36:16,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:36:16,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:36:16,178 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:36:16,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:36:16,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:36:16,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:36:16,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:36:16,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:36:16,179 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:36:16,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:36:16,179 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:36:16,180 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:36:16,180 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:36:16,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:36:16,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:36:16,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:36:16,257 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:36:16,257 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:36:16,258 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-23 11:36:16,317 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941224af0/81d5c7ab666f46fcb7e7a54cf722d0a4/FLAGdb342021e [2018-11-23 11:36:16,824 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:36:16,825 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-23 11:36:16,836 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941224af0/81d5c7ab666f46fcb7e7a54cf722d0a4/FLAGdb342021e [2018-11-23 11:36:17,159 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941224af0/81d5c7ab666f46fcb7e7a54cf722d0a4 [2018-11-23 11:36:17,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:36:17,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:36:17,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:17,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:36:17,178 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:36:17,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0b3694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17, skipping insertion in model container [2018-11-23 11:36:17,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:36:17,245 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:36:17,538 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:17,549 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:36:17,611 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:17,636 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:36:17,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17 WrapperNode [2018-11-23 11:36:17,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:17,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:17,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:36:17,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:36:17,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:17,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:36:17,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:36:17,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:36:17,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... [2018-11-23 11:36:17,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:36:17,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:36:17,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:36:17,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:36:17,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:36:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:36:17,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:36:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:36:17,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:36:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:36:17,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:36:18,942 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:36:18,942 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:36:18,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:18 BoogieIcfgContainer [2018-11-23 11:36:18,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:36:18,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:36:18,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:36:18,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:36:18,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:36:17" (1/3) ... [2018-11-23 11:36:18,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6292821e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:18, skipping insertion in model container [2018-11-23 11:36:18,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:17" (2/3) ... [2018-11-23 11:36:18,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6292821e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:18, skipping insertion in model container [2018-11-23 11:36:18,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:18" (3/3) ... [2018-11-23 11:36:18,952 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-23 11:36:18,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:36:18,972 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-23 11:36:18,990 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-23 11:36:19,025 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:36:19,026 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:36:19,026 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:36:19,026 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:36:19,027 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:36:19,027 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:36:19,027 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:36:19,027 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:36:19,027 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:36:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-11-23 11:36:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:36:19,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:19,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:19,061 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:19,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2018-11-23 11:36:19,071 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:19,071 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:19,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:19,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:19,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {83#true} call ULTIMATE.init(); {83#true} is VALID [2018-11-23 11:36:19,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {83#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {83#true} is VALID [2018-11-23 11:36:19,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {83#true} assume true; {83#true} is VALID [2018-11-23 11:36:19,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {83#true} {83#true} #181#return; {83#true} is VALID [2018-11-23 11:36:19,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {83#true} call #t~ret7 := main(); {83#true} is VALID [2018-11-23 11:36:19,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {83#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {83#true} is VALID [2018-11-23 11:36:19,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {83#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {106#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-23 11:36:19,420 INFO L273 TraceCheckUtils]: 7: Hoare triple {106#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {106#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-23 11:36:19,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {106#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {106#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-23 11:36:19,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {106#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {116#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:19,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {116#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {84#false} is VALID [2018-11-23 11:36:19,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {84#false} assume !false; {84#false} is VALID [2018-11-23 11:36:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:19,432 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:19,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:19,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:36:19,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:36:19,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:19,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:36:19,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:19,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:36:19,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:36:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:36:19,507 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2018-11-23 11:36:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:21,164 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2018-11-23 11:36:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:21,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:36:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2018-11-23 11:36:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2018-11-23 11:36:21,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 170 transitions. [2018-11-23 11:36:21,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:21,598 INFO L225 Difference]: With dead ends: 127 [2018-11-23 11:36:21,598 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 11:36:21,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 11:36:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2018-11-23 11:36:21,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:21,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 73 states. [2018-11-23 11:36:21,710 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 73 states. [2018-11-23 11:36:21,711 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 73 states. [2018-11-23 11:36:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:21,721 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-23 11:36:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-11-23 11:36:21,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:21,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:21,724 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 111 states. [2018-11-23 11:36:21,724 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 111 states. [2018-11-23 11:36:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:21,734 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-23 11:36:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-11-23 11:36:21,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:21,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:21,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:21,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 11:36:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-23 11:36:21,743 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2018-11-23 11:36:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:21,744 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-23 11:36:21,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:36:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-23 11:36:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:36:21,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:21,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:21,746 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:21,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2018-11-23 11:36:21,747 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:21,747 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:21,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:21,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:21,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2018-11-23 11:36:21,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {568#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {568#true} is VALID [2018-11-23 11:36:21,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 11:36:21,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {568#true} {568#true} #181#return; {568#true} is VALID [2018-11-23 11:36:21,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {568#true} call #t~ret7 := main(); {568#true} is VALID [2018-11-23 11:36:21,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {568#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {568#true} is VALID [2018-11-23 11:36:21,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {568#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {591#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-23 11:36:21,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {591#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {591#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-23 11:36:21,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {591#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {591#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-23 11:36:21,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {591#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {601#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:21,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {601#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {569#false} is VALID [2018-11-23 11:36:21,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {569#false} assume !false; {569#false} is VALID [2018-11-23 11:36:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:21,936 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:36:21,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:21,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:36:21,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:36:21,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:21,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:36:21,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:21,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:36:21,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:36:21,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:36:21,973 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-11-23 11:36:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:22,637 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-23 11:36:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:22,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:36:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2018-11-23 11:36:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2018-11-23 11:36:22,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 117 transitions. [2018-11-23 11:36:22,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:22,854 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:36:22,854 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:36:22,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:36:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2018-11-23 11:36:22,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:22,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 71 states. [2018-11-23 11:36:22,915 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 71 states. [2018-11-23 11:36:22,915 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 71 states. [2018-11-23 11:36:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:22,920 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-23 11:36:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-11-23 11:36:22,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:22,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:22,922 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 109 states. [2018-11-23 11:36:22,923 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 109 states. [2018-11-23 11:36:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:22,931 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-23 11:36:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-11-23 11:36:22,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:22,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:22,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:22,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 11:36:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 11:36:22,943 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2018-11-23 11:36:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:22,943 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 11:36:22,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:36:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 11:36:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:36:22,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:22,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:22,946 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:22,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:22,949 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2018-11-23 11:36:22,949 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:22,950 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:23,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:23,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {1029#true} call ULTIMATE.init(); {1029#true} is VALID [2018-11-23 11:36:23,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {1029#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {1029#true} is VALID [2018-11-23 11:36:23,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {1029#true} assume true; {1029#true} is VALID [2018-11-23 11:36:23,097 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1029#true} {1029#true} #181#return; {1029#true} is VALID [2018-11-23 11:36:23,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {1029#true} call #t~ret7 := main(); {1029#true} is VALID [2018-11-23 11:36:23,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {1029#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1029#true} is VALID [2018-11-23 11:36:23,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {1029#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:23,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {1052#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:23,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {1052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:23,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {1052#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {1052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:23,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {1052#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:23,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {1052#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {1068#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:23,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {1068#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {1072#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:23,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {1072#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~14; {1030#false} is VALID [2018-11-23 11:36:23,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {1030#false} assume !false; {1030#false} is VALID [2018-11-23 11:36:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:23,104 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:23,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:23,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:23,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:23,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:23,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:23,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:23,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:23,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:23,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:23,143 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2018-11-23 11:36:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:23,811 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-11-23 11:36:23,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:23,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-23 11:36:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-23 11:36:23,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2018-11-23 11:36:24,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:24,020 INFO L225 Difference]: With dead ends: 124 [2018-11-23 11:36:24,020 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:36:24,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:36:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 74. [2018-11-23 11:36:24,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:24,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 74 states. [2018-11-23 11:36:24,066 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 74 states. [2018-11-23 11:36:24,066 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 74 states. [2018-11-23 11:36:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:24,071 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-23 11:36:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 11:36:24,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:24,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:24,072 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 122 states. [2018-11-23 11:36:24,073 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 122 states. [2018-11-23 11:36:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:24,078 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-23 11:36:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 11:36:24,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:24,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:24,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:24,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 11:36:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-11-23 11:36:24,083 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 15 [2018-11-23 11:36:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:24,083 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-11-23 11:36:24,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-23 11:36:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:36:24,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:24,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:24,085 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:24,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2018-11-23 11:36:24,086 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:24,086 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:24,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:24,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:24,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {1545#true} call ULTIMATE.init(); {1545#true} is VALID [2018-11-23 11:36:24,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {1545#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {1545#true} is VALID [2018-11-23 11:36:24,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {1545#true} assume true; {1545#true} is VALID [2018-11-23 11:36:24,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1545#true} {1545#true} #181#return; {1545#true} is VALID [2018-11-23 11:36:24,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {1545#true} call #t~ret7 := main(); {1545#true} is VALID [2018-11-23 11:36:24,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {1545#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1545#true} is VALID [2018-11-23 11:36:24,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {1545#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1568#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:24,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {1568#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1568#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:24,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {1568#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1568#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:24,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {1568#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1568#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:24,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {1568#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {1568#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:24,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {1568#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {1584#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:24,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {1584#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1588#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:24,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {1588#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {1546#false} is VALID [2018-11-23 11:36:24,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2018-11-23 11:36:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:24,236 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:24,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:24,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:24,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:24,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:24,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:24,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:24,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:24,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:24,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:24,259 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2018-11-23 11:36:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:24,887 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-23 11:36:24,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:24,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2018-11-23 11:36:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2018-11-23 11:36:24,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2018-11-23 11:36:25,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:25,066 INFO L225 Difference]: With dead ends: 122 [2018-11-23 11:36:25,066 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 11:36:25,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 11:36:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2018-11-23 11:36:25,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:25,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 77 states. [2018-11-23 11:36:25,108 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 77 states. [2018-11-23 11:36:25,108 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 77 states. [2018-11-23 11:36:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:25,112 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-11-23 11:36:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-11-23 11:36:25,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:25,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:25,112 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 120 states. [2018-11-23 11:36:25,113 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 120 states. [2018-11-23 11:36:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:25,117 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-11-23 11:36:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-11-23 11:36:25,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:25,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:25,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:25,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 11:36:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-11-23 11:36:25,121 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2018-11-23 11:36:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:25,122 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-11-23 11:36:25,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-11-23 11:36:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:25,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:25,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:25,124 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:25,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2018-11-23 11:36:25,125 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:25,125 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:25,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:25,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:25,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {2060#true} call ULTIMATE.init(); {2060#true} is VALID [2018-11-23 11:36:25,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {2060#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {2060#true} is VALID [2018-11-23 11:36:25,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {2060#true} assume true; {2060#true} is VALID [2018-11-23 11:36:25,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2060#true} {2060#true} #181#return; {2060#true} is VALID [2018-11-23 11:36:25,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {2060#true} call #t~ret7 := main(); {2060#true} is VALID [2018-11-23 11:36:25,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {2060#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2060#true} is VALID [2018-11-23 11:36:25,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {2060#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {2083#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {2083#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2083#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {2083#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {2083#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {2083#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {2083#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {2083#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2083#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {2083#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {2099#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {2099#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {2099#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:25,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {2099#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {2106#(= (bvadd main_~__VERIFIER_assert__cond~18 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:25,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {2106#(= (bvadd main_~__VERIFIER_assert__cond~18 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~18; {2061#false} is VALID [2018-11-23 11:36:25,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {2061#false} assume !false; {2061#false} is VALID [2018-11-23 11:36:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:25,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:25,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:25,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:25,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:36:25,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:25,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:25,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:25,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:25,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:25,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:25,354 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 5 states. [2018-11-23 11:36:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:26,585 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-11-23 11:36:26,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:26,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:36:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2018-11-23 11:36:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2018-11-23 11:36:26,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 181 transitions. [2018-11-23 11:36:26,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:26,937 INFO L225 Difference]: With dead ends: 171 [2018-11-23 11:36:26,937 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 11:36:26,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 11:36:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 79. [2018-11-23 11:36:26,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:26,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 79 states. [2018-11-23 11:36:26,966 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 79 states. [2018-11-23 11:36:26,966 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 79 states. [2018-11-23 11:36:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:26,970 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-11-23 11:36:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2018-11-23 11:36:26,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:26,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:26,971 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 169 states. [2018-11-23 11:36:26,971 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 169 states. [2018-11-23 11:36:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:26,976 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-11-23 11:36:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2018-11-23 11:36:26,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:26,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:26,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:26,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:36:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-11-23 11:36:26,980 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 16 [2018-11-23 11:36:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:26,980 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-23 11:36:26,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-23 11:36:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:26,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:26,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:26,982 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:26,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:26,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2018-11-23 11:36:26,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:26,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:27,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:27,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {2730#true} call ULTIMATE.init(); {2730#true} is VALID [2018-11-23 11:36:27,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {2730#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {2730#true} is VALID [2018-11-23 11:36:27,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {2730#true} assume true; {2730#true} is VALID [2018-11-23 11:36:27,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2730#true} {2730#true} #181#return; {2730#true} is VALID [2018-11-23 11:36:27,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {2730#true} call #t~ret7 := main(); {2730#true} is VALID [2018-11-23 11:36:27,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {2730#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2730#true} is VALID [2018-11-23 11:36:27,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {2730#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {2753#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:27,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {2753#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2753#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:27,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {2753#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {2753#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:27,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {2753#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {2753#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:27,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {2753#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2753#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:27,125 INFO L273 TraceCheckUtils]: 11: Hoare triple {2753#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {2769#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:27,125 INFO L273 TraceCheckUtils]: 12: Hoare triple {2769#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {2769#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:27,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {2769#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2776#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:27,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {2776#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {2731#false} is VALID [2018-11-23 11:36:27,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {2731#false} assume !false; {2731#false} is VALID [2018-11-23 11:36:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:27,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:27,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:27,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:27,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:36:27,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:27,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:27,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:27,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:27,149 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 5 states. [2018-11-23 11:36:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:27,966 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-11-23 11:36:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:27,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:36:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2018-11-23 11:36:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2018-11-23 11:36:27,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 163 transitions. [2018-11-23 11:36:28,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:28,189 INFO L225 Difference]: With dead ends: 154 [2018-11-23 11:36:28,189 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 11:36:28,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 11:36:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 80. [2018-11-23 11:36:28,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:28,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 80 states. [2018-11-23 11:36:28,230 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 80 states. [2018-11-23 11:36:28,230 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 80 states. [2018-11-23 11:36:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:28,235 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-11-23 11:36:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-11-23 11:36:28,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:28,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:28,236 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 152 states. [2018-11-23 11:36:28,236 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 152 states. [2018-11-23 11:36:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:28,241 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-11-23 11:36:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-11-23 11:36:28,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:28,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:28,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:28,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:36:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-11-23 11:36:28,245 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 16 [2018-11-23 11:36:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:28,245 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-11-23 11:36:28,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-11-23 11:36:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:28,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:28,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:28,247 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:28,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2018-11-23 11:36:28,248 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:28,248 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:28,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:28,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:28,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {3349#true} call ULTIMATE.init(); {3349#true} is VALID [2018-11-23 11:36:28,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {3349#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {3349#true} is VALID [2018-11-23 11:36:28,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {3349#true} assume true; {3349#true} is VALID [2018-11-23 11:36:28,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3349#true} {3349#true} #181#return; {3349#true} is VALID [2018-11-23 11:36:28,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {3349#true} call #t~ret7 := main(); {3349#true} is VALID [2018-11-23 11:36:28,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {3349#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3349#true} is VALID [2018-11-23 11:36:28,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {3349#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3372#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:28,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {3372#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3372#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:28,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {3372#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {3372#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:28,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {3372#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {3372#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:28,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {3372#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3372#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:28,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {3372#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {3388#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:28,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {3388#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {3392#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:28,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {3392#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {3396#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:28,625 INFO L273 TraceCheckUtils]: 14: Hoare triple {3396#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~15; {3350#false} is VALID [2018-11-23 11:36:28,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {3350#false} assume !false; {3350#false} is VALID [2018-11-23 11:36:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:28,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:28,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:28,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:28,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:28,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:28,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:28,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:28,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:28,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:28,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:28,650 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-11-23 11:36:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:29,450 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-11-23 11:36:29,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:29,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2018-11-23 11:36:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2018-11-23 11:36:29,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 123 transitions. [2018-11-23 11:36:29,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:29,606 INFO L225 Difference]: With dead ends: 116 [2018-11-23 11:36:29,606 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 11:36:29,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 11:36:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2018-11-23 11:36:29,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:29,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 79 states. [2018-11-23 11:36:29,635 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 79 states. [2018-11-23 11:36:29,636 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 79 states. [2018-11-23 11:36:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:29,640 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-11-23 11:36:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-11-23 11:36:29,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:29,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:29,641 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 112 states. [2018-11-23 11:36:29,641 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 112 states. [2018-11-23 11:36:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:29,644 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-11-23 11:36:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-11-23 11:36:29,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:29,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:29,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:29,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:36:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-11-23 11:36:29,648 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 16 [2018-11-23 11:36:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:29,648 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-11-23 11:36:29,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-11-23 11:36:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:29,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:29,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:29,650 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:29,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2018-11-23 11:36:29,651 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:29,651 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:29,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:29,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:30,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {3848#true} call ULTIMATE.init(); {3848#true} is VALID [2018-11-23 11:36:30,009 INFO L273 TraceCheckUtils]: 1: Hoare triple {3848#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {3848#true} is VALID [2018-11-23 11:36:30,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {3848#true} assume true; {3848#true} is VALID [2018-11-23 11:36:30,009 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3848#true} {3848#true} #181#return; {3848#true} is VALID [2018-11-23 11:36:30,010 INFO L256 TraceCheckUtils]: 4: Hoare triple {3848#true} call #t~ret7 := main(); {3848#true} is VALID [2018-11-23 11:36:30,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {3848#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3848#true} is VALID [2018-11-23 11:36:30,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {3848#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3871#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {3871#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3871#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {3871#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3871#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {3871#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3871#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {3871#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {3871#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {3871#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {3887#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:30,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {3887#(= (_ bv1 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3891#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:30,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {3891#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3895#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:30,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {3895#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~3; {3849#false} is VALID [2018-11-23 11:36:30,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {3849#false} assume !false; {3849#false} is VALID [2018-11-23 11:36:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:30,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:30,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:30,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:30,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:30,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:30,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:30,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:30,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:30,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:30,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:30,084 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 6 states. [2018-11-23 11:36:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:30,795 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-11-23 11:36:30,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:30,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2018-11-23 11:36:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2018-11-23 11:36:30,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 119 transitions. [2018-11-23 11:36:30,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:30,981 INFO L225 Difference]: With dead ends: 112 [2018-11-23 11:36:30,981 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 11:36:30,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 11:36:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 78. [2018-11-23 11:36:31,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:31,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 78 states. [2018-11-23 11:36:31,020 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 78 states. [2018-11-23 11:36:31,020 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 78 states. [2018-11-23 11:36:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:31,024 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-11-23 11:36:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-11-23 11:36:31,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:31,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:31,025 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 108 states. [2018-11-23 11:36:31,025 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 108 states. [2018-11-23 11:36:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:31,029 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-11-23 11:36:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-11-23 11:36:31,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:31,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:31,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:31,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:36:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-11-23 11:36:31,032 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 16 [2018-11-23 11:36:31,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:31,032 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-11-23 11:36:31,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-23 11:36:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:31,033 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:31,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:31,034 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:31,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2018-11-23 11:36:31,034 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:31,035 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:31,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:31,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:31,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {4334#true} call ULTIMATE.init(); {4334#true} is VALID [2018-11-23 11:36:31,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {4334#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {4334#true} is VALID [2018-11-23 11:36:31,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {4334#true} assume true; {4334#true} is VALID [2018-11-23 11:36:31,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4334#true} {4334#true} #181#return; {4334#true} is VALID [2018-11-23 11:36:31,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {4334#true} call #t~ret7 := main(); {4334#true} is VALID [2018-11-23 11:36:31,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {4334#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4334#true} is VALID [2018-11-23 11:36:31,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {4334#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {4357#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:31,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {4357#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4361#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:31,426 INFO L273 TraceCheckUtils]: 8: Hoare triple {4361#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4361#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:31,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {4361#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4368#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} is VALID [2018-11-23 11:36:31,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {4368#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {4372#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:31,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {4372#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {4376#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:31,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {4376#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {4376#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:31,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {4376#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {4376#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:31,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {4376#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {4386#(= (bvadd main_~__VERIFIER_assert__cond~19 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:31,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {4386#(= (bvadd main_~__VERIFIER_assert__cond~19 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~19; {4335#false} is VALID [2018-11-23 11:36:31,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {4335#false} assume !false; {4335#false} is VALID [2018-11-23 11:36:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:31,440 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:31,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:31,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:36:31,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:36:31,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:31,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:36:31,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:31,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:36:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:36:31,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:31,471 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 8 states. [2018-11-23 11:36:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:32,933 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 11:36:32,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:36:32,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:36:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-23 11:36:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-23 11:36:32,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2018-11-23 11:36:33,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:33,217 INFO L225 Difference]: With dead ends: 140 [2018-11-23 11:36:33,217 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 11:36:33,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 11:36:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 79. [2018-11-23 11:36:33,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:33,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 79 states. [2018-11-23 11:36:33,246 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 79 states. [2018-11-23 11:36:33,246 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 79 states. [2018-11-23 11:36:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:33,251 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 11:36:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-11-23 11:36:33,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:33,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:33,252 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 138 states. [2018-11-23 11:36:33,252 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 138 states. [2018-11-23 11:36:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:33,256 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 11:36:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-11-23 11:36:33,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:33,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:33,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:33,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:36:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-23 11:36:33,260 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 17 [2018-11-23 11:36:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:33,260 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-23 11:36:33,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:36:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-23 11:36:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:33,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:33,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:33,261 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:33,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2018-11-23 11:36:33,262 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:33,262 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:33,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:33,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:33,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {4918#true} call ULTIMATE.init(); {4918#true} is VALID [2018-11-23 11:36:33,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {4918#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {4918#true} is VALID [2018-11-23 11:36:33,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {4918#true} assume true; {4918#true} is VALID [2018-11-23 11:36:33,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4918#true} {4918#true} #181#return; {4918#true} is VALID [2018-11-23 11:36:33,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {4918#true} call #t~ret7 := main(); {4918#true} is VALID [2018-11-23 11:36:33,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {4918#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4918#true} is VALID [2018-11-23 11:36:33,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {4918#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {4941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {4941#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4945#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:33,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {4945#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4945#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:33,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {4945#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4952#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} is VALID [2018-11-23 11:36:33,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {4952#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {4956#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:33,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {4956#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {4960#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:33,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {4960#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {4960#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:33,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {4960#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4960#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:33,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {4960#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4970#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:33,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {4970#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~17; {4919#false} is VALID [2018-11-23 11:36:33,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {4919#false} assume !false; {4919#false} is VALID [2018-11-23 11:36:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:33,613 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:33,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:33,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:36:33,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:36:33,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:33,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:36:33,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:33,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:36:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:36:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:33,660 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 8 states. [2018-11-23 11:36:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:35,537 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-11-23 11:36:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:36:35,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:36:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2018-11-23 11:36:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2018-11-23 11:36:35,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 126 transitions. [2018-11-23 11:36:35,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:35,770 INFO L225 Difference]: With dead ends: 120 [2018-11-23 11:36:35,770 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 11:36:35,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 11:36:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2018-11-23 11:36:35,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:35,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 80 states. [2018-11-23 11:36:35,810 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 80 states. [2018-11-23 11:36:35,810 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 80 states. [2018-11-23 11:36:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:35,814 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-11-23 11:36:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-11-23 11:36:35,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:35,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:35,815 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 118 states. [2018-11-23 11:36:35,815 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 118 states. [2018-11-23 11:36:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:35,820 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-11-23 11:36:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-11-23 11:36:35,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:35,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:35,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:35,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:36:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-23 11:36:35,823 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 17 [2018-11-23 11:36:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:35,823 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-23 11:36:35,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:36:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-23 11:36:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:35,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:35,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:35,825 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:35,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2018-11-23 11:36:35,825 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:35,826 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:35,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:35,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:35,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {5442#true} call ULTIMATE.init(); {5442#true} is VALID [2018-11-23 11:36:35,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {5442#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {5442#true} is VALID [2018-11-23 11:36:35,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {5442#true} assume true; {5442#true} is VALID [2018-11-23 11:36:35,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5442#true} {5442#true} #181#return; {5442#true} is VALID [2018-11-23 11:36:35,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {5442#true} call #t~ret7 := main(); {5442#true} is VALID [2018-11-23 11:36:35,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {5442#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5442#true} is VALID [2018-11-23 11:36:35,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {5442#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5465#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {5465#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5465#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {5465#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5465#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {5465#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5465#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {5465#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {5465#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {5465#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {5481#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {5481#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5481#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {5481#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5481#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {5481#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5491#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:35,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {5491#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {5443#false} is VALID [2018-11-23 11:36:35,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {5443#false} assume !false; {5443#false} is VALID [2018-11-23 11:36:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:35,971 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:35,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:35,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:35,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:35,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:35,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:35,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:35,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:35,992 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2018-11-23 11:36:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:36,783 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-11-23 11:36:36,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:36,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2018-11-23 11:36:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2018-11-23 11:36:36,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 143 transitions. [2018-11-23 11:36:36,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:36,960 INFO L225 Difference]: With dead ends: 134 [2018-11-23 11:36:36,960 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 11:36:36,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 11:36:37,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2018-11-23 11:36:37,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:37,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 83 states. [2018-11-23 11:36:37,018 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 83 states. [2018-11-23 11:36:37,018 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 83 states. [2018-11-23 11:36:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:37,021 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-11-23 11:36:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-11-23 11:36:37,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:37,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:37,022 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 132 states. [2018-11-23 11:36:37,022 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 132 states. [2018-11-23 11:36:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:37,025 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-11-23 11:36:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-11-23 11:36:37,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:37,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:37,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:37,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 11:36:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-11-23 11:36:37,028 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 17 [2018-11-23 11:36:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:37,028 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-11-23 11:36:37,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-11-23 11:36:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:37,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:37,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:37,030 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:37,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2018-11-23 11:36:37,030 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:37,030 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:37,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:37,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:37,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {6007#true} call ULTIMATE.init(); {6007#true} is VALID [2018-11-23 11:36:37,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {6007#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {6007#true} is VALID [2018-11-23 11:36:37,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {6007#true} assume true; {6007#true} is VALID [2018-11-23 11:36:37,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6007#true} {6007#true} #181#return; {6007#true} is VALID [2018-11-23 11:36:37,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {6007#true} call #t~ret7 := main(); {6007#true} is VALID [2018-11-23 11:36:37,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {6007#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6007#true} is VALID [2018-11-23 11:36:37,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {6007#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {6030#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:37,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {6030#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6030#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:37,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {6030#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6030#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:37,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {6030#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6030#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:37,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {6030#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {6030#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:37,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {6030#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {6046#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:37,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {6046#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {6046#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:37,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {6046#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {6046#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:37,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {6046#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6056#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:37,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {6056#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {6008#false} is VALID [2018-11-23 11:36:37,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {6008#false} assume !false; {6008#false} is VALID [2018-11-23 11:36:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:37,171 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:37,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:37,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:37,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:37,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:37,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:37,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:37,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:37,194 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 5 states. [2018-11-23 11:36:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:37,727 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-23 11:36:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:37,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2018-11-23 11:36:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2018-11-23 11:36:37,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 109 transitions. [2018-11-23 11:36:37,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:37,869 INFO L225 Difference]: With dead ends: 102 [2018-11-23 11:36:37,869 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 11:36:37,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 11:36:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2018-11-23 11:36:37,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:37,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 85 states. [2018-11-23 11:36:37,900 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 85 states. [2018-11-23 11:36:37,900 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 85 states. [2018-11-23 11:36:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:37,902 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-11-23 11:36:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-11-23 11:36:37,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:37,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:37,904 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 100 states. [2018-11-23 11:36:37,904 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 100 states. [2018-11-23 11:36:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:37,906 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-11-23 11:36:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2018-11-23 11:36:37,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:37,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:37,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:37,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 11:36:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2018-11-23 11:36:37,909 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 17 [2018-11-23 11:36:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:37,909 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2018-11-23 11:36:37,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-11-23 11:36:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:37,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:37,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:37,910 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:37,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2018-11-23 11:36:37,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:37,911 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:37,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:37,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:38,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {6476#true} call ULTIMATE.init(); {6476#true} is VALID [2018-11-23 11:36:38,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {6476#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {6476#true} is VALID [2018-11-23 11:36:38,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {6476#true} assume true; {6476#true} is VALID [2018-11-23 11:36:38,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6476#true} {6476#true} #181#return; {6476#true} is VALID [2018-11-23 11:36:38,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {6476#true} call #t~ret7 := main(); {6476#true} is VALID [2018-11-23 11:36:38,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {6476#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6476#true} is VALID [2018-11-23 11:36:38,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {6476#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {6499#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {6499#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6499#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {6499#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6499#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {6499#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6499#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {6499#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {6499#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {6499#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {6515#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,105 INFO L273 TraceCheckUtils]: 12: Hoare triple {6515#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {6515#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {6515#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {6515#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {6515#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {6515#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {6515#(= (_ bv1 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6528#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:38,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {6528#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {6477#false} is VALID [2018-11-23 11:36:38,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {6477#false} assume !false; {6477#false} is VALID [2018-11-23 11:36:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:38,108 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:38,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:38,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:38,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 11:36:38,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:38,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:38,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:38,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:38,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:38,138 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 5 states. [2018-11-23 11:36:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:38,886 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-23 11:36:38,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:38,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 11:36:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2018-11-23 11:36:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2018-11-23 11:36:38,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 139 transitions. [2018-11-23 11:36:39,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:39,515 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:36:39,515 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 11:36:39,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 11:36:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2018-11-23 11:36:39,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:39,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 87 states. [2018-11-23 11:36:39,581 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 87 states. [2018-11-23 11:36:39,581 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 87 states. [2018-11-23 11:36:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:39,584 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-11-23 11:36:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-23 11:36:39,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:39,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:39,585 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 128 states. [2018-11-23 11:36:39,585 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 128 states. [2018-11-23 11:36:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:39,587 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-11-23 11:36:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-23 11:36:39,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:39,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:39,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:39,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 11:36:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-11-23 11:36:39,590 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 18 [2018-11-23 11:36:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:39,591 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-11-23 11:36:39,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-11-23 11:36:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:39,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:39,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:39,592 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:39,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:39,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2018-11-23 11:36:39,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:39,593 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:39,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:40,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {7037#true} call ULTIMATE.init(); {7037#true} is VALID [2018-11-23 11:36:40,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {7037#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {7037#true} is VALID [2018-11-23 11:36:40,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {7037#true} assume true; {7037#true} is VALID [2018-11-23 11:36:40,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7037#true} {7037#true} #181#return; {7037#true} is VALID [2018-11-23 11:36:40,304 INFO L256 TraceCheckUtils]: 4: Hoare triple {7037#true} call #t~ret7 := main(); {7037#true} is VALID [2018-11-23 11:36:40,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {7037#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7037#true} is VALID [2018-11-23 11:36:40,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {7037#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {7060#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:40,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {7060#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {7064#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:40,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {7064#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7064#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:40,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {7064#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7071#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:36:40,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {7071#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {7075#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:40,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {7075#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7079#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:40,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {7079#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {7079#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:40,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {7079#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {7079#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:40,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {7079#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7079#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:40,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {7079#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7092#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:40,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {7092#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {7038#false} is VALID [2018-11-23 11:36:40,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {7038#false} assume !false; {7038#false} is VALID [2018-11-23 11:36:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:40,318 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:40,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:40,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:36:40,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:36:40,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:40,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:36:40,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:40,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:36:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:36:40,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:40,347 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 8 states. [2018-11-23 11:36:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:41,262 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-11-23 11:36:41,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:36:41,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:36:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2018-11-23 11:36:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2018-11-23 11:36:41,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 131 transitions. [2018-11-23 11:36:41,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:41,839 INFO L225 Difference]: With dead ends: 129 [2018-11-23 11:36:41,840 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 11:36:41,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 11:36:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 88. [2018-11-23 11:36:41,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:41,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 88 states. [2018-11-23 11:36:41,870 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 88 states. [2018-11-23 11:36:41,870 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 88 states. [2018-11-23 11:36:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:41,872 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-11-23 11:36:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-11-23 11:36:41,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:41,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:41,873 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 127 states. [2018-11-23 11:36:41,873 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 127 states. [2018-11-23 11:36:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:41,876 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-11-23 11:36:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-11-23 11:36:41,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:41,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:41,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:41,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:36:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-11-23 11:36:41,878 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 18 [2018-11-23 11:36:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:41,879 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-11-23 11:36:41,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:36:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-23 11:36:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:41,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:41,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:41,880 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:41,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:41,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2018-11-23 11:36:41,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:41,881 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:41,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:41,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:42,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {7599#true} call ULTIMATE.init(); {7599#true} is VALID [2018-11-23 11:36:42,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {7599#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {7599#true} is VALID [2018-11-23 11:36:42,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {7599#true} assume true; {7599#true} is VALID [2018-11-23 11:36:42,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7599#true} {7599#true} #181#return; {7599#true} is VALID [2018-11-23 11:36:42,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {7599#true} call #t~ret7 := main(); {7599#true} is VALID [2018-11-23 11:36:42,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {7599#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7599#true} is VALID [2018-11-23 11:36:42,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {7599#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {7622#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:42,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {7622#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {7626#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:42,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {7626#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7626#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:42,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {7626#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7633#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:36:42,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {7633#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {7637#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:42,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {7637#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7641#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:42,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {7641#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {7641#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:42,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {7641#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {7641#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:42,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {7641#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7641#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:42,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {7641#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7654#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:42,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {7654#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {7600#false} is VALID [2018-11-23 11:36:42,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {7600#false} assume !false; {7600#false} is VALID [2018-11-23 11:36:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:42,482 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:42,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:42,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:36:42,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:36:42,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:42,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:36:42,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:42,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:36:42,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:36:42,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:42,508 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 8 states. [2018-11-23 11:36:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:43,626 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-11-23 11:36:43,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:36:43,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:36:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-23 11:36:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-23 11:36:43,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2018-11-23 11:36:44,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:44,176 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:36:44,176 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 11:36:44,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 11:36:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-11-23 11:36:44,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:44,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 87 states. [2018-11-23 11:36:44,209 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 87 states. [2018-11-23 11:36:44,209 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 87 states. [2018-11-23 11:36:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:44,211 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-23 11:36:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-23 11:36:44,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:44,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:44,212 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 90 states. [2018-11-23 11:36:44,212 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 90 states. [2018-11-23 11:36:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:44,214 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-23 11:36:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-23 11:36:44,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:44,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:44,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:44,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 11:36:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-11-23 11:36:44,217 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 18 [2018-11-23 11:36:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:44,217 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-11-23 11:36:44,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:36:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-11-23 11:36:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:36:44,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:44,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:44,219 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:44,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2018-11-23 11:36:44,219 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:44,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:44,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:44,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {8049#true} call ULTIMATE.init(); {8049#true} is VALID [2018-11-23 11:36:44,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {8049#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {8049#true} is VALID [2018-11-23 11:36:44,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {8049#true} assume true; {8049#true} is VALID [2018-11-23 11:36:44,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8049#true} {8049#true} #181#return; {8049#true} is VALID [2018-11-23 11:36:44,449 INFO L256 TraceCheckUtils]: 4: Hoare triple {8049#true} call #t~ret7 := main(); {8049#true} is VALID [2018-11-23 11:36:44,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {8049#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8049#true} is VALID [2018-11-23 11:36:44,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {8049#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8072#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:44,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {8072#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {8076#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:44,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {8076#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8076#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:44,452 INFO L273 TraceCheckUtils]: 9: Hoare triple {8076#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8083#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:36:44,453 INFO L273 TraceCheckUtils]: 10: Hoare triple {8083#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {8087#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:36:44,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {8087#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:44,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:44,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:44,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:44,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:44,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {8091#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8107#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:44,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {8107#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {8050#false} is VALID [2018-11-23 11:36:44,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {8050#false} assume !false; {8050#false} is VALID [2018-11-23 11:36:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:44,469 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:44,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:44,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:36:44,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:36:44,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:44,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:36:44,530 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-23 11:36:44,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:36:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:36:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:44,531 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 8 states. [2018-11-23 11:36:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:45,811 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-11-23 11:36:45,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:36:45,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:36:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2018-11-23 11:36:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2018-11-23 11:36:45,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 125 transitions. [2018-11-23 11:36:45,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:45,950 INFO L225 Difference]: With dead ends: 123 [2018-11-23 11:36:45,950 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 11:36:45,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 11:36:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-11-23 11:36:46,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:46,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 88 states. [2018-11-23 11:36:46,040 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 88 states. [2018-11-23 11:36:46,040 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 88 states. [2018-11-23 11:36:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:46,042 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-11-23 11:36:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2018-11-23 11:36:46,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:46,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:46,043 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 121 states. [2018-11-23 11:36:46,044 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 121 states. [2018-11-23 11:36:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:46,046 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-11-23 11:36:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2018-11-23 11:36:46,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:46,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:46,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:46,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:36:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-11-23 11:36:46,048 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 19 [2018-11-23 11:36:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:46,048 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-11-23 11:36:46,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:36:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-11-23 11:36:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:46,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:46,049 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:46,049 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:46,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:46,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1186520011, now seen corresponding path program 1 times [2018-11-23 11:36:46,050 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:46,050 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:46,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:46,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:46,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {8596#true} call ULTIMATE.init(); {8596#true} is VALID [2018-11-23 11:36:46,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {8596#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {8596#true} is VALID [2018-11-23 11:36:46,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {8596#true} assume true; {8596#true} is VALID [2018-11-23 11:36:46,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8596#true} {8596#true} #181#return; {8596#true} is VALID [2018-11-23 11:36:46,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {8596#true} call #t~ret7 := main(); {8596#true} is VALID [2018-11-23 11:36:46,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {8596#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8596#true} is VALID [2018-11-23 11:36:46,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {8596#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8619#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {8619#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {8619#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {8619#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8619#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {8619#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8619#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {8619#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {8619#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {8619#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {8635#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {8635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {8635#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {8635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {8635#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {8635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {8635#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {8635#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {8635#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8651#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {8651#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8655#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:46,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {8655#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~14; {8597#false} is VALID [2018-11-23 11:36:46,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {8597#false} assume !false; {8597#false} is VALID [2018-11-23 11:36:46,336 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-23 11:36:46,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:36:46,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {8597#false} assume !false; {8597#false} is VALID [2018-11-23 11:36:46,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {8665#(not (= main_~__VERIFIER_assert__cond~14 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~14; {8597#false} is VALID [2018-11-23 11:36:46,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {8669#(bvsle (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8665#(not (= main_~__VERIFIER_assert__cond~14 (_ bv0 32)))} is VALID [2018-11-23 11:36:46,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8669#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:46,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:46,417 INFO L273 TraceCheckUtils]: 14: Hoare triple {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:46,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:46,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:46,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8673#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:46,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:46,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:46,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:46,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:46,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {8596#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8689#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:46,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {8596#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8596#true} is VALID [2018-11-23 11:36:46,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {8596#true} call #t~ret7 := main(); {8596#true} is VALID [2018-11-23 11:36:46,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8596#true} {8596#true} #181#return; {8596#true} is VALID [2018-11-23 11:36:46,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {8596#true} assume true; {8596#true} is VALID [2018-11-23 11:36:46,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {8596#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {8596#true} is VALID [2018-11-23 11:36:46,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {8596#true} call ULTIMATE.init(); {8596#true} is VALID [2018-11-23 11:36:46,426 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-23 11:36:46,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:36:46,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:36:46,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 11:36:46,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:46,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:36:46,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:46,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:36:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:36:46,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:46,488 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-11-23 11:36:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:48,363 INFO L93 Difference]: Finished difference Result 316 states and 338 transitions. [2018-11-23 11:36:48,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:36:48,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 11:36:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:36:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 338 transitions. [2018-11-23 11:36:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:36:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 338 transitions. [2018-11-23 11:36:48,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 338 transitions. [2018-11-23 11:36:48,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 338 edges. 338 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:48,810 INFO L225 Difference]: With dead ends: 316 [2018-11-23 11:36:48,810 INFO L226 Difference]: Without dead ends: 314 [2018-11-23 11:36:48,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:36:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-23 11:36:49,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 106. [2018-11-23 11:36:49,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:49,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand 106 states. [2018-11-23 11:36:49,053 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand 106 states. [2018-11-23 11:36:49,053 INFO L87 Difference]: Start difference. First operand 314 states. Second operand 106 states. [2018-11-23 11:36:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:49,061 INFO L93 Difference]: Finished difference Result 314 states and 333 transitions. [2018-11-23 11:36:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 333 transitions. [2018-11-23 11:36:49,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:49,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:49,062 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 314 states. [2018-11-23 11:36:49,062 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 314 states. [2018-11-23 11:36:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:49,069 INFO L93 Difference]: Finished difference Result 314 states and 333 transitions. [2018-11-23 11:36:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 333 transitions. [2018-11-23 11:36:49,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:49,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:49,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:49,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 11:36:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2018-11-23 11:36:49,073 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 20 [2018-11-23 11:36:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:49,073 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2018-11-23 11:36:49,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:36:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2018-11-23 11:36:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:49,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:49,074 INFO L402 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-23 11:36:49,074 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:49,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:49,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1143576824, now seen corresponding path program 1 times [2018-11-23 11:36:49,075 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:49,075 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 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 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:49,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:49,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:49,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {9833#true} call ULTIMATE.init(); {9833#true} is VALID [2018-11-23 11:36:49,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {9833#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {9833#true} is VALID [2018-11-23 11:36:49,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {9833#true} assume true; {9833#true} is VALID [2018-11-23 11:36:49,204 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9833#true} {9833#true} #181#return; {9833#true} is VALID [2018-11-23 11:36:49,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {9833#true} call #t~ret7 := main(); {9833#true} is VALID [2018-11-23 11:36:49,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {9833#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {9833#true} is VALID [2018-11-23 11:36:49,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {9833#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {9856#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {9856#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {9856#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {9856#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9856#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {9856#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9856#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {9856#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9856#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {9856#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {9872#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {9872#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {9872#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {9872#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9872#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {9872#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9872#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {9872#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {9872#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {9872#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {9888#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:49,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {9888#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9892#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:49,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {9892#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {9834#false} is VALID [2018-11-23 11:36:49,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {9834#false} assume !false; {9834#false} is VALID [2018-11-23 11:36:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:49,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:49,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:49,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:49,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:49,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:49,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:49,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:49,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:49,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:49,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:49,247 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand 6 states. [2018-11-23 11:36:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:53,097 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2018-11-23 11:36:53,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:53,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2018-11-23 11:36:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2018-11-23 11:36:53,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 156 transitions. [2018-11-23 11:36:53,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:53,283 INFO L225 Difference]: With dead ends: 158 [2018-11-23 11:36:53,284 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 11:36:53,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 11:36:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 109. [2018-11-23 11:36:53,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:53,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 109 states. [2018-11-23 11:36:53,336 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 109 states. [2018-11-23 11:36:53,336 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 109 states. [2018-11-23 11:36:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:53,339 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2018-11-23 11:36:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2018-11-23 11:36:53,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:53,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:53,340 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 156 states. [2018-11-23 11:36:53,340 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 156 states. [2018-11-23 11:36:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:53,342 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2018-11-23 11:36:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2018-11-23 11:36:53,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:53,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:53,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:53,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 11:36:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2018-11-23 11:36:53,345 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 20 [2018-11-23 11:36:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:53,345 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2018-11-23 11:36:53,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2018-11-23 11:36:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:53,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:53,346 INFO L402 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-23 11:36:53,347 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:53,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2018-11-23 11:36:53,347 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:53,347 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 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 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:53,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:53,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:53,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {10517#true} call ULTIMATE.init(); {10517#true} is VALID [2018-11-23 11:36:53,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {10517#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {10517#true} is VALID [2018-11-23 11:36:53,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {10517#true} assume true; {10517#true} is VALID [2018-11-23 11:36:53,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10517#true} {10517#true} #181#return; {10517#true} is VALID [2018-11-23 11:36:53,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {10517#true} call #t~ret7 := main(); {10517#true} is VALID [2018-11-23 11:36:53,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {10517#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {10517#true} is VALID [2018-11-23 11:36:53,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {10517#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {10540#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {10540#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {10540#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {10540#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10540#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {10540#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10540#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {10540#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {10540#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {10540#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10556#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {10556#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {10556#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {10556#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {10556#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {10556#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10556#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {10556#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10556#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {10556#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {10572#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {10572#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10576#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:53,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {10576#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {10518#false} is VALID [2018-11-23 11:36:53,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {10518#false} assume !false; {10518#false} is VALID [2018-11-23 11:36:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:53,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:53,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:53,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:53,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:53,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:53,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:53,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:53,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:53,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:53,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:53,685 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand 6 states. [2018-11-23 11:36:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:54,603 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2018-11-23 11:36:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:54,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2018-11-23 11:36:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2018-11-23 11:36:54,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 154 transitions. [2018-11-23 11:36:54,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:54,777 INFO L225 Difference]: With dead ends: 156 [2018-11-23 11:36:54,777 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 11:36:54,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 11:36:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 111. [2018-11-23 11:36:54,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:54,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 111 states. [2018-11-23 11:36:54,942 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 111 states. [2018-11-23 11:36:54,942 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 111 states. [2018-11-23 11:36:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:54,946 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-11-23 11:36:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2018-11-23 11:36:54,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:54,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:54,947 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 154 states. [2018-11-23 11:36:54,947 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 154 states. [2018-11-23 11:36:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:54,950 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-11-23 11:36:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2018-11-23 11:36:54,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:54,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:54,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:54,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:36:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2018-11-23 11:36:54,952 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 20 [2018-11-23 11:36:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:54,953 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2018-11-23 11:36:54,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2018-11-23 11:36:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:36:54,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:54,954 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:54,954 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:54,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:54,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1873030403, now seen corresponding path program 1 times [2018-11-23 11:36:54,955 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:54,955 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 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 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:54,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:55,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:55,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {11197#true} call ULTIMATE.init(); {11197#true} is VALID [2018-11-23 11:36:55,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {11197#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {11197#true} is VALID [2018-11-23 11:36:55,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {11197#true} assume true; {11197#true} is VALID [2018-11-23 11:36:55,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11197#true} {11197#true} #181#return; {11197#true} is VALID [2018-11-23 11:36:55,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {11197#true} call #t~ret7 := main(); {11197#true} is VALID [2018-11-23 11:36:55,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {11197#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {11197#true} is VALID [2018-11-23 11:36:55,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {11197#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {11220#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {11220#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {11220#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {11220#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {11220#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {11220#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {11220#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {11220#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {11220#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {11220#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11236#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {11236#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {11236#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {11236#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {11236#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {11236#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {11236#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {11236#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {11236#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {11236#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11252#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {11252#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {11252#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {11252#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {11259#(= (bvadd main_~__VERIFIER_assert__cond~18 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:55,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {11259#(= (bvadd main_~__VERIFIER_assert__cond~18 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~18; {11198#false} is VALID [2018-11-23 11:36:55,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {11198#false} assume !false; {11198#false} is VALID [2018-11-23 11:36:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:55,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:36:55,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {11198#false} assume !false; {11198#false} is VALID [2018-11-23 11:36:55,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {11269#(not (= main_~__VERIFIER_assert__cond~18 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~18; {11198#false} is VALID [2018-11-23 11:36:55,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {11273#(bvsle (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {11269#(not (= main_~__VERIFIER_assert__cond~18 (_ bv0 32)))} is VALID [2018-11-23 11:36:55,284 INFO L273 TraceCheckUtils]: 17: Hoare triple {11273#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {11273#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11273#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:55,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:55,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:55,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:55,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:55,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11280#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:55,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:55,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:55,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:55,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:55,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {11197#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {11296#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:55,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {11197#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {11197#true} is VALID [2018-11-23 11:36:55,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {11197#true} call #t~ret7 := main(); {11197#true} is VALID [2018-11-23 11:36:55,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11197#true} {11197#true} #181#return; {11197#true} is VALID [2018-11-23 11:36:55,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {11197#true} assume true; {11197#true} is VALID [2018-11-23 11:36:55,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {11197#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {11197#true} is VALID [2018-11-23 11:36:55,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {11197#true} call ULTIMATE.init(); {11197#true} is VALID [2018-11-23 11:36:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:55,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:36:55,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:36:55,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-23 11:36:55,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:55,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:36:55,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:55,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:36:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:36:55,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:55,346 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand 10 states. [2018-11-23 11:36:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:58,693 INFO L93 Difference]: Finished difference Result 492 states and 525 transitions. [2018-11-23 11:36:58,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:36:58,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-23 11:36:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:36:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 525 transitions. [2018-11-23 11:36:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:36:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 525 transitions. [2018-11-23 11:36:58,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 525 transitions. [2018-11-23 11:36:59,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:59,401 INFO L225 Difference]: With dead ends: 492 [2018-11-23 11:36:59,402 INFO L226 Difference]: Without dead ends: 490 [2018-11-23 11:36:59,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:36:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-11-23 11:36:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 113. [2018-11-23 11:36:59,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:59,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 490 states. Second operand 113 states. [2018-11-23 11:36:59,454 INFO L74 IsIncluded]: Start isIncluded. First operand 490 states. Second operand 113 states. [2018-11-23 11:36:59,455 INFO L87 Difference]: Start difference. First operand 490 states. Second operand 113 states. [2018-11-23 11:36:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:59,469 INFO L93 Difference]: Finished difference Result 490 states and 520 transitions. [2018-11-23 11:36:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 520 transitions. [2018-11-23 11:36:59,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:59,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:59,470 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 490 states. [2018-11-23 11:36:59,470 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 490 states. [2018-11-23 11:36:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:59,481 INFO L93 Difference]: Finished difference Result 490 states and 520 transitions. [2018-11-23 11:36:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 520 transitions. [2018-11-23 11:36:59,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:59,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:59,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:59,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 11:36:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2018-11-23 11:36:59,484 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 21 [2018-11-23 11:36:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:59,485 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2018-11-23 11:36:59,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:36:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2018-11-23 11:36:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:36:59,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:59,486 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:59,486 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:59,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:59,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1873016501, now seen corresponding path program 1 times [2018-11-23 11:36:59,487 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:59,487 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:59,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:59,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:59,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {12990#true} call ULTIMATE.init(); {12990#true} is VALID [2018-11-23 11:36:59,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {12990#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {12990#true} is VALID [2018-11-23 11:36:59,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {12990#true} assume true; {12990#true} is VALID [2018-11-23 11:36:59,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12990#true} {12990#true} #181#return; {12990#true} is VALID [2018-11-23 11:36:59,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {12990#true} call #t~ret7 := main(); {12990#true} is VALID [2018-11-23 11:36:59,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {12990#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {12990#true} is VALID [2018-11-23 11:36:59,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {12990#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {13013#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {13013#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {13013#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {13013#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {13013#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {13013#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {13013#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {13013#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {13013#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {13013#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13029#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {13029#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {13029#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {13029#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {13029#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {13029#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {13029#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {13029#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {13029#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {13029#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13045#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {13045#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {13045#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {13045#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {13052#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:59,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {13052#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {12991#false} is VALID [2018-11-23 11:36:59,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {12991#false} assume !false; {12991#false} is VALID [2018-11-23 11:36:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:59,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:36:59,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {12991#false} assume !false; {12991#false} is VALID [2018-11-23 11:36:59,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {13062#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {12991#false} is VALID [2018-11-23 11:36:59,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {13066#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {13062#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} is VALID [2018-11-23 11:36:59,726 INFO L273 TraceCheckUtils]: 17: Hoare triple {13066#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {13066#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,727 INFO L273 TraceCheckUtils]: 16: Hoare triple {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13066#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:59,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:59,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:59,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:59,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:59,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {13073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:59,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:59,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:59,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:59,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:59,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {12990#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {13089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:59,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {12990#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {12990#true} is VALID [2018-11-23 11:36:59,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {12990#true} call #t~ret7 := main(); {12990#true} is VALID [2018-11-23 11:36:59,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12990#true} {12990#true} #181#return; {12990#true} is VALID [2018-11-23 11:36:59,736 INFO L273 TraceCheckUtils]: 2: Hoare triple {12990#true} assume true; {12990#true} is VALID [2018-11-23 11:36:59,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {12990#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {12990#true} is VALID [2018-11-23 11:36:59,736 INFO L256 TraceCheckUtils]: 0: Hoare triple {12990#true} call ULTIMATE.init(); {12990#true} is VALID [2018-11-23 11:36:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:36:59,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:36:59,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:36:59,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-23 11:36:59,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:59,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:36:59,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:59,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:36:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:36:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:59,786 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand 10 states. [2018-11-23 11:37:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:02,388 INFO L93 Difference]: Finished difference Result 503 states and 537 transitions. [2018-11-23 11:37:02,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:37:02,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-23 11:37:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 537 transitions. [2018-11-23 11:37:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 537 transitions. [2018-11-23 11:37:02,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 537 transitions. [2018-11-23 11:37:03,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 537 edges. 537 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:03,110 INFO L225 Difference]: With dead ends: 503 [2018-11-23 11:37:03,110 INFO L226 Difference]: Without dead ends: 501 [2018-11-23 11:37:03,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:37:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-11-23 11:37:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 114. [2018-11-23 11:37:03,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:03,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 501 states. Second operand 114 states. [2018-11-23 11:37:03,230 INFO L74 IsIncluded]: Start isIncluded. First operand 501 states. Second operand 114 states. [2018-11-23 11:37:03,230 INFO L87 Difference]: Start difference. First operand 501 states. Second operand 114 states. [2018-11-23 11:37:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:03,242 INFO L93 Difference]: Finished difference Result 501 states and 532 transitions. [2018-11-23 11:37:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 532 transitions. [2018-11-23 11:37:03,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:03,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:03,244 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 501 states. [2018-11-23 11:37:03,244 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 501 states. [2018-11-23 11:37:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:03,256 INFO L93 Difference]: Finished difference Result 501 states and 532 transitions. [2018-11-23 11:37:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 532 transitions. [2018-11-23 11:37:03,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:03,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:03,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:03,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:37:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-11-23 11:37:03,259 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 21 [2018-11-23 11:37:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:03,260 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-11-23 11:37:03,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-11-23 11:37:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:37:03,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:03,260 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:03,261 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:03,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1872588504, now seen corresponding path program 1 times [2018-11-23 11:37:03,262 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:03,262 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:03,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:03,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:03,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {14818#true} call ULTIMATE.init(); {14818#true} is VALID [2018-11-23 11:37:03,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {14818#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {14818#true} is VALID [2018-11-23 11:37:03,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {14818#true} assume true; {14818#true} is VALID [2018-11-23 11:37:03,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14818#true} {14818#true} #181#return; {14818#true} is VALID [2018-11-23 11:37:03,455 INFO L256 TraceCheckUtils]: 4: Hoare triple {14818#true} call #t~ret7 := main(); {14818#true} is VALID [2018-11-23 11:37:03,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {14818#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {14818#true} is VALID [2018-11-23 11:37:03,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {14818#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {14841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {14841#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {14841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {14841#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {14841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {14841#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {14841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {14841#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {14841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {14841#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {14857#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {14857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {14857#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {14857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {14857#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {14857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {14857#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {14857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {14857#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14873#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:03,465 INFO L273 TraceCheckUtils]: 17: Hoare triple {14873#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {14877#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:03,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {14877#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {14881#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:03,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {14881#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~15; {14819#false} is VALID [2018-11-23 11:37:03,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {14819#false} assume !false; {14819#false} is VALID [2018-11-23 11:37:03,468 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-23 11:37:03,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:03,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {14819#false} assume !false; {14819#false} is VALID [2018-11-23 11:37:03,515 INFO L273 TraceCheckUtils]: 19: Hoare triple {14891#(not (= main_~__VERIFIER_assert__cond~15 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~15; {14819#false} is VALID [2018-11-23 11:37:03,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {14895#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {14891#(not (= main_~__VERIFIER_assert__cond~15 (_ bv0 32)))} is VALID [2018-11-23 11:37:03,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {14818#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {14895#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:03,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {14818#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14818#true} is VALID [2018-11-23 11:37:03,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {14818#true} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {14818#true} is VALID [2018-11-23 11:37:03,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {14818#true} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {14818#true} is VALID [2018-11-23 11:37:03,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {14818#true} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {14818#true} is VALID [2018-11-23 11:37:03,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {14818#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {14818#true} is VALID [2018-11-23 11:37:03,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {14818#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14818#true} is VALID [2018-11-23 11:37:03,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {14818#true} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {14818#true} is VALID [2018-11-23 11:37:03,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {14818#true} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {14818#true} is VALID [2018-11-23 11:37:03,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {14818#true} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {14818#true} is VALID [2018-11-23 11:37:03,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {14818#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {14818#true} is VALID [2018-11-23 11:37:03,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {14818#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {14818#true} is VALID [2018-11-23 11:37:03,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {14818#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {14818#true} is VALID [2018-11-23 11:37:03,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {14818#true} call #t~ret7 := main(); {14818#true} is VALID [2018-11-23 11:37:03,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14818#true} {14818#true} #181#return; {14818#true} is VALID [2018-11-23 11:37:03,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {14818#true} assume true; {14818#true} is VALID [2018-11-23 11:37:03,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {14818#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {14818#true} is VALID [2018-11-23 11:37:03,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {14818#true} call ULTIMATE.init(); {14818#true} is VALID [2018-11-23 11:37:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:37:03,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:37:03,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 11:37:03,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-23 11:37:03,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:03,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:37:03,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:03,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:37:03,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:37:03,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:03,560 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 9 states. [2018-11-23 11:37:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,014 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2018-11-23 11:37:05,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:37:05,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-23 11:37:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-23 11:37:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-23 11:37:05,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2018-11-23 11:37:05,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:05,201 INFO L225 Difference]: With dead ends: 151 [2018-11-23 11:37:05,201 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 11:37:05,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 11:37:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 110. [2018-11-23 11:37:05,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:05,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 110 states. [2018-11-23 11:37:05,253 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 110 states. [2018-11-23 11:37:05,253 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 110 states. [2018-11-23 11:37:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,256 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2018-11-23 11:37:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2018-11-23 11:37:05,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:05,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:05,257 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 145 states. [2018-11-23 11:37:05,257 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 145 states. [2018-11-23 11:37:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,259 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2018-11-23 11:37:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2018-11-23 11:37:05,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:05,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:05,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:05,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 11:37:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2018-11-23 11:37:05,261 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 21 [2018-11-23 11:37:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:05,261 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2018-11-23 11:37:05,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:37:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2018-11-23 11:37:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:37:05,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:05,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:05,262 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:05,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:05,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1091140097, now seen corresponding path program 1 times [2018-11-23 11:37:05,263 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:05,263 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:05,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:05,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {15548#true} call ULTIMATE.init(); {15548#true} is VALID [2018-11-23 11:37:05,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {15548#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {15548#true} is VALID [2018-11-23 11:37:05,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {15548#true} assume true; {15548#true} is VALID [2018-11-23 11:37:05,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15548#true} {15548#true} #181#return; {15548#true} is VALID [2018-11-23 11:37:05,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {15548#true} call #t~ret7 := main(); {15548#true} is VALID [2018-11-23 11:37:05,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {15548#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {15548#true} is VALID [2018-11-23 11:37:05,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {15548#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {15571#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {15571#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {15571#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {15571#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {15571#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {15571#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {15571#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {15571#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {15571#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {15571#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15587#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {15587#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {15587#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {15587#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {15587#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {15587#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {15587#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {15587#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {15587#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {15587#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15603#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:05,404 INFO L273 TraceCheckUtils]: 17: Hoare triple {15603#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {15607#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:05,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {15607#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {15611#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:05,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {15611#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~3; {15549#false} is VALID [2018-11-23 11:37:05,406 INFO L273 TraceCheckUtils]: 20: Hoare triple {15549#false} assume !false; {15549#false} is VALID [2018-11-23 11:37:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:05,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:05,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:05,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:05,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:37:05,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:05,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:05,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:05,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:05,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:05,436 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 7 states. [2018-11-23 11:37:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:06,381 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2018-11-23 11:37:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:06,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:37:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-23 11:37:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-23 11:37:06,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 141 transitions. [2018-11-23 11:37:06,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:06,547 INFO L225 Difference]: With dead ends: 145 [2018-11-23 11:37:06,547 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 11:37:06,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 11:37:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2018-11-23 11:37:06,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:06,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 109 states. [2018-11-23 11:37:06,606 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 109 states. [2018-11-23 11:37:06,606 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 109 states. [2018-11-23 11:37:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:06,609 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2018-11-23 11:37:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2018-11-23 11:37:06,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:06,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:06,610 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 141 states. [2018-11-23 11:37:06,610 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 141 states. [2018-11-23 11:37:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:06,612 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2018-11-23 11:37:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2018-11-23 11:37:06,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:06,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:06,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:06,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 11:37:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2018-11-23 11:37:06,614 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 21 [2018-11-23 11:37:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:06,615 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2018-11-23 11:37:06,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2018-11-23 11:37:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:37:06,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:06,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:06,616 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:06,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:06,616 INFO L82 PathProgramCache]: Analyzing trace with hash -696307712, now seen corresponding path program 1 times [2018-11-23 11:37:06,617 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:06,617 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 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 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:06,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:06,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:06,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {16193#true} call ULTIMATE.init(); {16193#true} is VALID [2018-11-23 11:37:06,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {16193#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {16193#true} is VALID [2018-11-23 11:37:06,762 INFO L273 TraceCheckUtils]: 2: Hoare triple {16193#true} assume true; {16193#true} is VALID [2018-11-23 11:37:06,762 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16193#true} {16193#true} #181#return; {16193#true} is VALID [2018-11-23 11:37:06,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {16193#true} call #t~ret7 := main(); {16193#true} is VALID [2018-11-23 11:37:06,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {16193#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {16193#true} is VALID [2018-11-23 11:37:06,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {16193#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {16216#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {16216#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {16216#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {16216#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {16216#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {16216#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {16216#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {16216#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {16216#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {16216#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16232#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {16232#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {16232#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {16232#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {16232#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {16232#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {16232#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {16232#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {16232#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {16232#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {16248#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {16248#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {16248#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {16255#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:06,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {16255#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {16194#false} is VALID [2018-11-23 11:37:06,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {16194#false} assume !false; {16194#false} is VALID [2018-11-23 11:37:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:06,771 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:06,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:06,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:37:06,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:37:06,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:06,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:37:06,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:06,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:37:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:37:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:37:06,798 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 6 states. [2018-11-23 11:37:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:07,972 INFO L93 Difference]: Finished difference Result 188 states and 207 transitions. [2018-11-23 11:37:07,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:07,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:37:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:07,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2018-11-23 11:37:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2018-11-23 11:37:07,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 188 transitions. [2018-11-23 11:37:08,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:08,190 INFO L225 Difference]: With dead ends: 188 [2018-11-23 11:37:08,190 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 11:37:08,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 11:37:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 114. [2018-11-23 11:37:08,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:08,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 114 states. [2018-11-23 11:37:08,248 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 114 states. [2018-11-23 11:37:08,248 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 114 states. [2018-11-23 11:37:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:08,252 INFO L93 Difference]: Finished difference Result 186 states and 205 transitions. [2018-11-23 11:37:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-11-23 11:37:08,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:08,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:08,253 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 186 states. [2018-11-23 11:37:08,253 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 186 states. [2018-11-23 11:37:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:08,256 INFO L93 Difference]: Finished difference Result 186 states and 205 transitions. [2018-11-23 11:37:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-11-23 11:37:08,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:08,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:08,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:08,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:37:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2018-11-23 11:37:08,259 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 21 [2018-11-23 11:37:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:08,259 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2018-11-23 11:37:08,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:37:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2018-11-23 11:37:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:37:08,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:08,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:08,260 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:08,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:08,261 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2018-11-23 11:37:08,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:08,261 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 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 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:08,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:08,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:08,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {16982#true} call ULTIMATE.init(); {16982#true} is VALID [2018-11-23 11:37:08,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {16982#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {16982#true} is VALID [2018-11-23 11:37:08,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {16982#true} assume true; {16982#true} is VALID [2018-11-23 11:37:08,547 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16982#true} {16982#true} #181#return; {16982#true} is VALID [2018-11-23 11:37:08,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {16982#true} call #t~ret7 := main(); {16982#true} is VALID [2018-11-23 11:37:08,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {16982#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {16982#true} is VALID [2018-11-23 11:37:08,549 INFO L273 TraceCheckUtils]: 6: Hoare triple {16982#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17005#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {17005#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {17005#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {17005#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {17005#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {17005#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {17005#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {17005#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {17005#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {17005#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17021#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {17021#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {17021#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {17021#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {17021#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {17021#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {17021#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {17021#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {17021#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {17021#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17037#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {17037#(= (_ bv2 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {17041#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:08,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {17041#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {17045#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:08,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {17045#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {16983#false} is VALID [2018-11-23 11:37:08,570 INFO L273 TraceCheckUtils]: 20: Hoare triple {16983#false} assume !false; {16983#false} is VALID [2018-11-23 11:37:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:08,571 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:08,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:08,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:08,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:37:08,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:08,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:08,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:08,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:08,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:08,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:08,597 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand 7 states. [2018-11-23 11:37:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:09,648 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2018-11-23 11:37:09,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:09,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:37:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2018-11-23 11:37:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2018-11-23 11:37:09,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 135 transitions. [2018-11-23 11:37:09,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:09,799 INFO L225 Difference]: With dead ends: 139 [2018-11-23 11:37:09,799 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 11:37:09,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 11:37:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2018-11-23 11:37:09,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:09,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 113 states. [2018-11-23 11:37:09,856 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 113 states. [2018-11-23 11:37:09,856 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 113 states. [2018-11-23 11:37:09,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:09,859 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2018-11-23 11:37:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2018-11-23 11:37:09,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:09,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:09,859 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 135 states. [2018-11-23 11:37:09,859 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 135 states. [2018-11-23 11:37:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:09,861 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2018-11-23 11:37:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2018-11-23 11:37:09,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:09,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:09,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:09,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 11:37:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2018-11-23 11:37:09,864 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 21 [2018-11-23 11:37:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:09,865 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2018-11-23 11:37:09,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2018-11-23 11:37:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:09,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:09,865 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:09,866 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:09,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:09,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2065596439, now seen corresponding path program 1 times [2018-11-23 11:37:09,867 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:09,867 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 27 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 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:09,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:09,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:10,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {17614#true} call ULTIMATE.init(); {17614#true} is VALID [2018-11-23 11:37:10,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {17614#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {17614#true} is VALID [2018-11-23 11:37:10,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {17614#true} assume true; {17614#true} is VALID [2018-11-23 11:37:10,202 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17614#true} {17614#true} #181#return; {17614#true} is VALID [2018-11-23 11:37:10,203 INFO L256 TraceCheckUtils]: 4: Hoare triple {17614#true} call #t~ret7 := main(); {17614#true} is VALID [2018-11-23 11:37:10,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {17614#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17614#true} is VALID [2018-11-23 11:37:10,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {17614#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17637#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:10,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {17637#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {17641#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:10,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {17641#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {17641#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:10,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {17641#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {17648#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} is VALID [2018-11-23 11:37:10,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {17648#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {17652#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:10,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {17652#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17656#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:10,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {17656#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17660#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:10,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {17660#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {17660#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:10,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {17660#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {17660#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:10,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {17660#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {17660#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:10,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {17660#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17673#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:10,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {17673#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17673#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:10,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {17673#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {17673#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:10,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {17673#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {17683#(= (bvadd main_~__VERIFIER_assert__cond~19 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:10,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {17683#(= (bvadd main_~__VERIFIER_assert__cond~19 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~19; {17615#false} is VALID [2018-11-23 11:37:10,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {17615#false} assume !false; {17615#false} is VALID [2018-11-23 11:37:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:10,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:10,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {17615#false} assume !false; {17615#false} is VALID [2018-11-23 11:37:10,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {17693#(not (= main_~__VERIFIER_assert__cond~19 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~19; {17615#false} is VALID [2018-11-23 11:37:10,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {17697#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {17693#(not (= main_~__VERIFIER_assert__cond~19 (_ bv0 32)))} is VALID [2018-11-23 11:37:10,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {17697#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {17697#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:10,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {17697#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17697#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:10,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {17707#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17697#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:10,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {17707#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {17707#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:10,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {17707#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {17707#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:10,759 INFO L273 TraceCheckUtils]: 13: Hoare triple {17707#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {17707#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:10,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {17720#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {17707#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:10,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {17724#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17720#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:10,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {17728#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {17724#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:10,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {17732#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {17728#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} is VALID [2018-11-23 11:37:10,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {17732#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {17732#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:10,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {17614#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {17732#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:10,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {17614#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17614#true} is VALID [2018-11-23 11:37:10,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {17614#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17614#true} is VALID [2018-11-23 11:37:10,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {17614#true} call #t~ret7 := main(); {17614#true} is VALID [2018-11-23 11:37:10,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17614#true} {17614#true} #181#return; {17614#true} is VALID [2018-11-23 11:37:10,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {17614#true} assume true; {17614#true} is VALID [2018-11-23 11:37:10,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {17614#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {17614#true} is VALID [2018-11-23 11:37:10,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {17614#true} call ULTIMATE.init(); {17614#true} is VALID [2018-11-23 11:37:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:10,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:10,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-23 11:37:10,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-23 11:37:10,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:10,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:37:10,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:10,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:37:10,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:37:10,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:37:10,939 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 17 states. [2018-11-23 11:37:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:16,742 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-11-23 11:37:16,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:37:16,742 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-23 11:37:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2018-11-23 11:37:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2018-11-23 11:37:16,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 168 transitions. [2018-11-23 11:37:17,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:17,120 INFO L225 Difference]: With dead ends: 169 [2018-11-23 11:37:17,120 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 11:37:17,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:37:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 11:37:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 111. [2018-11-23 11:37:17,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:17,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 111 states. [2018-11-23 11:37:17,242 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 111 states. [2018-11-23 11:37:17,242 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 111 states. [2018-11-23 11:37:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:17,245 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-11-23 11:37:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2018-11-23 11:37:17,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:17,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:17,245 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 167 states. [2018-11-23 11:37:17,246 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 167 states. [2018-11-23 11:37:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:17,248 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-11-23 11:37:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2018-11-23 11:37:17,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:17,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:17,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:17,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:37:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2018-11-23 11:37:17,251 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 22 [2018-11-23 11:37:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:17,252 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2018-11-23 11:37:17,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:37:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-11-23 11:37:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:17,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:17,253 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:17,253 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:17,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2066027415, now seen corresponding path program 1 times [2018-11-23 11:37:17,254 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:17,254 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 28 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 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:17,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:17,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:17,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {18435#true} call ULTIMATE.init(); {18435#true} is VALID [2018-11-23 11:37:17,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {18435#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {18435#true} is VALID [2018-11-23 11:37:17,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {18435#true} assume true; {18435#true} is VALID [2018-11-23 11:37:17,623 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18435#true} {18435#true} #181#return; {18435#true} is VALID [2018-11-23 11:37:17,623 INFO L256 TraceCheckUtils]: 4: Hoare triple {18435#true} call #t~ret7 := main(); {18435#true} is VALID [2018-11-23 11:37:17,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {18435#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {18435#true} is VALID [2018-11-23 11:37:17,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {18435#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {18458#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:17,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {18458#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {18462#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:17,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {18462#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {18462#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:17,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {18462#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {18469#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} is VALID [2018-11-23 11:37:17,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {18469#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {18473#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:17,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {18473#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18477#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:17,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {18477#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {18481#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:17,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {18481#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {18481#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:17,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {18481#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {18481#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:17,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {18481#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {18481#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:17,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {18481#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18494#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:17,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {18494#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {18494#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:17,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {18494#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {18494#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:17,635 INFO L273 TraceCheckUtils]: 19: Hoare triple {18494#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {18504#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:17,636 INFO L273 TraceCheckUtils]: 20: Hoare triple {18504#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~17; {18436#false} is VALID [2018-11-23 11:37:17,636 INFO L273 TraceCheckUtils]: 21: Hoare triple {18436#false} assume !false; {18436#false} is VALID [2018-11-23 11:37:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:17,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:18,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {18436#false} assume !false; {18436#false} is VALID [2018-11-23 11:37:18,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {18514#(not (= main_~__VERIFIER_assert__cond~17 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~17; {18436#false} is VALID [2018-11-23 11:37:18,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {18518#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {18514#(not (= main_~__VERIFIER_assert__cond~17 (_ bv0 32)))} is VALID [2018-11-23 11:37:18,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {18518#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {18518#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:18,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {18518#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {18518#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:18,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {18528#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18518#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:18,048 INFO L273 TraceCheckUtils]: 15: Hoare triple {18528#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {18528#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:18,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {18528#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {18528#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:18,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {18528#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {18528#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:18,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {18541#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {18528#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:18,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {18545#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {18541#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:18,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {18549#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {18545#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:18,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {18553#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {18549#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))} is VALID [2018-11-23 11:37:18,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {18553#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {18553#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:18,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {18435#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {18553#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:18,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {18435#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {18435#true} is VALID [2018-11-23 11:37:18,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {18435#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {18435#true} is VALID [2018-11-23 11:37:18,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {18435#true} call #t~ret7 := main(); {18435#true} is VALID [2018-11-23 11:37:18,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18435#true} {18435#true} #181#return; {18435#true} is VALID [2018-11-23 11:37:18,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {18435#true} assume true; {18435#true} is VALID [2018-11-23 11:37:18,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {18435#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {18435#true} is VALID [2018-11-23 11:37:18,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {18435#true} call ULTIMATE.init(); {18435#true} is VALID [2018-11-23 11:37:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:18,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:18,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-23 11:37:18,118 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-23 11:37:18,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:18,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:37:18,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:18,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:37:18,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:37:18,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:37:18,223 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 17 states. [2018-11-23 11:37:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:22,263 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2018-11-23 11:37:22,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:37:22,263 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-23 11:37:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 187 transitions. [2018-11-23 11:37:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 187 transitions. [2018-11-23 11:37:22,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 187 transitions. [2018-11-23 11:37:22,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:22,763 INFO L225 Difference]: With dead ends: 186 [2018-11-23 11:37:22,764 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 11:37:22,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:37:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 11:37:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 109. [2018-11-23 11:37:22,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:22,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 109 states. [2018-11-23 11:37:22,825 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 109 states. [2018-11-23 11:37:22,825 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 109 states. [2018-11-23 11:37:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:22,829 INFO L93 Difference]: Finished difference Result 184 states and 201 transitions. [2018-11-23 11:37:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 201 transitions. [2018-11-23 11:37:22,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:22,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:22,829 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 184 states. [2018-11-23 11:37:22,829 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 184 states. [2018-11-23 11:37:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:22,833 INFO L93 Difference]: Finished difference Result 184 states and 201 transitions. [2018-11-23 11:37:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 201 transitions. [2018-11-23 11:37:22,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:22,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:22,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:22,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 11:37:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2018-11-23 11:37:22,835 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 22 [2018-11-23 11:37:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:22,835 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2018-11-23 11:37:22,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:37:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2018-11-23 11:37:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:22,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:22,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:22,837 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:22,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash 548617690, now seen corresponding path program 1 times [2018-11-23 11:37:22,837 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:22,837 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 29 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 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:22,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:22,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:22,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {19307#true} call ULTIMATE.init(); {19307#true} is VALID [2018-11-23 11:37:22,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {19307#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {19307#true} is VALID [2018-11-23 11:37:22,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {19307#true} assume true; {19307#true} is VALID [2018-11-23 11:37:22,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19307#true} {19307#true} #181#return; {19307#true} is VALID [2018-11-23 11:37:22,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {19307#true} call #t~ret7 := main(); {19307#true} is VALID [2018-11-23 11:37:22,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {19307#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {19307#true} is VALID [2018-11-23 11:37:22,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {19307#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {19330#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {19330#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {19330#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {19330#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {19330#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {19330#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {19330#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {19330#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {19330#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {19330#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19346#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {19346#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {19346#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {19346#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {19346#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {19346#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {19346#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,972 INFO L273 TraceCheckUtils]: 15: Hoare triple {19346#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {19346#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {19346#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19362#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {19362#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {19362#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {19362#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {19362#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {19362#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {19372#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:22,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {19372#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {19308#false} is VALID [2018-11-23 11:37:22,975 INFO L273 TraceCheckUtils]: 21: Hoare triple {19308#false} assume !false; {19308#false} is VALID [2018-11-23 11:37:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:22,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:22,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:22,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:37:22,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:37:22,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:22,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:37:23,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:23,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:37:23,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:37:23,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:37:23,007 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand 6 states. [2018-11-23 11:37:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:24,149 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2018-11-23 11:37:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:24,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:37:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2018-11-23 11:37:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2018-11-23 11:37:24,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 160 transitions. [2018-11-23 11:37:24,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:24,331 INFO L225 Difference]: With dead ends: 162 [2018-11-23 11:37:24,331 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 11:37:24,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 11:37:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2018-11-23 11:37:24,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:24,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 110 states. [2018-11-23 11:37:24,423 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 110 states. [2018-11-23 11:37:24,423 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 110 states. [2018-11-23 11:37:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:24,426 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2018-11-23 11:37:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2018-11-23 11:37:24,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:24,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:24,426 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 160 states. [2018-11-23 11:37:24,427 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 160 states. [2018-11-23 11:37:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:24,429 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2018-11-23 11:37:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2018-11-23 11:37:24,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:24,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:24,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:24,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 11:37:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-11-23 11:37:24,431 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 22 [2018-11-23 11:37:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:24,431 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-11-23 11:37:24,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:37:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-11-23 11:37:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:24,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:24,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:24,432 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:24,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash 550156890, now seen corresponding path program 1 times [2018-11-23 11:37:24,432 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:24,433 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 30 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 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:24,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:24,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:24,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {20016#true} call ULTIMATE.init(); {20016#true} is VALID [2018-11-23 11:37:24,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {20016#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {20016#true} is VALID [2018-11-23 11:37:24,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {20016#true} assume true; {20016#true} is VALID [2018-11-23 11:37:24,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20016#true} {20016#true} #181#return; {20016#true} is VALID [2018-11-23 11:37:24,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {20016#true} call #t~ret7 := main(); {20016#true} is VALID [2018-11-23 11:37:24,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {20016#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {20016#true} is VALID [2018-11-23 11:37:24,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {20016#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {20039#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {20039#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {20039#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {20039#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {20039#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {20039#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {20039#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {20039#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {20039#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {20039#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20055#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {20055#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {20055#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {20055#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {20055#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {20055#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {20055#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {20055#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {20055#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {20055#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20071#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {20071#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {20071#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,574 INFO L273 TraceCheckUtils]: 18: Hoare triple {20071#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {20071#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:24,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {20071#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {20081#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:24,575 INFO L273 TraceCheckUtils]: 20: Hoare triple {20081#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {20017#false} is VALID [2018-11-23 11:37:24,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {20017#false} assume !false; {20017#false} is VALID [2018-11-23 11:37:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:24,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:24,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:24,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:37:24,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:37:24,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:24,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:37:24,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:24,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:37:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:37:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:37:24,622 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 6 states. [2018-11-23 11:37:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:25,435 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-11-23 11:37:25,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:37:25,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:37:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-23 11:37:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-23 11:37:25,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 121 transitions. [2018-11-23 11:37:25,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:25,574 INFO L225 Difference]: With dead ends: 125 [2018-11-23 11:37:25,574 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 11:37:25,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 11:37:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2018-11-23 11:37:25,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:25,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 111 states. [2018-11-23 11:37:25,645 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 111 states. [2018-11-23 11:37:25,645 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 111 states. [2018-11-23 11:37:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:25,647 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-11-23 11:37:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-11-23 11:37:25,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:25,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:25,647 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 123 states. [2018-11-23 11:37:25,647 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 123 states. [2018-11-23 11:37:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:25,649 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-11-23 11:37:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-11-23 11:37:25,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:25,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:25,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:25,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:37:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2018-11-23 11:37:25,651 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 22 [2018-11-23 11:37:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:25,651 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2018-11-23 11:37:25,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:37:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-11-23 11:37:25,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:25,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:25,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:25,652 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:25,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash -110699461, now seen corresponding path program 1 times [2018-11-23 11:37:25,653 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:25,653 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 31 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 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:25,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:25,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:25,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {20610#true} call ULTIMATE.init(); {20610#true} is VALID [2018-11-23 11:37:25,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {20610#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {20610#true} is VALID [2018-11-23 11:37:25,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {20610#true} assume true; {20610#true} is VALID [2018-11-23 11:37:25,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20610#true} {20610#true} #181#return; {20610#true} is VALID [2018-11-23 11:37:25,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {20610#true} call #t~ret7 := main(); {20610#true} is VALID [2018-11-23 11:37:25,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {20610#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {20610#true} is VALID [2018-11-23 11:37:25,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {20610#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {20633#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {20633#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {20637#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:25,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {20637#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20637#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:25,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {20637#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {20644#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:37:25,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {20644#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {20648#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:25,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {20648#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20652#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:25,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {20652#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {20656#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:25,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {20656#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {20656#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:25,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {20656#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {20656#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:25,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {20656#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {20656#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:25,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {20656#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20669#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:25,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {20669#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0); {20669#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:25,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {20669#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {20669#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:25,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {20669#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {20679#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:25,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {20679#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {20611#false} is VALID [2018-11-23 11:37:25,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {20611#false} assume !false; {20611#false} is VALID [2018-11-23 11:37:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:25,967 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:25,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:25,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:37:25,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 11:37:25,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:25,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:25,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:25,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:25,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:25,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:25,999 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 10 states. [2018-11-23 11:37:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:27,852 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2018-11-23 11:37:27,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:37:27,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 11:37:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2018-11-23 11:37:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2018-11-23 11:37:27,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2018-11-23 11:37:28,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:28,020 INFO L225 Difference]: With dead ends: 163 [2018-11-23 11:37:28,020 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 11:37:28,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:37:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 11:37:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-11-23 11:37:28,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:28,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 118 states. [2018-11-23 11:37:28,429 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 118 states. [2018-11-23 11:37:28,429 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 118 states. [2018-11-23 11:37:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:28,432 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2018-11-23 11:37:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 179 transitions. [2018-11-23 11:37:28,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:28,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:28,434 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 161 states. [2018-11-23 11:37:28,434 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 161 states. [2018-11-23 11:37:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:28,436 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2018-11-23 11:37:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 179 transitions. [2018-11-23 11:37:28,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:28,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:28,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:28,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 11:37:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2018-11-23 11:37:28,439 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 22 [2018-11-23 11:37:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:28,439 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2018-11-23 11:37:28,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2018-11-23 11:37:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:37:28,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:28,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:28,440 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:28,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:28,441 INFO L82 PathProgramCache]: Analyzing trace with hash -172717694, now seen corresponding path program 1 times [2018-11-23 11:37:28,441 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:28,441 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 32 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 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:28,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:28,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:28,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {21339#true} call ULTIMATE.init(); {21339#true} is VALID [2018-11-23 11:37:28,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {21339#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {21339#true} is VALID [2018-11-23 11:37:28,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {21339#true} assume true; {21339#true} is VALID [2018-11-23 11:37:28,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21339#true} {21339#true} #181#return; {21339#true} is VALID [2018-11-23 11:37:28,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {21339#true} call #t~ret7 := main(); {21339#true} is VALID [2018-11-23 11:37:28,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {21339#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {21339#true} is VALID [2018-11-23 11:37:28,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {21339#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {21362#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:28,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {21362#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {21366#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:28,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {21366#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {21366#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:28,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {21366#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {21373#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} is VALID [2018-11-23 11:37:28,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {21373#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {21377#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:28,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {21377#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21381#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:28,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {21381#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {21385#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:28,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {21385#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {21385#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:28,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {21385#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {21385#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:28,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {21385#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {21385#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:28,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {21385#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21398#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:28,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {21398#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {21398#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:28,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {21398#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {21398#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:28,714 INFO L273 TraceCheckUtils]: 19: Hoare triple {21398#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {21398#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:28,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {21398#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {21411#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:28,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {21411#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {21340#false} is VALID [2018-11-23 11:37:28,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {21340#false} assume !false; {21340#false} is VALID [2018-11-23 11:37:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:28,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:28,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:28,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:37:28,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:37:28,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:28,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:28,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:28,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:28,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:28,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:28,750 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand 10 states. [2018-11-23 11:37:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:30,256 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2018-11-23 11:37:30,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:37:30,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:37:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2018-11-23 11:37:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2018-11-23 11:37:30,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 142 transitions. [2018-11-23 11:37:30,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:30,428 INFO L225 Difference]: With dead ends: 165 [2018-11-23 11:37:30,429 INFO L226 Difference]: Without dead ends: 163 [2018-11-23 11:37:30,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-23 11:37:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 120. [2018-11-23 11:37:30,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:30,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 120 states. [2018-11-23 11:37:30,560 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 120 states. [2018-11-23 11:37:30,560 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 120 states. [2018-11-23 11:37:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:30,563 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2018-11-23 11:37:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2018-11-23 11:37:30,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:30,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:30,564 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 163 states. [2018-11-23 11:37:30,564 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 163 states. [2018-11-23 11:37:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:30,566 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2018-11-23 11:37:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2018-11-23 11:37:30,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:30,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:30,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:30,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 11:37:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2018-11-23 11:37:30,568 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 23 [2018-11-23 11:37:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:30,569 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2018-11-23 11:37:30,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2018-11-23 11:37:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:37:30,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:30,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:30,569 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:30,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash -125002444, now seen corresponding path program 1 times [2018-11-23 11:37:30,570 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:30,570 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 33 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 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:30,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:30,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:30,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {22077#true} call ULTIMATE.init(); {22077#true} is VALID [2018-11-23 11:37:30,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {22077#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {22077#true} is VALID [2018-11-23 11:37:30,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {22077#true} assume true; {22077#true} is VALID [2018-11-23 11:37:30,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22077#true} {22077#true} #181#return; {22077#true} is VALID [2018-11-23 11:37:30,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {22077#true} call #t~ret7 := main(); {22077#true} is VALID [2018-11-23 11:37:30,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {22077#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {22077#true} is VALID [2018-11-23 11:37:30,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {22077#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {22100#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:30,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {22100#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {22104#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:30,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {22104#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {22104#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:30,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {22104#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {22111#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} is VALID [2018-11-23 11:37:30,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {22111#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {22115#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:30,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {22115#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22119#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:30,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {22119#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {22123#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:30,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {22123#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {22123#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:30,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {22123#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {22123#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:30,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {22123#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {22123#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:30,823 INFO L273 TraceCheckUtils]: 16: Hoare triple {22123#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22136#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:30,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {22136#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {22136#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:30,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {22136#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {22136#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:30,826 INFO L273 TraceCheckUtils]: 19: Hoare triple {22136#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {22136#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:30,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {22136#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {22149#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:30,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {22149#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {22078#false} is VALID [2018-11-23 11:37:30,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {22078#false} assume !false; {22078#false} is VALID [2018-11-23 11:37:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:30,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:30,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:30,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:37:30,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:37:30,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:30,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:30,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:30,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:30,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:30,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:30,864 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 10 states. [2018-11-23 11:37:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:32,063 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2018-11-23 11:37:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:32,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:37:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-23 11:37:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-23 11:37:32,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 105 transitions. [2018-11-23 11:37:32,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:32,190 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:37:32,190 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 11:37:32,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 11:37:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2018-11-23 11:37:32,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:32,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 120 states. [2018-11-23 11:37:32,277 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 120 states. [2018-11-23 11:37:32,278 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 120 states. [2018-11-23 11:37:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:32,280 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2018-11-23 11:37:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-11-23 11:37:32,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:32,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:32,281 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 126 states. [2018-11-23 11:37:32,281 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 126 states. [2018-11-23 11:37:32,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:32,283 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2018-11-23 11:37:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-11-23 11:37:32,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:32,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:32,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:32,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 11:37:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-11-23 11:37:32,286 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 23 [2018-11-23 11:37:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:32,287 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-11-23 11:37:32,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-11-23 11:37:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:32,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:32,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:32,288 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:32,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:32,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1016950067, now seen corresponding path program 1 times [2018-11-23 11:37:32,288 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 34 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 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:32,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:32,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:32,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {22704#true} call ULTIMATE.init(); {22704#true} is VALID [2018-11-23 11:37:32,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {22704#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {22704#true} is VALID [2018-11-23 11:37:32,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {22704#true} assume true; {22704#true} is VALID [2018-11-23 11:37:32,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22704#true} {22704#true} #181#return; {22704#true} is VALID [2018-11-23 11:37:32,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {22704#true} call #t~ret7 := main(); {22704#true} is VALID [2018-11-23 11:37:32,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {22704#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {22704#true} is VALID [2018-11-23 11:37:32,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {22704#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {22727#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:32,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {22727#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {22731#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:32,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {22731#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {22731#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:32,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {22731#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {22738#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} is VALID [2018-11-23 11:37:32,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {22738#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {22742#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:32,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {22742#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22746#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:32,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {22746#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {22750#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:32,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {22750#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {22750#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:32,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {22750#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {22750#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:32,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {22750#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {22750#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:32,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {22750#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:32,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:32,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:32,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:32,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:32,684 INFO L273 TraceCheckUtils]: 21: Hoare triple {22763#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {22779#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:32,685 INFO L273 TraceCheckUtils]: 22: Hoare triple {22779#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {22705#false} is VALID [2018-11-23 11:37:32,685 INFO L273 TraceCheckUtils]: 23: Hoare triple {22705#false} assume !false; {22705#false} is VALID [2018-11-23 11:37:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:32,687 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:32,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:32,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:37:32,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 11:37:32,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:32,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:32,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:32,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:32,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:32,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:32,736 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 10 states. [2018-11-23 11:37:34,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:34,801 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2018-11-23 11:37:34,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:37:34,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 11:37:34,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2018-11-23 11:37:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2018-11-23 11:37:34,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 136 transitions. [2018-11-23 11:37:34,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:34,968 INFO L225 Difference]: With dead ends: 159 [2018-11-23 11:37:34,969 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 11:37:34,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 11:37:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 118. [2018-11-23 11:37:35,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:35,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 118 states. [2018-11-23 11:37:35,122 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 118 states. [2018-11-23 11:37:35,123 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 118 states. [2018-11-23 11:37:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:35,126 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2018-11-23 11:37:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2018-11-23 11:37:35,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:35,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:35,126 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 157 states. [2018-11-23 11:37:35,126 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 157 states. [2018-11-23 11:37:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:35,128 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2018-11-23 11:37:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2018-11-23 11:37:35,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:35,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:35,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:35,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 11:37:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2018-11-23 11:37:35,131 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 24 [2018-11-23 11:37:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:35,131 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2018-11-23 11:37:35,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2018-11-23 11:37:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:35,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:35,132 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:35,132 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:35,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1860398239, now seen corresponding path program 1 times [2018-11-23 11:37:35,132 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:35,132 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 35 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 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:35,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:35,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:35,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {23424#true} call ULTIMATE.init(); {23424#true} is VALID [2018-11-23 11:37:35,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {23424#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {23424#true} is VALID [2018-11-23 11:37:35,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {23424#true} assume true; {23424#true} is VALID [2018-11-23 11:37:35,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23424#true} {23424#true} #181#return; {23424#true} is VALID [2018-11-23 11:37:35,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {23424#true} call #t~ret7 := main(); {23424#true} is VALID [2018-11-23 11:37:35,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {23424#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23424#true} is VALID [2018-11-23 11:37:35,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {23424#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23447#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:35,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {23447#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {23451#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:35,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {23451#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23451#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:35,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {23451#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {23458#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:37:35,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {23458#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {23462#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:35,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {23462#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23466#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:35,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {23466#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:35,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:35,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:35,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:35,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:35,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {23470#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23486#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:35,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {23486#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23486#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:35,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {23486#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23486#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:35,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {23486#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {23486#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:35,450 INFO L273 TraceCheckUtils]: 21: Hoare triple {23486#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {23499#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:35,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {23499#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {23425#false} is VALID [2018-11-23 11:37:35,451 INFO L273 TraceCheckUtils]: 23: Hoare triple {23425#false} assume !false; {23425#false} is VALID [2018-11-23 11:37:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:35,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:35,927 INFO L273 TraceCheckUtils]: 23: Hoare triple {23425#false} assume !false; {23425#false} is VALID [2018-11-23 11:37:35,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {23509#(not (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {23425#false} is VALID [2018-11-23 11:37:35,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {23513#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {23509#(not (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)))} is VALID [2018-11-23 11:37:35,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {23513#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {23513#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:35,963 INFO L273 TraceCheckUtils]: 19: Hoare triple {23513#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23513#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:35,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {23513#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23513#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:35,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23513#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:36,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:36,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:36,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:36,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:36,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {23542#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {23526#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:36,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {23546#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23542#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:36,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {23550#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {23546#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:36,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {23554#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {23550#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))} is VALID [2018-11-23 11:37:36,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {23554#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23554#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:36,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {23424#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {23554#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:36,102 INFO L273 TraceCheckUtils]: 6: Hoare triple {23424#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23424#true} is VALID [2018-11-23 11:37:36,102 INFO L273 TraceCheckUtils]: 5: Hoare triple {23424#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23424#true} is VALID [2018-11-23 11:37:36,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {23424#true} call #t~ret7 := main(); {23424#true} is VALID [2018-11-23 11:37:36,103 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23424#true} {23424#true} #181#return; {23424#true} is VALID [2018-11-23 11:37:36,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {23424#true} assume true; {23424#true} is VALID [2018-11-23 11:37:36,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {23424#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {23424#true} is VALID [2018-11-23 11:37:36,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {23424#true} call ULTIMATE.init(); {23424#true} is VALID [2018-11-23 11:37:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:36,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:36,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-23 11:37:36,106 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-23 11:37:36,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:36,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:37:36,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:36,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:37:36,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:37:36,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:37:36,230 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand 17 states. [2018-11-23 11:37:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:41,871 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2018-11-23 11:37:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:37:41,872 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-23 11:37:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2018-11-23 11:37:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2018-11-23 11:37:41,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 147 transitions. [2018-11-23 11:37:42,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:42,169 INFO L225 Difference]: With dead ends: 154 [2018-11-23 11:37:42,169 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 11:37:42,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:37:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 11:37:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-11-23 11:37:42,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:42,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 113 states. [2018-11-23 11:37:42,436 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 113 states. [2018-11-23 11:37:42,436 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 113 states. [2018-11-23 11:37:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:42,439 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2018-11-23 11:37:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2018-11-23 11:37:42,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:42,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:42,440 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 152 states. [2018-11-23 11:37:42,440 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 152 states. [2018-11-23 11:37:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:42,443 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2018-11-23 11:37:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2018-11-23 11:37:42,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:42,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:42,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:42,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 11:37:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2018-11-23 11:37:42,446 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 24 [2018-11-23 11:37:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:42,446 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2018-11-23 11:37:42,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:37:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2018-11-23 11:37:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:42,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:42,447 INFO L402 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-23 11:37:42,447 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:42,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1908113489, now seen corresponding path program 1 times [2018-11-23 11:37:42,448 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:42,448 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 36 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 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:42,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:42,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:43,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {24217#true} call ULTIMATE.init(); {24217#true} is VALID [2018-11-23 11:37:43,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {24217#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {24217#true} is VALID [2018-11-23 11:37:43,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {24217#true} assume true; {24217#true} is VALID [2018-11-23 11:37:43,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24217#true} {24217#true} #181#return; {24217#true} is VALID [2018-11-23 11:37:43,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {24217#true} call #t~ret7 := main(); {24217#true} is VALID [2018-11-23 11:37:43,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {24217#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24217#true} is VALID [2018-11-23 11:37:43,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {24217#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24240#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:43,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {24240#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {24244#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:43,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {24244#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {24244#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:43,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {24244#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {24251#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:37:43,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {24251#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {24255#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:43,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {24255#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24259#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:43,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {24259#(and (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:43,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:43,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:43,071 INFO L273 TraceCheckUtils]: 15: Hoare triple {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:43,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:37:43,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {24263#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24279#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:43,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {24279#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {24279#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:43,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {24279#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {24279#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:43,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {24279#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {24279#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:43,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {24279#(and (not (= (_ bv1 32) main_~main__tagbuf_len~0)) (not (= (_ bv0 32) main_~main__tagbuf_len~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {24292#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:43,077 INFO L273 TraceCheckUtils]: 22: Hoare triple {24292#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {24218#false} is VALID [2018-11-23 11:37:43,077 INFO L273 TraceCheckUtils]: 23: Hoare triple {24218#false} assume !false; {24218#false} is VALID [2018-11-23 11:37:43,079 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-23 11:37:43,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:43,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {24218#false} assume !false; {24218#false} is VALID [2018-11-23 11:37:43,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {24302#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {24218#false} is VALID [2018-11-23 11:37:43,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {24306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {24302#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} is VALID [2018-11-23 11:37:43,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {24306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {24306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:43,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {24306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {24306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:43,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {24306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {24306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:43,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:43,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:43,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:43,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:43,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:43,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {24335#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {24319#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:43,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {24339#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24335#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:43,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {24343#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {24339#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:43,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {24347#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {24343#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))} is VALID [2018-11-23 11:37:43,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {24347#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {24347#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:43,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {24217#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {24347#(or (= (bvadd main_~main__tagbuf_len~0 (_ bv4294967295 32)) main_~main__t~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (bvadd main_~main__t~0 (_ bv2 32)) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:37:43,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {24217#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24217#true} is VALID [2018-11-23 11:37:43,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {24217#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24217#true} is VALID [2018-11-23 11:37:43,612 INFO L256 TraceCheckUtils]: 4: Hoare triple {24217#true} call #t~ret7 := main(); {24217#true} is VALID [2018-11-23 11:37:43,612 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24217#true} {24217#true} #181#return; {24217#true} is VALID [2018-11-23 11:37:43,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {24217#true} assume true; {24217#true} is VALID [2018-11-23 11:37:43,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {24217#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {24217#true} is VALID [2018-11-23 11:37:43,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {24217#true} call ULTIMATE.init(); {24217#true} is VALID [2018-11-23 11:37:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:43,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:43,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-23 11:37:43,615 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-23 11:37:43,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:43,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:37:43,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:43,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:37:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:37:43,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:37:43,715 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand 17 states. [2018-11-23 11:37:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:47,513 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-11-23 11:37:47,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:37:47,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-23 11:37:47,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2018-11-23 11:37:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2018-11-23 11:37:47,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2018-11-23 11:37:47,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:47,731 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:37:47,732 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 11:37:47,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:37:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 11:37:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-11-23 11:37:47,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:47,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 106 states. [2018-11-23 11:37:47,804 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 106 states. [2018-11-23 11:37:47,805 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 106 states. [2018-11-23 11:37:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:47,806 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2018-11-23 11:37:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-11-23 11:37:47,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:47,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:47,806 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 113 states. [2018-11-23 11:37:47,807 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 113 states. [2018-11-23 11:37:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:47,808 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2018-11-23 11:37:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-11-23 11:37:47,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:47,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:47,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:47,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 11:37:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2018-11-23 11:37:47,810 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 24 [2018-11-23 11:37:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:47,810 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2018-11-23 11:37:47,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:37:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-11-23 11:37:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:47,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:47,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:47,811 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:47,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash 992031259, now seen corresponding path program 1 times [2018-11-23 11:37:47,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:47,812 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 37 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 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:47,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:47,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:47,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {24879#true} call ULTIMATE.init(); {24879#true} is VALID [2018-11-23 11:37:47,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {24879#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {24879#true} is VALID [2018-11-23 11:37:47,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {24879#true} assume true; {24879#true} is VALID [2018-11-23 11:37:47,998 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24879#true} {24879#true} #181#return; {24879#true} is VALID [2018-11-23 11:37:47,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {24879#true} call #t~ret7 := main(); {24879#true} is VALID [2018-11-23 11:37:47,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {24879#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24879#true} is VALID [2018-11-23 11:37:48,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {24879#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24902#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {24902#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {24902#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {24902#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {24902#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {24902#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {24902#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {24902#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {24902#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {24902#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24918#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {24918#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {24918#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {24918#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {24918#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {24918#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {24918#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,008 INFO L273 TraceCheckUtils]: 15: Hoare triple {24918#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {24918#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {24918#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24934#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {24934#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {24934#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {24934#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {24934#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {24934#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {24934#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {24934#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24947#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,019 INFO L273 TraceCheckUtils]: 21: Hoare triple {24947#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {24951#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:48,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {24951#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {24880#false} is VALID [2018-11-23 11:37:48,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {24880#false} assume !false; {24880#false} is VALID [2018-11-23 11:37:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:48,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:48,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {24880#false} assume !false; {24880#false} is VALID [2018-11-23 11:37:48,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {24961#(not (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {24880#false} is VALID [2018-11-23 11:37:48,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {24965#(bvsle (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {24961#(not (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} is VALID [2018-11-23 11:37:48,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {24969#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24965#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {24969#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {24969#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:48,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {24969#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {24969#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:48,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {24969#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {24969#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:48,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24969#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:48,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24982#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {24879#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24998#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {24879#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24879#true} is VALID [2018-11-23 11:37:48,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {24879#true} call #t~ret7 := main(); {24879#true} is VALID [2018-11-23 11:37:48,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24879#true} {24879#true} #181#return; {24879#true} is VALID [2018-11-23 11:37:48,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {24879#true} assume true; {24879#true} is VALID [2018-11-23 11:37:48,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {24879#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {24879#true} is VALID [2018-11-23 11:37:48,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {24879#true} call ULTIMATE.init(); {24879#true} is VALID [2018-11-23 11:37:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:48,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:48,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:37:48,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-23 11:37:48,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:48,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:37:48,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:48,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:37:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:37:48,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:48,341 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 12 states. [2018-11-23 11:37:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:50,703 INFO L93 Difference]: Finished difference Result 297 states and 326 transitions. [2018-11-23 11:37:50,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:37:50,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-23 11:37:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:37:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 326 transitions. [2018-11-23 11:37:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:37:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 326 transitions. [2018-11-23 11:37:50,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 326 transitions. [2018-11-23 11:37:51,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:51,150 INFO L225 Difference]: With dead ends: 297 [2018-11-23 11:37:51,151 INFO L226 Difference]: Without dead ends: 295 [2018-11-23 11:37:51,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:37:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-23 11:37:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 165. [2018-11-23 11:37:51,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:51,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand 165 states. [2018-11-23 11:37:51,332 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand 165 states. [2018-11-23 11:37:51,332 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 165 states. [2018-11-23 11:37:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:51,338 INFO L93 Difference]: Finished difference Result 295 states and 320 transitions. [2018-11-23 11:37:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 320 transitions. [2018-11-23 11:37:51,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:51,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:51,339 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 295 states. [2018-11-23 11:37:51,339 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 295 states. [2018-11-23 11:37:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:51,345 INFO L93 Difference]: Finished difference Result 295 states and 320 transitions. [2018-11-23 11:37:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 320 transitions. [2018-11-23 11:37:51,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:51,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:51,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:51,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 11:37:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 213 transitions. [2018-11-23 11:37:51,349 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 213 transitions. Word has length 24 [2018-11-23 11:37:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:51,349 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 213 transitions. [2018-11-23 11:37:51,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:37:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 213 transitions. [2018-11-23 11:37:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:51,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:51,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:51,351 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:51,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:51,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1522117029, now seen corresponding path program 1 times [2018-11-23 11:37:51,351 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:51,351 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 38 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 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:51,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:51,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:51,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {26174#true} call ULTIMATE.init(); {26174#true} is VALID [2018-11-23 11:37:51,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {26174#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {26174#true} is VALID [2018-11-23 11:37:51,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {26174#true} assume true; {26174#true} is VALID [2018-11-23 11:37:51,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26174#true} {26174#true} #181#return; {26174#true} is VALID [2018-11-23 11:37:51,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {26174#true} call #t~ret7 := main(); {26174#true} is VALID [2018-11-23 11:37:51,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {26174#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {26174#true} is VALID [2018-11-23 11:37:51,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {26174#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {26197#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {26197#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {26197#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,507 INFO L273 TraceCheckUtils]: 8: Hoare triple {26197#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {26197#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {26197#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {26197#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {26197#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {26197#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {26197#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26213#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {26213#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {26213#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {26213#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {26213#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {26213#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {26213#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {26213#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {26213#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {26213#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26229#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,511 INFO L273 TraceCheckUtils]: 17: Hoare triple {26229#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {26229#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,512 INFO L273 TraceCheckUtils]: 18: Hoare triple {26229#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {26229#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {26229#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {26229#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {26229#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {26229#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {26229#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26245#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {26245#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {26249#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:51,516 INFO L273 TraceCheckUtils]: 23: Hoare triple {26249#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {26175#false} is VALID [2018-11-23 11:37:51,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {26175#false} assume !false; {26175#false} is VALID [2018-11-23 11:37:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:51,518 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:51,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:51,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:51,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:51,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:51,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:51,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:51,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:51,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:51,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:51,551 INFO L87 Difference]: Start difference. First operand 165 states and 213 transitions. Second operand 7 states. [2018-11-23 11:37:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:52,847 INFO L93 Difference]: Finished difference Result 184 states and 226 transitions. [2018-11-23 11:37:52,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:52,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2018-11-23 11:37:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2018-11-23 11:37:52,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 146 transitions. [2018-11-23 11:37:53,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:53,023 INFO L225 Difference]: With dead ends: 184 [2018-11-23 11:37:53,024 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 11:37:53,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 11:37:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 166. [2018-11-23 11:37:53,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:53,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 166 states. [2018-11-23 11:37:53,416 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 166 states. [2018-11-23 11:37:53,417 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 166 states. [2018-11-23 11:37:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:53,421 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2018-11-23 11:37:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-11-23 11:37:53,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:53,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:53,421 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 182 states. [2018-11-23 11:37:53,421 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 182 states. [2018-11-23 11:37:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:53,424 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2018-11-23 11:37:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-11-23 11:37:53,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:53,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:53,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:53,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 11:37:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2018-11-23 11:37:53,426 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 25 [2018-11-23 11:37:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:53,427 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2018-11-23 11:37:53,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2018-11-23 11:37:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:53,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:53,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:53,427 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:53,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:53,428 INFO L82 PathProgramCache]: Analyzing trace with hash 688201036, now seen corresponding path program 1 times [2018-11-23 11:37:53,428 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:53,428 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 39 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 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:53,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:53,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:53,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {27039#true} call ULTIMATE.init(); {27039#true} is VALID [2018-11-23 11:37:53,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {27039#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {27039#true} is VALID [2018-11-23 11:37:53,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {27039#true} assume true; {27039#true} is VALID [2018-11-23 11:37:53,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27039#true} {27039#true} #181#return; {27039#true} is VALID [2018-11-23 11:37:53,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {27039#true} call #t~ret7 := main(); {27039#true} is VALID [2018-11-23 11:37:53,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {27039#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {27039#true} is VALID [2018-11-23 11:37:53,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {27039#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {27062#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {27062#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {27062#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {27062#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {27062#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {27062#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {27062#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {27062#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {27062#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {27062#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27078#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {27078#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {27078#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {27078#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {27078#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {27078#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {27078#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {27078#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {27078#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {27078#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27094#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {27094#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {27094#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {27094#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {27094#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {27094#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {27094#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {27094#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27107#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {27107#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {27111#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:53,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {27111#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {27115#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:53,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {27115#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~3; {27040#false} is VALID [2018-11-23 11:37:53,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {27040#false} assume !false; {27040#false} is VALID [2018-11-23 11:37:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:53,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:53,648 INFO L273 TraceCheckUtils]: 24: Hoare triple {27040#false} assume !false; {27040#false} is VALID [2018-11-23 11:37:53,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {27125#(not (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~3; {27040#false} is VALID [2018-11-23 11:37:53,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {27129#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {27125#(not (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} is VALID [2018-11-23 11:37:53,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {27039#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {27129#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:53,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {27039#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27039#true} is VALID [2018-11-23 11:37:53,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {27039#true} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {27039#true} is VALID [2018-11-23 11:37:53,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {27039#true} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {27039#true} is VALID [2018-11-23 11:37:53,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {27039#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {27039#true} is VALID [2018-11-23 11:37:53,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {27039#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27039#true} is VALID [2018-11-23 11:37:53,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {27039#true} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {27039#true} is VALID [2018-11-23 11:37:53,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {27039#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {27039#true} is VALID [2018-11-23 11:37:53,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {27039#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {27039#true} is VALID [2018-11-23 11:37:53,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {27039#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {27039#true} is VALID [2018-11-23 11:37:53,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {27039#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27039#true} is VALID [2018-11-23 11:37:53,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {27039#true} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {27039#true} is VALID [2018-11-23 11:37:53,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {27039#true} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {27039#true} is VALID [2018-11-23 11:37:53,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {27039#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {27039#true} is VALID [2018-11-23 11:37:53,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {27039#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {27039#true} is VALID [2018-11-23 11:37:53,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {27039#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {27039#true} is VALID [2018-11-23 11:37:53,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {27039#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {27039#true} is VALID [2018-11-23 11:37:53,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {27039#true} call #t~ret7 := main(); {27039#true} is VALID [2018-11-23 11:37:53,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27039#true} {27039#true} #181#return; {27039#true} is VALID [2018-11-23 11:37:53,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {27039#true} assume true; {27039#true} is VALID [2018-11-23 11:37:53,654 INFO L273 TraceCheckUtils]: 1: Hoare triple {27039#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {27039#true} is VALID [2018-11-23 11:37:53,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {27039#true} call ULTIMATE.init(); {27039#true} is VALID [2018-11-23 11:37:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:37:53,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:37:53,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-23 11:37:53,658 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 11:37:53,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:53,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:53,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:53,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:53,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:53,730 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand 10 states. [2018-11-23 11:37:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:55,344 INFO L93 Difference]: Finished difference Result 180 states and 223 transitions. [2018-11-23 11:37:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:55,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 11:37:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2018-11-23 11:37:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2018-11-23 11:37:55,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 143 transitions. [2018-11-23 11:37:55,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:55,512 INFO L225 Difference]: With dead ends: 180 [2018-11-23 11:37:55,512 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 11:37:55,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:37:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 11:37:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 162. [2018-11-23 11:37:55,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:55,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 162 states. [2018-11-23 11:37:55,674 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 162 states. [2018-11-23 11:37:55,674 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 162 states. [2018-11-23 11:37:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:55,677 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-11-23 11:37:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 212 transitions. [2018-11-23 11:37:55,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:55,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:55,678 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 174 states. [2018-11-23 11:37:55,678 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 174 states. [2018-11-23 11:37:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:55,680 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-11-23 11:37:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 212 transitions. [2018-11-23 11:37:55,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:55,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:55,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:55,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:37:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2018-11-23 11:37:55,683 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 25 [2018-11-23 11:37:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:55,683 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2018-11-23 11:37:55,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2018-11-23 11:37:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:37:55,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:55,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:55,684 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:55,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash -58582238, now seen corresponding path program 1 times [2018-11-23 11:37:55,684 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:55,684 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 40 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 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:55,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:55,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:55,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {27963#true} call ULTIMATE.init(); {27963#true} is VALID [2018-11-23 11:37:55,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {27963#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {27963#true} is VALID [2018-11-23 11:37:55,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {27963#true} assume true; {27963#true} is VALID [2018-11-23 11:37:55,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27963#true} {27963#true} #181#return; {27963#true} is VALID [2018-11-23 11:37:55,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {27963#true} call #t~ret7 := main(); {27963#true} is VALID [2018-11-23 11:37:55,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {27963#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {27963#true} is VALID [2018-11-23 11:37:55,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {27963#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {27986#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {27986#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {27986#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {27986#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {27986#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {27986#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {27986#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {27986#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {27986#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {27986#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28002#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {28002#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {28002#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {28002#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {28002#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {28002#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {28002#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {28002#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {28002#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {28002#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28018#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {28018#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {28018#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {28018#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {28018#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {28018#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {28018#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {28018#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {28018#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,844 INFO L273 TraceCheckUtils]: 21: Hoare triple {28018#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28034#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {28034#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {28034#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:55,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {28034#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {28041#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:55,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {28041#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {27964#false} is VALID [2018-11-23 11:37:55,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {27964#false} assume !false; {27964#false} is VALID [2018-11-23 11:37:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:55,846 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:55,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:55,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:55,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 11:37:55,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:55,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:55,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:55,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:55,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:55,881 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand 7 states. [2018-11-23 11:37:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:57,349 INFO L93 Difference]: Finished difference Result 219 states and 264 transitions. [2018-11-23 11:37:57,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:57,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 11:37:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2018-11-23 11:37:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2018-11-23 11:37:57,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 186 transitions. [2018-11-23 11:37:57,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:57,573 INFO L225 Difference]: With dead ends: 219 [2018-11-23 11:37:57,573 INFO L226 Difference]: Without dead ends: 217 [2018-11-23 11:37:57,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-23 11:37:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 162. [2018-11-23 11:37:57,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:57,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 162 states. [2018-11-23 11:37:57,855 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 162 states. [2018-11-23 11:37:57,855 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 162 states. [2018-11-23 11:37:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:57,859 INFO L93 Difference]: Finished difference Result 217 states and 262 transitions. [2018-11-23 11:37:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2018-11-23 11:37:57,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:57,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:57,860 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 217 states. [2018-11-23 11:37:57,860 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 217 states. [2018-11-23 11:37:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:57,863 INFO L93 Difference]: Finished difference Result 217 states and 262 transitions. [2018-11-23 11:37:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2018-11-23 11:37:57,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:57,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:57,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:57,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:37:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2018-11-23 11:37:57,866 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 26 [2018-11-23 11:37:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:57,866 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2018-11-23 11:37:57,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2018-11-23 11:37:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:37:57,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:57,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:57,867 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:57,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash -59009242, now seen corresponding path program 1 times [2018-11-23 11:37:57,868 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:57,868 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 41 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 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:57,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:57,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:58,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {28943#true} call ULTIMATE.init(); {28943#true} is VALID [2018-11-23 11:37:58,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {28943#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {28943#true} is VALID [2018-11-23 11:37:58,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {28943#true} assume true; {28943#true} is VALID [2018-11-23 11:37:58,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28943#true} {28943#true} #181#return; {28943#true} is VALID [2018-11-23 11:37:58,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {28943#true} call #t~ret7 := main(); {28943#true} is VALID [2018-11-23 11:37:58,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {28943#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {28943#true} is VALID [2018-11-23 11:37:58,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {28943#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {28966#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {28966#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {28966#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {28966#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {28966#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {28966#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {28966#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {28966#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {28966#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {28966#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28982#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {28982#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {28982#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {28982#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {28982#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {28982#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {28982#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {28982#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {28982#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {28982#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28998#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {28998#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {28998#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {28998#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {28998#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,049 INFO L273 TraceCheckUtils]: 19: Hoare triple {28998#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {28998#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {28998#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {28998#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {28998#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29014#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {29014#(= (_ bv3 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {29018#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:58,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {29018#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {29022#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:58,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {29022#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {28944#false} is VALID [2018-11-23 11:37:58,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {28944#false} assume !false; {28944#false} is VALID [2018-11-23 11:37:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:58,055 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:58,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:58,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:37:58,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 11:37:58,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:58,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:37:58,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:58,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:37:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:37:58,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:58,091 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand 8 states. [2018-11-23 11:37:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:59,566 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2018-11-23 11:37:59,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:59,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 11:37:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2018-11-23 11:37:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2018-11-23 11:37:59,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 135 transitions. [2018-11-23 11:37:59,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:59,723 INFO L225 Difference]: With dead ends: 172 [2018-11-23 11:37:59,723 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 11:37:59,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 11:37:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2018-11-23 11:37:59,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:59,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 161 states. [2018-11-23 11:37:59,899 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 161 states. [2018-11-23 11:37:59,899 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 161 states. [2018-11-23 11:37:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:59,903 INFO L93 Difference]: Finished difference Result 168 states and 206 transitions. [2018-11-23 11:37:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2018-11-23 11:37:59,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:59,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:59,904 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 168 states. [2018-11-23 11:37:59,904 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 168 states. [2018-11-23 11:37:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:59,906 INFO L93 Difference]: Finished difference Result 168 states and 206 transitions. [2018-11-23 11:37:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2018-11-23 11:37:59,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:59,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:59,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:59,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-23 11:37:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 202 transitions. [2018-11-23 11:37:59,908 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 202 transitions. Word has length 26 [2018-11-23 11:37:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:59,909 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 202 transitions. [2018-11-23 11:37:59,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:37:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 202 transitions. [2018-11-23 11:37:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:37:59,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:59,909 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:59,909 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:59,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash -126382035, now seen corresponding path program 1 times [2018-11-23 11:37:59,910 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:59,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 42 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 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:59,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:59,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:00,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {29767#true} call ULTIMATE.init(); {29767#true} is VALID [2018-11-23 11:38:00,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {29767#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {29767#true} is VALID [2018-11-23 11:38:00,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {29767#true} assume true; {29767#true} is VALID [2018-11-23 11:38:00,057 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29767#true} {29767#true} #181#return; {29767#true} is VALID [2018-11-23 11:38:00,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {29767#true} call #t~ret7 := main(); {29767#true} is VALID [2018-11-23 11:38:00,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {29767#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {29767#true} is VALID [2018-11-23 11:38:00,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {29767#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {29790#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {29790#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {29790#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {29790#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {29790#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {29790#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {29790#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {29790#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {29790#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {29790#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29806#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {29806#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {29806#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {29806#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {29806#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {29806#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {29806#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {29806#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {29806#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {29806#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29822#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {29822#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {29822#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {29822#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {29822#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,065 INFO L273 TraceCheckUtils]: 19: Hoare triple {29822#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {29822#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {29822#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29835#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {29835#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {29835#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {29835#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {29835#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {29835#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {29845#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:00,068 INFO L273 TraceCheckUtils]: 24: Hoare triple {29845#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {29768#false} is VALID [2018-11-23 11:38:00,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {29768#false} assume !false; {29768#false} is VALID [2018-11-23 11:38:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:00,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:00,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {29768#false} assume !false; {29768#false} is VALID [2018-11-23 11:38:00,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {29855#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {29768#false} is VALID [2018-11-23 11:38:00,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {29859#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {29855#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} is VALID [2018-11-23 11:38:00,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {29859#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {29859#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {29859#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {29859#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {29869#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29859#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {29869#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {29869#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:00,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {29869#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {29869#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:00,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {29869#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {29869#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:00,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29869#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:00,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29882#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {29767#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {29898#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {29767#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {29767#true} is VALID [2018-11-23 11:38:00,185 INFO L256 TraceCheckUtils]: 4: Hoare triple {29767#true} call #t~ret7 := main(); {29767#true} is VALID [2018-11-23 11:38:00,185 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29767#true} {29767#true} #181#return; {29767#true} is VALID [2018-11-23 11:38:00,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {29767#true} assume true; {29767#true} is VALID [2018-11-23 11:38:00,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {29767#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {29767#true} is VALID [2018-11-23 11:38:00,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {29767#true} call ULTIMATE.init(); {29767#true} is VALID [2018-11-23 11:38:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:00,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:00,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:38:00,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:38:00,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:00,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:38:00,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:00,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:38:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:38:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:00,271 INFO L87 Difference]: Start difference. First operand 161 states and 202 transitions. Second operand 12 states. [2018-11-23 11:38:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:03,082 INFO L93 Difference]: Finished difference Result 368 states and 411 transitions. [2018-11-23 11:38:03,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:38:03,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:38:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 411 transitions. [2018-11-23 11:38:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 411 transitions. [2018-11-23 11:38:03,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 411 transitions. [2018-11-23 11:38:03,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:03,765 INFO L225 Difference]: With dead ends: 368 [2018-11-23 11:38:03,765 INFO L226 Difference]: Without dead ends: 366 [2018-11-23 11:38:03,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=308, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:38:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-23 11:38:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 164. [2018-11-23 11:38:03,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:03,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand 164 states. [2018-11-23 11:38:03,943 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand 164 states. [2018-11-23 11:38:03,943 INFO L87 Difference]: Start difference. First operand 366 states. Second operand 164 states. [2018-11-23 11:38:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:03,951 INFO L93 Difference]: Finished difference Result 366 states and 405 transitions. [2018-11-23 11:38:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 405 transitions. [2018-11-23 11:38:03,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:03,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:03,952 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 366 states. [2018-11-23 11:38:03,952 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 366 states. [2018-11-23 11:38:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:03,959 INFO L93 Difference]: Finished difference Result 366 states and 405 transitions. [2018-11-23 11:38:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 405 transitions. [2018-11-23 11:38:03,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:03,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:03,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:03,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 11:38:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2018-11-23 11:38:03,961 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 26 [2018-11-23 11:38:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:03,962 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2018-11-23 11:38:03,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2018-11-23 11:38:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:38:03,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:03,962 INFO L402 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, 1, 1] [2018-11-23 11:38:03,963 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:03,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:03,963 INFO L82 PathProgramCache]: Analyzing trace with hash -124842835, now seen corresponding path program 1 times [2018-11-23 11:38:03,963 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:03,963 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 43 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 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:03,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:04,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:04,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {31305#true} call ULTIMATE.init(); {31305#true} is VALID [2018-11-23 11:38:04,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {31305#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {31305#true} is VALID [2018-11-23 11:38:04,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {31305#true} assume true; {31305#true} is VALID [2018-11-23 11:38:04,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31305#true} {31305#true} #181#return; {31305#true} is VALID [2018-11-23 11:38:04,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {31305#true} call #t~ret7 := main(); {31305#true} is VALID [2018-11-23 11:38:04,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {31305#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {31305#true} is VALID [2018-11-23 11:38:04,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {31305#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {31328#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {31328#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {31328#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {31328#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {31328#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {31328#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {31328#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {31328#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {31328#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {31328#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31344#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {31344#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {31344#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {31344#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {31344#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {31344#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {31344#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {31344#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {31344#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {31344#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31360#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {31360#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {31360#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,165 INFO L273 TraceCheckUtils]: 18: Hoare triple {31360#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {31360#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,166 INFO L273 TraceCheckUtils]: 19: Hoare triple {31360#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {31360#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {31360#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31373#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {31373#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {31373#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {31373#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {31373#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {31373#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {31383#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:04,169 INFO L273 TraceCheckUtils]: 24: Hoare triple {31383#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {31306#false} is VALID [2018-11-23 11:38:04,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {31306#false} assume !false; {31306#false} is VALID [2018-11-23 11:38:04,170 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-23 11:38:04,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:04,267 INFO L273 TraceCheckUtils]: 25: Hoare triple {31306#false} assume !false; {31306#false} is VALID [2018-11-23 11:38:04,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {31393#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {31306#false} is VALID [2018-11-23 11:38:04,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {31397#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {31393#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} is VALID [2018-11-23 11:38:04,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {31397#(bvsle (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {31397#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {31397#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {31397#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {31407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31397#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {31407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {31407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:04,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {31407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {31407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:04,273 INFO L273 TraceCheckUtils]: 17: Hoare triple {31407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {31407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:04,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:04,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31420#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {31305#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {31436#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {31305#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {31305#true} is VALID [2018-11-23 11:38:04,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {31305#true} call #t~ret7 := main(); {31305#true} is VALID [2018-11-23 11:38:04,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31305#true} {31305#true} #181#return; {31305#true} is VALID [2018-11-23 11:38:04,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {31305#true} assume true; {31305#true} is VALID [2018-11-23 11:38:04,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {31305#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {31305#true} is VALID [2018-11-23 11:38:04,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {31305#true} call ULTIMATE.init(); {31305#true} is VALID [2018-11-23 11:38:04,285 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-23 11:38:04,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:04,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:38:04,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:38:04,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:04,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:38:04,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:04,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:38:04,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:38:04,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:04,347 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand 12 states. [2018-11-23 11:38:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:06,661 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2018-11-23 11:38:06,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:38:06,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:38:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 275 transitions. [2018-11-23 11:38:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 275 transitions. [2018-11-23 11:38:06,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 275 transitions. [2018-11-23 11:38:07,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:07,062 INFO L225 Difference]: With dead ends: 246 [2018-11-23 11:38:07,062 INFO L226 Difference]: Without dead ends: 239 [2018-11-23 11:38:07,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:38:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-23 11:38:07,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 165. [2018-11-23 11:38:07,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:07,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 165 states. [2018-11-23 11:38:07,228 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 165 states. [2018-11-23 11:38:07,228 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 165 states. [2018-11-23 11:38:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:07,233 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2018-11-23 11:38:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 264 transitions. [2018-11-23 11:38:07,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:07,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:07,233 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 239 states. [2018-11-23 11:38:07,233 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 239 states. [2018-11-23 11:38:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:07,237 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2018-11-23 11:38:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 264 transitions. [2018-11-23 11:38:07,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:07,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:07,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:07,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 11:38:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2018-11-23 11:38:07,240 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 26 [2018-11-23 11:38:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:07,240 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2018-11-23 11:38:07,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2018-11-23 11:38:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:38:07,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:07,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:07,241 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:07,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1816046247, now seen corresponding path program 1 times [2018-11-23 11:38:07,241 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:07,241 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 44 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 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:07,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:07,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:07,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {32449#true} call ULTIMATE.init(); {32449#true} is VALID [2018-11-23 11:38:07,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {32449#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {32449#true} is VALID [2018-11-23 11:38:07,599 INFO L273 TraceCheckUtils]: 2: Hoare triple {32449#true} assume true; {32449#true} is VALID [2018-11-23 11:38:07,599 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32449#true} {32449#true} #181#return; {32449#true} is VALID [2018-11-23 11:38:07,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {32449#true} call #t~ret7 := main(); {32449#true} is VALID [2018-11-23 11:38:07,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {32449#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {32449#true} is VALID [2018-11-23 11:38:07,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {32449#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {32472#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:07,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {32472#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {32472#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:07,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {32472#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {32472#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:07,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {32472#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {32482#(and (= (_ bv0 32) main_~main__t~0) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} is VALID [2018-11-23 11:38:07,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {32482#(and (= (_ bv0 32) main_~main__t~0) (or (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~13 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {32486#(and (= (_ bv0 32) main_~main__t~0) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:07,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {32486#(and (= (_ bv0 32) main_~main__t~0) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {32490#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32506#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:07,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {32506#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {32510#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:07,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {32510#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {32510#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:07,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {32510#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {32510#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:07,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {32510#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {32520#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (and (= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:07,614 INFO L273 TraceCheckUtils]: 21: Hoare triple {32520#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (or (and (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (and (= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32524#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:07,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {32524#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {32528#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:07,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {32528#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {32528#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:07,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {32528#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {32535#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:07,618 INFO L273 TraceCheckUtils]: 25: Hoare triple {32535#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {32450#false} is VALID [2018-11-23 11:38:07,619 INFO L273 TraceCheckUtils]: 26: Hoare triple {32450#false} assume !false; {32450#false} is VALID [2018-11-23 11:38:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:07,620 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:07,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:07,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 11:38:07,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 11:38:07,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:07,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:38:07,660 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-23 11:38:07,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:38:07,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:38:07,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:07,661 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand 12 states. [2018-11-23 11:38:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:10,303 INFO L93 Difference]: Finished difference Result 189 states and 228 transitions. [2018-11-23 11:38:10,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:38:10,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 11:38:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2018-11-23 11:38:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2018-11-23 11:38:10,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 128 transitions. [2018-11-23 11:38:10,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:10,471 INFO L225 Difference]: With dead ends: 189 [2018-11-23 11:38:10,472 INFO L226 Difference]: Without dead ends: 187 [2018-11-23 11:38:10,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-23 11:38:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 168. [2018-11-23 11:38:10,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:10,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 168 states. [2018-11-23 11:38:10,688 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 168 states. [2018-11-23 11:38:10,688 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 168 states. [2018-11-23 11:38:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:10,692 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2018-11-23 11:38:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2018-11-23 11:38:10,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:10,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:10,692 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 187 states. [2018-11-23 11:38:10,692 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 187 states. [2018-11-23 11:38:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:10,695 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2018-11-23 11:38:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2018-11-23 11:38:10,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:10,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:10,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:10,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 11:38:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2018-11-23 11:38:10,698 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 27 [2018-11-23 11:38:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:10,698 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2018-11-23 11:38:10,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2018-11-23 11:38:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:38:10,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:10,699 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:10,699 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:10,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1151624096, now seen corresponding path program 1 times [2018-11-23 11:38:10,699 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:10,699 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 45 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 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:10,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:10,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:11,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {33349#true} call ULTIMATE.init(); {33349#true} is VALID [2018-11-23 11:38:11,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {33349#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {33349#true} is VALID [2018-11-23 11:38:11,077 INFO L273 TraceCheckUtils]: 2: Hoare triple {33349#true} assume true; {33349#true} is VALID [2018-11-23 11:38:11,077 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33349#true} {33349#true} #181#return; {33349#true} is VALID [2018-11-23 11:38:11,077 INFO L256 TraceCheckUtils]: 4: Hoare triple {33349#true} call #t~ret7 := main(); {33349#true} is VALID [2018-11-23 11:38:11,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {33349#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {33349#true} is VALID [2018-11-23 11:38:11,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {33349#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {33372#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:11,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {33372#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {33372#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:11,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {33372#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {33372#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:11,080 INFO L273 TraceCheckUtils]: 9: Hoare triple {33372#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {33382#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:38:11,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {33382#(and (= (_ bv0 32) main_~main__t~0) (or (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32))) (and (bvsle main_~main__t~0 main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {33386#(and (= (_ bv0 32) main_~main__t~0) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:11,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {33386#(and (= (_ bv0 32) main_~main__t~0) (bvsle main_~main__t~0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,085 INFO L273 TraceCheckUtils]: 12: Hoare triple {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,086 INFO L273 TraceCheckUtils]: 14: Hoare triple {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,087 INFO L273 TraceCheckUtils]: 15: Hoare triple {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {33390#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33406#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:11,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {33406#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0); {33410#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:11,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {33410#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {33410#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:11,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {33410#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {33417#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))))} is VALID [2018-11-23 11:38:11,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {33417#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (or (and (= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (and (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33421#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:11,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {33421#(and (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {33425#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:11,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {33425#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {33425#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:11,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {33425#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {33425#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:11,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {33425#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {33425#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:11,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {33425#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (= (_ bv3 32) main_~main__t~0) (bvsle (_ bv2 32) main_~main__tagbuf_len~0) (not (= (_ bv2 32) main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {33438#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:11,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {33438#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {33350#false} is VALID [2018-11-23 11:38:11,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {33350#false} assume !false; {33350#false} is VALID [2018-11-23 11:38:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:11,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:11,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {33350#false} assume !false; {33350#false} is VALID [2018-11-23 11:38:11,322 INFO L273 TraceCheckUtils]: 26: Hoare triple {33448#(not (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {33350#false} is VALID [2018-11-23 11:38:11,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {33448#(not (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} is VALID [2018-11-23 11:38:11,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,324 INFO L273 TraceCheckUtils]: 23: Hoare triple {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,324 INFO L273 TraceCheckUtils]: 22: Hoare triple {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,325 INFO L273 TraceCheckUtils]: 21: Hoare triple {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {33468#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33452#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {33472#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {33468#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} is VALID [2018-11-23 11:38:11,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {33472#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {33472#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:11,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {33349#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {33472#(or (bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2018-11-23 11:38:11,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {33349#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33349#true} is VALID [2018-11-23 11:38:11,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {33349#true} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {33349#true} is VALID [2018-11-23 11:38:11,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {33349#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {33349#true} is VALID [2018-11-23 11:38:11,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {33349#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {33349#true} is VALID [2018-11-23 11:38:11,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {33349#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {33349#true} is VALID [2018-11-23 11:38:11,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {33349#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33349#true} is VALID [2018-11-23 11:38:11,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {33349#true} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {33349#true} is VALID [2018-11-23 11:38:11,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {33349#true} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {33349#true} is VALID [2018-11-23 11:38:11,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {33349#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {33349#true} is VALID [2018-11-23 11:38:11,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {33349#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {33349#true} is VALID [2018-11-23 11:38:11,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {33349#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {33349#true} is VALID [2018-11-23 11:38:11,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {33349#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {33349#true} is VALID [2018-11-23 11:38:11,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {33349#true} call #t~ret7 := main(); {33349#true} is VALID [2018-11-23 11:38:11,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33349#true} {33349#true} #181#return; {33349#true} is VALID [2018-11-23 11:38:11,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {33349#true} assume true; {33349#true} is VALID [2018-11-23 11:38:11,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {33349#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {33349#true} is VALID [2018-11-23 11:38:11,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {33349#true} call ULTIMATE.init(); {33349#true} is VALID [2018-11-23 11:38:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:11,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:11,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-11-23 11:38:11,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-11-23 11:38:11,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:11,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:38:11,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:11,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:38:11,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:38:11,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:38:11,438 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand 16 states. [2018-11-23 11:38:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:15,844 INFO L93 Difference]: Finished difference Result 242 states and 298 transitions. [2018-11-23 11:38:15,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:38:15,845 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-11-23 11:38:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:38:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2018-11-23 11:38:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:38:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2018-11-23 11:38:15,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 173 transitions. [2018-11-23 11:38:16,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:16,225 INFO L225 Difference]: With dead ends: 242 [2018-11-23 11:38:16,225 INFO L226 Difference]: Without dead ends: 240 [2018-11-23 11:38:16,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:38:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-23 11:38:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 163. [2018-11-23 11:38:16,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:16,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand 163 states. [2018-11-23 11:38:16,442 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand 163 states. [2018-11-23 11:38:16,442 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 163 states. [2018-11-23 11:38:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:16,446 INFO L93 Difference]: Finished difference Result 240 states and 292 transitions. [2018-11-23 11:38:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2018-11-23 11:38:16,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:16,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:16,446 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 240 states. [2018-11-23 11:38:16,446 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 240 states. [2018-11-23 11:38:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:16,450 INFO L93 Difference]: Finished difference Result 240 states and 292 transitions. [2018-11-23 11:38:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2018-11-23 11:38:16,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:16,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:16,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:16,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-23 11:38:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 195 transitions. [2018-11-23 11:38:16,453 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 195 transitions. Word has length 28 [2018-11-23 11:38:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:16,453 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 195 transitions. [2018-11-23 11:38:16,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:38:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2018-11-23 11:38:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:38:16,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:16,454 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:16,454 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:16,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1642189426, now seen corresponding path program 1 times [2018-11-23 11:38:16,454 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:16,454 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 46 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 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:16,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:16,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:16,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {34539#true} call ULTIMATE.init(); {34539#true} is VALID [2018-11-23 11:38:16,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {34539#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {34539#true} is VALID [2018-11-23 11:38:16,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {34539#true} assume true; {34539#true} is VALID [2018-11-23 11:38:16,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34539#true} {34539#true} #181#return; {34539#true} is VALID [2018-11-23 11:38:16,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {34539#true} call #t~ret7 := main(); {34539#true} is VALID [2018-11-23 11:38:16,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {34539#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {34539#true} is VALID [2018-11-23 11:38:16,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {34539#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {34562#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {34562#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {34562#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {34562#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {34562#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {34562#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {34562#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {34562#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {34562#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {34562#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34578#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {34578#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {34578#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {34578#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {34578#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {34578#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {34578#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,622 INFO L273 TraceCheckUtils]: 15: Hoare triple {34578#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {34578#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {34578#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34594#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {34594#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {34594#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {34594#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {34594#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {34594#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {34594#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {34594#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34607#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {34607#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {34607#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {34607#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {34607#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,625 INFO L273 TraceCheckUtils]: 23: Hoare triple {34607#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {34607#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,626 INFO L273 TraceCheckUtils]: 24: Hoare triple {34607#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {34607#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,626 INFO L273 TraceCheckUtils]: 25: Hoare triple {34607#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34623#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {34623#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {34627#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:16,628 INFO L273 TraceCheckUtils]: 27: Hoare triple {34627#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {34540#false} is VALID [2018-11-23 11:38:16,628 INFO L273 TraceCheckUtils]: 28: Hoare triple {34540#false} assume !false; {34540#false} is VALID [2018-11-23 11:38:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:16,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:16,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {34540#false} assume !false; {34540#false} is VALID [2018-11-23 11:38:16,768 INFO L273 TraceCheckUtils]: 27: Hoare triple {34637#(not (= main_~__VERIFIER_assert__cond~6 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {34540#false} is VALID [2018-11-23 11:38:16,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {34641#(bvsle (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {34637#(not (= main_~__VERIFIER_assert__cond~6 (_ bv0 32)))} is VALID [2018-11-23 11:38:16,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34641#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {34661#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34645#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {34661#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {34661#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:16,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {34661#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {34661#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:16,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {34661#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {34661#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:16,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34661#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:16,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34674#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {34539#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {34690#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {34539#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {34539#true} is VALID [2018-11-23 11:38:16,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {34539#true} call #t~ret7 := main(); {34539#true} is VALID [2018-11-23 11:38:16,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34539#true} {34539#true} #181#return; {34539#true} is VALID [2018-11-23 11:38:16,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {34539#true} assume true; {34539#true} is VALID [2018-11-23 11:38:16,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {34539#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {34539#true} is VALID [2018-11-23 11:38:16,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {34539#true} call ULTIMATE.init(); {34539#true} is VALID [2018-11-23 11:38:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:16,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:16,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:38:16,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 11:38:16,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:16,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:38:16,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:16,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:38:16,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:38:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:16,865 INFO L87 Difference]: Start difference. First operand 163 states and 195 transitions. Second operand 14 states. [2018-11-23 11:38:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:20,446 INFO L93 Difference]: Finished difference Result 299 states and 335 transitions. [2018-11-23 11:38:20,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:38:20,446 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 11:38:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 335 transitions. [2018-11-23 11:38:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 335 transitions. [2018-11-23 11:38:20,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 335 transitions. [2018-11-23 11:38:20,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 335 edges. 335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:20,910 INFO L225 Difference]: With dead ends: 299 [2018-11-23 11:38:20,910 INFO L226 Difference]: Without dead ends: 297 [2018-11-23 11:38:20,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:38:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-23 11:38:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 184. [2018-11-23 11:38:21,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:21,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand 184 states. [2018-11-23 11:38:21,111 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 184 states. [2018-11-23 11:38:21,111 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 184 states. [2018-11-23 11:38:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:21,116 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2018-11-23 11:38:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 328 transitions. [2018-11-23 11:38:21,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:21,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:21,117 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 297 states. [2018-11-23 11:38:21,117 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 297 states. [2018-11-23 11:38:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:21,122 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2018-11-23 11:38:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 328 transitions. [2018-11-23 11:38:21,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:21,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:21,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:21,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 11:38:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 227 transitions. [2018-11-23 11:38:21,125 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 227 transitions. Word has length 29 [2018-11-23 11:38:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:21,125 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 227 transitions. [2018-11-23 11:38:21,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:38:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 227 transitions. [2018-11-23 11:38:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:38:21,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:21,126 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:21,126 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:21,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash -631305227, now seen corresponding path program 1 times [2018-11-23 11:38:21,126 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:21,126 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 47 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 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:21,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:21,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:21,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {35907#true} call ULTIMATE.init(); {35907#true} is VALID [2018-11-23 11:38:21,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {35907#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {35907#true} is VALID [2018-11-23 11:38:21,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {35907#true} assume true; {35907#true} is VALID [2018-11-23 11:38:21,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35907#true} {35907#true} #181#return; {35907#true} is VALID [2018-11-23 11:38:21,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {35907#true} call #t~ret7 := main(); {35907#true} is VALID [2018-11-23 11:38:21,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {35907#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {35907#true} is VALID [2018-11-23 11:38:21,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {35907#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {35930#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {35930#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {35930#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {35930#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {35930#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {35930#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {35930#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {35930#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {35930#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {35930#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35946#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {35946#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {35946#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {35946#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {35946#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {35946#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {35946#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {35946#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {35946#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {35946#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35962#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {35962#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {35962#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {35962#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {35962#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,306 INFO L273 TraceCheckUtils]: 19: Hoare triple {35962#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {35962#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {35962#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35975#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,307 INFO L273 TraceCheckUtils]: 21: Hoare triple {35975#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {35975#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,308 INFO L273 TraceCheckUtils]: 22: Hoare triple {35975#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {35975#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {35975#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {35975#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,309 INFO L273 TraceCheckUtils]: 24: Hoare triple {35975#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {35975#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,309 INFO L273 TraceCheckUtils]: 25: Hoare triple {35975#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35991#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,310 INFO L273 TraceCheckUtils]: 26: Hoare triple {35991#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {35991#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {35991#(= (_ bv4 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {35998#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:21,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {35998#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {35908#false} is VALID [2018-11-23 11:38:21,312 INFO L273 TraceCheckUtils]: 29: Hoare triple {35908#false} assume !false; {35908#false} is VALID [2018-11-23 11:38:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:21,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:21,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {35908#false} assume !false; {35908#false} is VALID [2018-11-23 11:38:21,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {36008#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {35908#false} is VALID [2018-11-23 11:38:21,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {36012#(bvsle (_ bv0 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {36008#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} is VALID [2018-11-23 11:38:21,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {36012#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {36012#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36012#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:21,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:21,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:21,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:21,469 INFO L273 TraceCheckUtils]: 21: Hoare triple {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:21,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {36035#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36019#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:21,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {36035#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {36035#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:21,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {36035#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {36035#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:21,472 INFO L273 TraceCheckUtils]: 17: Hoare triple {36035#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {36035#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:21,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36035#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:21,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:21,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:21,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:21,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:21,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {36048#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:21,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:21,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:21,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:21,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:21,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {35907#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {36064#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:21,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {35907#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {35907#true} is VALID [2018-11-23 11:38:21,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {35907#true} call #t~ret7 := main(); {35907#true} is VALID [2018-11-23 11:38:21,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35907#true} {35907#true} #181#return; {35907#true} is VALID [2018-11-23 11:38:21,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {35907#true} assume true; {35907#true} is VALID [2018-11-23 11:38:21,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {35907#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {35907#true} is VALID [2018-11-23 11:38:21,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {35907#true} call ULTIMATE.init(); {35907#true} is VALID [2018-11-23 11:38:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:21,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:21,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:38:21,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 11:38:21,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:21,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:38:21,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:21,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:38:21,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:38:21,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:21,560 INFO L87 Difference]: Start difference. First operand 184 states and 227 transitions. Second operand 14 states. [2018-11-23 11:38:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:25,731 INFO L93 Difference]: Finished difference Result 434 states and 490 transitions. [2018-11-23 11:38:25,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:38:25,731 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 11:38:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 490 transitions. [2018-11-23 11:38:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 490 transitions. [2018-11-23 11:38:25,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 490 transitions. [2018-11-23 11:38:26,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:26,540 INFO L225 Difference]: With dead ends: 434 [2018-11-23 11:38:26,540 INFO L226 Difference]: Without dead ends: 432 [2018-11-23 11:38:26,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:38:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-11-23 11:38:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 204. [2018-11-23 11:38:26,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:26,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 432 states. Second operand 204 states. [2018-11-23 11:38:26,791 INFO L74 IsIncluded]: Start isIncluded. First operand 432 states. Second operand 204 states. [2018-11-23 11:38:26,792 INFO L87 Difference]: Start difference. First operand 432 states. Second operand 204 states. [2018-11-23 11:38:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:26,802 INFO L93 Difference]: Finished difference Result 432 states and 483 transitions. [2018-11-23 11:38:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 483 transitions. [2018-11-23 11:38:26,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:26,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:26,803 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 432 states. [2018-11-23 11:38:26,803 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 432 states. [2018-11-23 11:38:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:26,812 INFO L93 Difference]: Finished difference Result 432 states and 483 transitions. [2018-11-23 11:38:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 483 transitions. [2018-11-23 11:38:26,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:26,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:26,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:26,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 11:38:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2018-11-23 11:38:26,816 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 30 [2018-11-23 11:38:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:26,816 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2018-11-23 11:38:26,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:38:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2018-11-23 11:38:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:38:26,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:26,817 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:26,817 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:26,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash -631732231, now seen corresponding path program 1 times [2018-11-23 11:38:26,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:26,818 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 48 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 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:26,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:26,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:27,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {37737#true} call ULTIMATE.init(); {37737#true} is VALID [2018-11-23 11:38:27,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {37737#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {37737#true} is VALID [2018-11-23 11:38:27,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {37737#true} assume true; {37737#true} is VALID [2018-11-23 11:38:27,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37737#true} {37737#true} #181#return; {37737#true} is VALID [2018-11-23 11:38:27,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {37737#true} call #t~ret7 := main(); {37737#true} is VALID [2018-11-23 11:38:27,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {37737#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {37737#true} is VALID [2018-11-23 11:38:27,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {37737#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {37760#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {37760#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {37760#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {37760#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {37760#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {37760#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {37760#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,019 INFO L273 TraceCheckUtils]: 10: Hoare triple {37760#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {37760#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {37760#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37776#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {37776#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37776#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {37776#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37776#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {37776#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {37776#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {37776#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {37776#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,049 INFO L273 TraceCheckUtils]: 16: Hoare triple {37776#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37792#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,049 INFO L273 TraceCheckUtils]: 17: Hoare triple {37792#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {37792#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,050 INFO L273 TraceCheckUtils]: 18: Hoare triple {37792#(= (_ bv2 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {37792#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {37792#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {37792#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {37792#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37805#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {37805#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37805#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {37805#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37805#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {37805#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {37805#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,052 INFO L273 TraceCheckUtils]: 24: Hoare triple {37805#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {37805#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,052 INFO L273 TraceCheckUtils]: 25: Hoare triple {37805#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37821#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:27,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {37821#(= (_ bv4 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {37825#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:27,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {37825#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {37829#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:27,053 INFO L273 TraceCheckUtils]: 28: Hoare triple {37829#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {37738#false} is VALID [2018-11-23 11:38:27,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {37738#false} assume !false; {37738#false} is VALID [2018-11-23 11:38:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:27,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:27,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {37738#false} assume !false; {37738#false} is VALID [2018-11-23 11:38:27,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {37839#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {37738#false} is VALID [2018-11-23 11:38:27,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {37843#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {37839#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} is VALID [2018-11-23 11:38:27,110 INFO L273 TraceCheckUtils]: 26: Hoare triple {37737#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {37843#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:27,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {37737#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37737#true} is VALID [2018-11-23 11:38:27,110 INFO L273 TraceCheckUtils]: 24: Hoare triple {37737#true} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {37737#true} is VALID [2018-11-23 11:38:27,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {37737#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {37737#true} is VALID [2018-11-23 11:38:27,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {37737#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37737#true} is VALID [2018-11-23 11:38:27,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {37737#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37737#true} is VALID [2018-11-23 11:38:27,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {37737#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37737#true} is VALID [2018-11-23 11:38:27,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {37737#true} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {37737#true} is VALID [2018-11-23 11:38:27,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {37737#true} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {37737#true} is VALID [2018-11-23 11:38:27,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {37737#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {37737#true} is VALID [2018-11-23 11:38:27,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {37737#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37737#true} is VALID [2018-11-23 11:38:27,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {37737#true} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {37737#true} is VALID [2018-11-23 11:38:27,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {37737#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {37737#true} is VALID [2018-11-23 11:38:27,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {37737#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37737#true} is VALID [2018-11-23 11:38:27,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {37737#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {37737#true} is VALID [2018-11-23 11:38:27,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {37737#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37737#true} is VALID [2018-11-23 11:38:27,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {37737#true} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {37737#true} is VALID [2018-11-23 11:38:27,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {37737#true} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {37737#true} is VALID [2018-11-23 11:38:27,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {37737#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {37737#true} is VALID [2018-11-23 11:38:27,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {37737#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {37737#true} is VALID [2018-11-23 11:38:27,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {37737#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {37737#true} is VALID [2018-11-23 11:38:27,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {37737#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {37737#true} is VALID [2018-11-23 11:38:27,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {37737#true} call #t~ret7 := main(); {37737#true} is VALID [2018-11-23 11:38:27,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37737#true} {37737#true} #181#return; {37737#true} is VALID [2018-11-23 11:38:27,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {37737#true} assume true; {37737#true} is VALID [2018-11-23 11:38:27,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {37737#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {37737#true} is VALID [2018-11-23 11:38:27,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {37737#true} call ULTIMATE.init(); {37737#true} is VALID [2018-11-23 11:38:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:38:27,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:38:27,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-23 11:38:27,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-23 11:38:27,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:27,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:38:27,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:27,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:38:27,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:38:27,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:38:27,172 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand 11 states. [2018-11-23 11:38:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:30,010 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2018-11-23 11:38:30,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:38:30,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-23 11:38:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2018-11-23 11:38:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2018-11-23 11:38:30,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 146 transitions. [2018-11-23 11:38:30,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:30,216 INFO L225 Difference]: With dead ends: 206 [2018-11-23 11:38:30,216 INFO L226 Difference]: Without dead ends: 200 [2018-11-23 11:38:30,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-23 11:38:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-11-23 11:38:30,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:30,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:30,646 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:30,646 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:30,650 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2018-11-23 11:38:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2018-11-23 11:38:30,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:30,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:30,651 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:30,651 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:30,654 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2018-11-23 11:38:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2018-11-23 11:38:30,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:30,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:30,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:30,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 11:38:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 243 transitions. [2018-11-23 11:38:30,657 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 243 transitions. Word has length 30 [2018-11-23 11:38:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:30,658 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 243 transitions. [2018-11-23 11:38:30,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:38:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2018-11-23 11:38:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:38:30,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:30,659 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:30,659 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:30,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:30,659 INFO L82 PathProgramCache]: Analyzing trace with hash 162832629, now seen corresponding path program 2 times [2018-11-23 11:38:30,659 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:30,659 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 49 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 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:30,677 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:30,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:38:30,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:30,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:30,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {38826#true} call ULTIMATE.init(); {38826#true} is VALID [2018-11-23 11:38:30,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {38826#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {38826#true} is VALID [2018-11-23 11:38:30,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {38826#true} assume true; {38826#true} is VALID [2018-11-23 11:38:30,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38826#true} {38826#true} #181#return; {38826#true} is VALID [2018-11-23 11:38:30,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {38826#true} call #t~ret7 := main(); {38826#true} is VALID [2018-11-23 11:38:30,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {38826#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {38826#true} is VALID [2018-11-23 11:38:30,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {38826#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,835 INFO L273 TraceCheckUtils]: 13: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,841 INFO L273 TraceCheckUtils]: 24: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,841 INFO L273 TraceCheckUtils]: 25: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,842 INFO L273 TraceCheckUtils]: 26: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,842 INFO L273 TraceCheckUtils]: 27: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,843 INFO L273 TraceCheckUtils]: 29: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,846 INFO L273 TraceCheckUtils]: 33: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,847 INFO L273 TraceCheckUtils]: 35: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:30,849 INFO L273 TraceCheckUtils]: 37: Hoare triple {38849#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {38943#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:30,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {38943#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~14; {38827#false} is VALID [2018-11-23 11:38:30,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {38827#false} assume !false; {38827#false} is VALID [2018-11-23 11:38:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 11:38:30,853 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:30,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:30,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:38:30,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 11:38:30,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:30,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:38:30,886 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-23 11:38:30,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:38:30,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:38:30,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:38:30,887 INFO L87 Difference]: Start difference. First operand 200 states and 243 transitions. Second operand 4 states. [2018-11-23 11:38:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:31,459 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2018-11-23 11:38:31,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:38:31,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 11:38:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:38:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2018-11-23 11:38:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:38:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2018-11-23 11:38:31,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 55 transitions. [2018-11-23 11:38:31,556 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-23 11:38:31,560 INFO L225 Difference]: With dead ends: 200 [2018-11-23 11:38:31,560 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 11:38:31,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:38:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 11:38:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-11-23 11:38:31,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:31,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:31,817 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:31,817 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:31,821 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2018-11-23 11:38:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2018-11-23 11:38:31,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:31,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:31,821 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:31,821 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:31,824 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2018-11-23 11:38:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2018-11-23 11:38:31,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:31,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:31,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:31,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-23 11:38:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 237 transitions. [2018-11-23 11:38:31,827 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 237 transitions. Word has length 40 [2018-11-23 11:38:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:31,827 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 237 transitions. [2018-11-23 11:38:31,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:38:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2018-11-23 11:38:31,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:38:31,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:31,828 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:31,828 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:31,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash 753289283, now seen corresponding path program 2 times [2018-11-23 11:38:31,829 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:31,829 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 50 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 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:31,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:31,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:31,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:31,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:32,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {39828#true} call ULTIMATE.init(); {39828#true} is VALID [2018-11-23 11:38:32,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {39828#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {39828#true} is VALID [2018-11-23 11:38:32,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {39828#true} assume true; {39828#true} is VALID [2018-11-23 11:38:32,080 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39828#true} {39828#true} #181#return; {39828#true} is VALID [2018-11-23 11:38:32,080 INFO L256 TraceCheckUtils]: 4: Hoare triple {39828#true} call #t~ret7 := main(); {39828#true} is VALID [2018-11-23 11:38:32,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {39828#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {39828#true} is VALID [2018-11-23 11:38:32,081 INFO L273 TraceCheckUtils]: 6: Hoare triple {39828#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {39851#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,081 INFO L273 TraceCheckUtils]: 7: Hoare triple {39851#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {39851#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {39851#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {39851#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {39851#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {39851#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {39851#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {39851#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {39851#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {39867#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {39867#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {39867#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {39867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {39867#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39867#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {39867#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39883#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {39883#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39883#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,088 INFO L273 TraceCheckUtils]: 18: Hoare triple {39883#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39883#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {39883#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {39883#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {39883#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39883#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {39883#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39899#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {39899#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39899#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {39899#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39899#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,091 INFO L273 TraceCheckUtils]: 24: Hoare triple {39899#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {39899#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {39899#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39899#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {39899#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39915#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {39915#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39915#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {39915#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39915#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,094 INFO L273 TraceCheckUtils]: 29: Hoare triple {39915#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {39915#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {39915#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39915#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {39915#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39931#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {39931#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39931#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,096 INFO L273 TraceCheckUtils]: 33: Hoare triple {39931#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39931#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {39931#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {39931#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {39931#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39931#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {39931#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39947#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,098 INFO L273 TraceCheckUtils]: 37: Hoare triple {39947#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39947#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {39947#(= (_ bv6 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39954#(= (bvadd main_~__VERIFIER_assert__cond~18 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:32,100 INFO L273 TraceCheckUtils]: 39: Hoare triple {39954#(= (bvadd main_~__VERIFIER_assert__cond~18 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~18; {39829#false} is VALID [2018-11-23 11:38:32,100 INFO L273 TraceCheckUtils]: 40: Hoare triple {39829#false} assume !false; {39829#false} is VALID [2018-11-23 11:38:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:32,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:32,303 INFO L273 TraceCheckUtils]: 40: Hoare triple {39829#false} assume !false; {39829#false} is VALID [2018-11-23 11:38:32,304 INFO L273 TraceCheckUtils]: 39: Hoare triple {39964#(not (= main_~__VERIFIER_assert__cond~18 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~18; {39829#false} is VALID [2018-11-23 11:38:32,304 INFO L273 TraceCheckUtils]: 38: Hoare triple {39968#(bvsle (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39964#(not (= main_~__VERIFIER_assert__cond~18 (_ bv0 32)))} is VALID [2018-11-23 11:38:32,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {39968#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39968#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39968#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:32,306 INFO L273 TraceCheckUtils]: 35: Hoare triple {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:32,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:32,307 INFO L273 TraceCheckUtils]: 33: Hoare triple {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:32,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:32,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39975#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:32,312 INFO L273 TraceCheckUtils]: 30: Hoare triple {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:32,313 INFO L273 TraceCheckUtils]: 29: Hoare triple {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:32,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:32,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:32,316 INFO L273 TraceCheckUtils]: 26: Hoare triple {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {39991#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:32,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:32,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:32,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:32,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:32,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40007#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:32,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:32,320 INFO L273 TraceCheckUtils]: 19: Hoare triple {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:32,321 INFO L273 TraceCheckUtils]: 18: Hoare triple {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:32,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:32,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40023#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:32,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:32,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:32,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:32,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:32,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {40039#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:32,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:32,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:32,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:32,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:32,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {39828#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {40055#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:32,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {39828#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {39828#true} is VALID [2018-11-23 11:38:32,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {39828#true} call #t~ret7 := main(); {39828#true} is VALID [2018-11-23 11:38:32,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39828#true} {39828#true} #181#return; {39828#true} is VALID [2018-11-23 11:38:32,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {39828#true} assume true; {39828#true} is VALID [2018-11-23 11:38:32,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {39828#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {39828#true} is VALID [2018-11-23 11:38:32,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {39828#true} call ULTIMATE.init(); {39828#true} is VALID [2018-11-23 11:38:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:32,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:32,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:38:32,336 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 11:38:32,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:32,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:38:32,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:32,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:38:32,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:38:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:38:32,438 INFO L87 Difference]: Start difference. First operand 197 states and 237 transitions. Second operand 18 states. [2018-11-23 11:38:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:40,557 INFO L93 Difference]: Finished difference Result 599 states and 676 transitions. [2018-11-23 11:38:40,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:38:40,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 11:38:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 676 transitions. [2018-11-23 11:38:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 676 transitions. [2018-11-23 11:38:40,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 676 transitions. [2018-11-23 11:38:41,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 676 edges. 676 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:41,608 INFO L225 Difference]: With dead ends: 599 [2018-11-23 11:38:41,608 INFO L226 Difference]: Without dead ends: 597 [2018-11-23 11:38:41,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:38:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-11-23 11:38:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 223. [2018-11-23 11:38:41,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:41,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand 223 states. [2018-11-23 11:38:41,887 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand 223 states. [2018-11-23 11:38:41,888 INFO L87 Difference]: Start difference. First operand 597 states. Second operand 223 states. [2018-11-23 11:38:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:41,904 INFO L93 Difference]: Finished difference Result 597 states and 667 transitions. [2018-11-23 11:38:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 667 transitions. [2018-11-23 11:38:41,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:41,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:41,905 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 597 states. [2018-11-23 11:38:41,905 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 597 states. [2018-11-23 11:38:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:41,919 INFO L93 Difference]: Finished difference Result 597 states and 667 transitions. [2018-11-23 11:38:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 667 transitions. [2018-11-23 11:38:41,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:41,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:41,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:41,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-23 11:38:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2018-11-23 11:38:41,923 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 41 [2018-11-23 11:38:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:41,923 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2018-11-23 11:38:41,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:38:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2018-11-23 11:38:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:38:41,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:41,924 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:41,924 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:41,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:41,925 INFO L82 PathProgramCache]: Analyzing trace with hash 753275381, now seen corresponding path program 2 times [2018-11-23 11:38:41,925 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:41,925 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 51 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 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:41,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:42,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:42,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:42,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:42,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {42282#true} call ULTIMATE.init(); {42282#true} is VALID [2018-11-23 11:38:42,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {42282#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {42282#true} is VALID [2018-11-23 11:38:42,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {42282#true} assume true; {42282#true} is VALID [2018-11-23 11:38:42,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42282#true} {42282#true} #181#return; {42282#true} is VALID [2018-11-23 11:38:42,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {42282#true} call #t~ret7 := main(); {42282#true} is VALID [2018-11-23 11:38:42,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {42282#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {42282#true} is VALID [2018-11-23 11:38:42,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {42282#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {42305#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {42305#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {42305#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {42305#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {42305#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {42305#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {42305#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {42305#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {42305#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {42305#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42321#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {42321#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42321#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {42321#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42321#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {42321#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42321#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {42321#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42321#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {42321#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42337#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {42337#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42337#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {42337#(= (_ bv2 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42337#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {42337#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42337#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {42337#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42337#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {42337#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42353#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {42353#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42353#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {42353#(= (_ bv3 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42353#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {42353#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42353#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {42353#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42353#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {42353#(= (_ bv3 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42369#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {42369#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42369#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {42369#(= (_ bv4 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42369#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {42369#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42369#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,194 INFO L273 TraceCheckUtils]: 30: Hoare triple {42369#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42369#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,195 INFO L273 TraceCheckUtils]: 31: Hoare triple {42369#(= (_ bv4 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42385#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,195 INFO L273 TraceCheckUtils]: 32: Hoare triple {42385#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42385#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {42385#(= (_ bv5 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42385#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,197 INFO L273 TraceCheckUtils]: 34: Hoare triple {42385#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42385#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,197 INFO L273 TraceCheckUtils]: 35: Hoare triple {42385#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42385#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,198 INFO L273 TraceCheckUtils]: 36: Hoare triple {42385#(= (_ bv5 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42401#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,198 INFO L273 TraceCheckUtils]: 37: Hoare triple {42401#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42401#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,199 INFO L273 TraceCheckUtils]: 38: Hoare triple {42401#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {42408#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:42,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {42408#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {42283#false} is VALID [2018-11-23 11:38:42,200 INFO L273 TraceCheckUtils]: 40: Hoare triple {42283#false} assume !false; {42283#false} is VALID [2018-11-23 11:38:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:42,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:42,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {42283#false} assume !false; {42283#false} is VALID [2018-11-23 11:38:42,427 INFO L273 TraceCheckUtils]: 39: Hoare triple {42418#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {42283#false} is VALID [2018-11-23 11:38:42,436 INFO L273 TraceCheckUtils]: 38: Hoare triple {42422#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {42418#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} is VALID [2018-11-23 11:38:42,449 INFO L273 TraceCheckUtils]: 37: Hoare triple {42422#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42422#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42422#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:42,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:42,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:42,452 INFO L273 TraceCheckUtils]: 33: Hoare triple {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:42,452 INFO L273 TraceCheckUtils]: 32: Hoare triple {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:42,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42429#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:42,454 INFO L273 TraceCheckUtils]: 30: Hoare triple {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:42,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:42,455 INFO L273 TraceCheckUtils]: 28: Hoare triple {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:42,455 INFO L273 TraceCheckUtils]: 27: Hoare triple {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:42,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42445#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:42,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:42,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:42,459 INFO L273 TraceCheckUtils]: 23: Hoare triple {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:42,459 INFO L273 TraceCheckUtils]: 22: Hoare triple {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:42,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42461#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:42,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:42,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:42,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:42,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:42,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42477#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:42,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~19);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:42,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:42,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:42,469 INFO L273 TraceCheckUtils]: 12: Hoare triple {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:42,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {42493#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:42,482 INFO L273 TraceCheckUtils]: 10: Hoare triple {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:42,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:42,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:42,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:42,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {42282#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {42509#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:42,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {42282#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {42282#true} is VALID [2018-11-23 11:38:42,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {42282#true} call #t~ret7 := main(); {42282#true} is VALID [2018-11-23 11:38:42,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42282#true} {42282#true} #181#return; {42282#true} is VALID [2018-11-23 11:38:42,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {42282#true} assume true; {42282#true} is VALID [2018-11-23 11:38:42,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {42282#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {42282#true} is VALID [2018-11-23 11:38:42,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {42282#true} call ULTIMATE.init(); {42282#true} is VALID [2018-11-23 11:38:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:42,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:42,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:38:42,489 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 11:38:42,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:42,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:38:42,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:42,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:38:42,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:38:42,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:38:42,592 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand 18 states. [2018-11-23 11:38:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:50,288 INFO L93 Difference]: Finished difference Result 586 states and 664 transitions. [2018-11-23 11:38:50,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:38:50,288 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 11:38:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 664 transitions. [2018-11-23 11:38:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 664 transitions. [2018-11-23 11:38:50,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 664 transitions. [2018-11-23 11:38:51,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 664 edges. 664 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:51,314 INFO L225 Difference]: With dead ends: 586 [2018-11-23 11:38:51,314 INFO L226 Difference]: Without dead ends: 584 [2018-11-23 11:38:51,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:38:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-11-23 11:38:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 224. [2018-11-23 11:38:51,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:51,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand 224 states. [2018-11-23 11:38:51,605 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 224 states. [2018-11-23 11:38:51,606 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 224 states. [2018-11-23 11:38:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,621 INFO L93 Difference]: Finished difference Result 584 states and 655 transitions. [2018-11-23 11:38:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 655 transitions. [2018-11-23 11:38:51,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:51,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:51,622 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand 584 states. [2018-11-23 11:38:51,622 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 584 states. [2018-11-23 11:38:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,636 INFO L93 Difference]: Finished difference Result 584 states and 655 transitions. [2018-11-23 11:38:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 655 transitions. [2018-11-23 11:38:51,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:51,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:51,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:51,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-23 11:38:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 264 transitions. [2018-11-23 11:38:51,640 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 264 transitions. Word has length 41 [2018-11-23 11:38:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:51,641 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 264 transitions. [2018-11-23 11:38:51,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:38:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 264 transitions. [2018-11-23 11:38:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:38:51,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:51,641 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:51,641 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:51,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1367615641, now seen corresponding path program 1 times [2018-11-23 11:38:51,642 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:51,642 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 52 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 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:51,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:38:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:51,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:51,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {44699#true} call ULTIMATE.init(); {44699#true} is VALID [2018-11-23 11:38:51,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {44699#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {44699#true} is VALID [2018-11-23 11:38:51,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {44699#true} assume true; {44699#true} is VALID [2018-11-23 11:38:51,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44699#true} {44699#true} #181#return; {44699#true} is VALID [2018-11-23 11:38:51,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {44699#true} call #t~ret7 := main(); {44699#true} is VALID [2018-11-23 11:38:51,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {44699#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {44699#true} is VALID [2018-11-23 11:38:51,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {44699#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {44722#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {44722#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {44722#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {44722#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {44722#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {44722#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {44722#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {44722#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {44722#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {44722#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44738#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {44738#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {44738#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {44738#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {44738#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {44738#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {44738#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {44738#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {44738#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {44738#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44754#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,911 INFO L273 TraceCheckUtils]: 17: Hoare triple {44754#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {44754#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {44754#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {44754#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {44754#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {44754#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {44754#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {44754#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,915 INFO L273 TraceCheckUtils]: 21: Hoare triple {44754#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44770#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {44770#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {44770#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {44770#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {44770#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {44770#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {44770#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {44770#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44783#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {44783#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {44783#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {44783#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {44783#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {44783#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {44783#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,918 INFO L273 TraceCheckUtils]: 29: Hoare triple {44783#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {44783#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {44783#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44799#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,919 INFO L273 TraceCheckUtils]: 31: Hoare triple {44799#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {44799#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,919 INFO L273 TraceCheckUtils]: 32: Hoare triple {44799#(= (_ bv5 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {44799#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,920 INFO L273 TraceCheckUtils]: 33: Hoare triple {44799#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {44799#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {44799#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44812#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,921 INFO L273 TraceCheckUtils]: 35: Hoare triple {44812#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {44812#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {44812#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {44812#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {44812#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {44812#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {44812#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {44812#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,924 INFO L273 TraceCheckUtils]: 39: Hoare triple {44812#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44828#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,925 INFO L273 TraceCheckUtils]: 40: Hoare triple {44828#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {44828#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,926 INFO L273 TraceCheckUtils]: 41: Hoare triple {44828#(= (_ bv7 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {44828#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,926 INFO L273 TraceCheckUtils]: 42: Hoare triple {44828#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {44828#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,927 INFO L273 TraceCheckUtils]: 43: Hoare triple {44828#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44841#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:51,927 INFO L273 TraceCheckUtils]: 44: Hoare triple {44841#(= (_ bv8 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {44845#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:51,927 INFO L273 TraceCheckUtils]: 45: Hoare triple {44845#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {44700#false} is VALID [2018-11-23 11:38:51,928 INFO L273 TraceCheckUtils]: 46: Hoare triple {44700#false} assume !false; {44700#false} is VALID [2018-11-23 11:38:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:51,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:52,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {44700#false} assume !false; {44700#false} is VALID [2018-11-23 11:38:52,237 INFO L273 TraceCheckUtils]: 45: Hoare triple {44855#(not (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {44700#false} is VALID [2018-11-23 11:38:52,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {44859#(bvsle (_ bv0 32) main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {44855#(not (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} is VALID [2018-11-23 11:38:52,240 INFO L273 TraceCheckUtils]: 43: Hoare triple {44863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44859#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:52,241 INFO L273 TraceCheckUtils]: 42: Hoare triple {44863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {44863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:52,241 INFO L273 TraceCheckUtils]: 41: Hoare triple {44863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {44863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:52,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {44863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {44863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:52,244 INFO L273 TraceCheckUtils]: 39: Hoare triple {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:52,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:52,246 INFO L273 TraceCheckUtils]: 37: Hoare triple {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:52,246 INFO L273 TraceCheckUtils]: 36: Hoare triple {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:52,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:52,248 INFO L273 TraceCheckUtils]: 34: Hoare triple {44892#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44876#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:52,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {44892#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {44892#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:52,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {44892#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {44892#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:52,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {44892#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {44892#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:52,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44892#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:52,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:52,253 INFO L273 TraceCheckUtils]: 28: Hoare triple {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:52,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:52,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:52,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {44921#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44905#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:52,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {44921#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {44921#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:52,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {44921#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {44921#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:52,258 INFO L273 TraceCheckUtils]: 22: Hoare triple {44921#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {44921#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:52,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44921#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:52,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:52,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:52,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:52,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:52,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44934#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:52,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:52,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:52,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:52,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:52,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44950#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:52,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:52,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:52,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:52,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:52,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {44699#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {44966#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:52,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {44699#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {44699#true} is VALID [2018-11-23 11:38:52,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {44699#true} call #t~ret7 := main(); {44699#true} is VALID [2018-11-23 11:38:52,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44699#true} {44699#true} #181#return; {44699#true} is VALID [2018-11-23 11:38:52,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {44699#true} assume true; {44699#true} is VALID [2018-11-23 11:38:52,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {44699#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {44699#true} is VALID [2018-11-23 11:38:52,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {44699#true} call ULTIMATE.init(); {44699#true} is VALID [2018-11-23 11:38:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:52,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:52,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:38:52,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-11-23 11:38:52,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:52,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:38:52,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:52,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:38:52,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:38:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:38:52,406 INFO L87 Difference]: Start difference. First operand 224 states and 264 transitions. Second operand 22 states. [2018-11-23 11:39:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:02,238 INFO L93 Difference]: Finished difference Result 473 states and 537 transitions. [2018-11-23 11:39:02,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:39:02,238 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-11-23 11:39:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 537 transitions. [2018-11-23 11:39:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 537 transitions. [2018-11-23 11:39:02,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 537 transitions. [2018-11-23 11:39:03,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 537 edges. 537 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:03,040 INFO L225 Difference]: With dead ends: 473 [2018-11-23 11:39:03,040 INFO L226 Difference]: Without dead ends: 461 [2018-11-23 11:39:03,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=467, Invalid=1093, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:39:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-23 11:39:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 333. [2018-11-23 11:39:03,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:03,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand 333 states. [2018-11-23 11:39:03,564 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand 333 states. [2018-11-23 11:39:03,564 INFO L87 Difference]: Start difference. First operand 461 states. Second operand 333 states. [2018-11-23 11:39:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:03,574 INFO L93 Difference]: Finished difference Result 461 states and 516 transitions. [2018-11-23 11:39:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 516 transitions. [2018-11-23 11:39:03,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:03,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:03,575 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand 461 states. [2018-11-23 11:39:03,575 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 461 states. [2018-11-23 11:39:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:03,585 INFO L93 Difference]: Finished difference Result 461 states and 516 transitions. [2018-11-23 11:39:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 516 transitions. [2018-11-23 11:39:03,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:03,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:03,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:03,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-23 11:39:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 421 transitions. [2018-11-23 11:39:03,592 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 421 transitions. Word has length 47 [2018-11-23 11:39:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:03,592 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 421 transitions. [2018-11-23 11:39:03,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:39:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 421 transitions. [2018-11-23 11:39:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:39:03,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:03,593 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:03,593 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:03,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:03,593 INFO L82 PathProgramCache]: Analyzing trace with hash 32956203, now seen corresponding path program 1 times [2018-11-23 11:39:03,594 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:03,594 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 53 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 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:03,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:03,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:03,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {46918#true} call ULTIMATE.init(); {46918#true} is VALID [2018-11-23 11:39:03,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {46918#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {46918#true} is VALID [2018-11-23 11:39:03,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {46918#true} assume true; {46918#true} is VALID [2018-11-23 11:39:03,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46918#true} {46918#true} #181#return; {46918#true} is VALID [2018-11-23 11:39:03,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {46918#true} call #t~ret7 := main(); {46918#true} is VALID [2018-11-23 11:39:03,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {46918#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {46918#true} is VALID [2018-11-23 11:39:03,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {46918#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {46941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {46941#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {46941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {46941#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {46941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {46941#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {46941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {46941#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {46941#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {46941#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46957#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {46957#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {46957#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {46957#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {46957#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {46957#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {46957#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {46957#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {46957#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {46957#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46973#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {46973#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {46973#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {46973#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {46973#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {46973#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {46973#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,875 INFO L273 TraceCheckUtils]: 20: Hoare triple {46973#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {46973#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {46973#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46989#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {46989#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {46989#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {46989#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {46989#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,879 INFO L273 TraceCheckUtils]: 24: Hoare triple {46989#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {46989#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {46989#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47002#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {47002#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {47002#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,880 INFO L273 TraceCheckUtils]: 27: Hoare triple {47002#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {47002#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {47002#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {47002#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,881 INFO L273 TraceCheckUtils]: 29: Hoare triple {47002#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {47002#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,881 INFO L273 TraceCheckUtils]: 30: Hoare triple {47002#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47018#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,882 INFO L273 TraceCheckUtils]: 31: Hoare triple {47018#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {47018#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,882 INFO L273 TraceCheckUtils]: 32: Hoare triple {47018#(= (_ bv5 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {47018#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,883 INFO L273 TraceCheckUtils]: 33: Hoare triple {47018#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {47018#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,883 INFO L273 TraceCheckUtils]: 34: Hoare triple {47018#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47031#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {47031#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {47031#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,884 INFO L273 TraceCheckUtils]: 36: Hoare triple {47031#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {47031#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,885 INFO L273 TraceCheckUtils]: 37: Hoare triple {47031#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {47031#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {47031#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {47031#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,887 INFO L273 TraceCheckUtils]: 39: Hoare triple {47031#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47047#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,888 INFO L273 TraceCheckUtils]: 40: Hoare triple {47047#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {47047#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {47047#(= (_ bv7 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {47047#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,889 INFO L273 TraceCheckUtils]: 42: Hoare triple {47047#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {47047#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,890 INFO L273 TraceCheckUtils]: 43: Hoare triple {47047#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47060#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,890 INFO L273 TraceCheckUtils]: 44: Hoare triple {47060#(= (_ bv8 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {47060#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,891 INFO L273 TraceCheckUtils]: 45: Hoare triple {47060#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {47060#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:03,891 INFO L273 TraceCheckUtils]: 46: Hoare triple {47060#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {47070#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:03,892 INFO L273 TraceCheckUtils]: 47: Hoare triple {47070#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {46919#false} is VALID [2018-11-23 11:39:03,892 INFO L273 TraceCheckUtils]: 48: Hoare triple {46919#false} assume !false; {46919#false} is VALID [2018-11-23 11:39:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:03,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:04,186 INFO L273 TraceCheckUtils]: 48: Hoare triple {46919#false} assume !false; {46919#false} is VALID [2018-11-23 11:39:04,187 INFO L273 TraceCheckUtils]: 47: Hoare triple {47080#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {46919#false} is VALID [2018-11-23 11:39:04,188 INFO L273 TraceCheckUtils]: 46: Hoare triple {47084#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {47080#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} is VALID [2018-11-23 11:39:04,188 INFO L273 TraceCheckUtils]: 45: Hoare triple {47084#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {47084#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:04,189 INFO L273 TraceCheckUtils]: 44: Hoare triple {47084#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {47084#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:04,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {47094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47084#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:04,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {47094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {47094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:04,192 INFO L273 TraceCheckUtils]: 41: Hoare triple {47094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {47094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:04,192 INFO L273 TraceCheckUtils]: 40: Hoare triple {47094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {47094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:04,194 INFO L273 TraceCheckUtils]: 39: Hoare triple {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:04,194 INFO L273 TraceCheckUtils]: 38: Hoare triple {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:04,195 INFO L273 TraceCheckUtils]: 37: Hoare triple {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:04,195 INFO L273 TraceCheckUtils]: 36: Hoare triple {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:04,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:04,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {47123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47107#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:04,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {47123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {47123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:04,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {47123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {47123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:04,200 INFO L273 TraceCheckUtils]: 31: Hoare triple {47123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {47123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:04,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:04,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:04,203 INFO L273 TraceCheckUtils]: 28: Hoare triple {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:04,204 INFO L273 TraceCheckUtils]: 27: Hoare triple {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:04,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:04,206 INFO L273 TraceCheckUtils]: 25: Hoare triple {47152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47136#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:04,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {47152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {47152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:04,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {47152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {47152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:04,208 INFO L273 TraceCheckUtils]: 22: Hoare triple {47152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {47152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:04,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:04,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:04,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:04,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:04,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:04,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47165#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:04,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:04,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:04,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:04,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:04,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {47181#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:04,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:04,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:04,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:04,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:04,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {46918#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {47197#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:04,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {46918#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {46918#true} is VALID [2018-11-23 11:39:04,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {46918#true} call #t~ret7 := main(); {46918#true} is VALID [2018-11-23 11:39:04,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46918#true} {46918#true} #181#return; {46918#true} is VALID [2018-11-23 11:39:04,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {46918#true} assume true; {46918#true} is VALID [2018-11-23 11:39:04,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {46918#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {46918#true} is VALID [2018-11-23 11:39:04,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {46918#true} call ULTIMATE.init(); {46918#true} is VALID [2018-11-23 11:39:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:04,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:04,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:39:04,225 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:39:04,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:04,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:39:04,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:04,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:39:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:39:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:39:04,362 INFO L87 Difference]: Start difference. First operand 333 states and 421 transitions. Second operand 22 states. [2018-11-23 11:39:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:15,606 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2018-11-23 11:39:15,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:39:15,606 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:39:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 729 transitions. [2018-11-23 11:39:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 729 transitions. [2018-11-23 11:39:15,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 729 transitions. [2018-11-23 11:39:16,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:16,744 INFO L225 Difference]: With dead ends: 631 [2018-11-23 11:39:16,744 INFO L226 Difference]: Without dead ends: 629 [2018-11-23 11:39:16,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=684, Invalid=1478, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:39:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-11-23 11:39:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 336. [2018-11-23 11:39:17,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:17,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 629 states. Second operand 336 states. [2018-11-23 11:39:17,323 INFO L74 IsIncluded]: Start isIncluded. First operand 629 states. Second operand 336 states. [2018-11-23 11:39:17,323 INFO L87 Difference]: Start difference. First operand 629 states. Second operand 336 states. [2018-11-23 11:39:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:17,339 INFO L93 Difference]: Finished difference Result 629 states and 718 transitions. [2018-11-23 11:39:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 718 transitions. [2018-11-23 11:39:17,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:17,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:17,340 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand 629 states. [2018-11-23 11:39:17,340 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 629 states. [2018-11-23 11:39:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:17,354 INFO L93 Difference]: Finished difference Result 629 states and 718 transitions. [2018-11-23 11:39:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 718 transitions. [2018-11-23 11:39:17,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:17,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:17,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:17,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-23 11:39:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 418 transitions. [2018-11-23 11:39:17,361 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 418 transitions. Word has length 49 [2018-11-23 11:39:17,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:17,361 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 418 transitions. [2018-11-23 11:39:17,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:39:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 418 transitions. [2018-11-23 11:39:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:39:17,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:17,362 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:17,363 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:17,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:17,363 INFO L82 PathProgramCache]: Analyzing trace with hash 34495403, now seen corresponding path program 1 times [2018-11-23 11:39:17,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:17,363 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 54 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 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:17,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:17,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:17,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {49695#true} call ULTIMATE.init(); {49695#true} is VALID [2018-11-23 11:39:17,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {49695#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {49695#true} is VALID [2018-11-23 11:39:17,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {49695#true} assume true; {49695#true} is VALID [2018-11-23 11:39:17,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49695#true} {49695#true} #181#return; {49695#true} is VALID [2018-11-23 11:39:17,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {49695#true} call #t~ret7 := main(); {49695#true} is VALID [2018-11-23 11:39:17,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {49695#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {49695#true} is VALID [2018-11-23 11:39:17,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {49695#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {49718#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {49718#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {49718#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {49718#(= (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {49718#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {49718#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {49718#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {49718#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {49718#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {49718#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49734#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {49734#(= (_ bv1 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {49734#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {49734#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {49734#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {49734#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {49734#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {49734#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {49734#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {49734#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {49750#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {49750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,672 INFO L273 TraceCheckUtils]: 18: Hoare triple {49750#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {49750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {49750#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {49750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {49750#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {49750#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {49750#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49766#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {49766#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {49766#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {49766#(= (_ bv3 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {49766#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {49766#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {49766#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {49766#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49779#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {49779#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {49779#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {49779#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {49779#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {49779#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {49779#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {49779#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {49779#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,713 INFO L273 TraceCheckUtils]: 30: Hoare triple {49779#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49795#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {49795#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {49795#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {49795#(= (_ bv5 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {49795#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,751 INFO L273 TraceCheckUtils]: 33: Hoare triple {49795#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {49795#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {49795#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49808#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,772 INFO L273 TraceCheckUtils]: 35: Hoare triple {49808#(= (_ bv6 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {49808#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {49808#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {49808#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {49808#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {49808#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,797 INFO L273 TraceCheckUtils]: 38: Hoare triple {49808#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {49808#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {49808#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49824#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {49824#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {49824#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,802 INFO L273 TraceCheckUtils]: 41: Hoare triple {49824#(= (_ bv7 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {49824#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {49824#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {49824#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {49824#(= (_ bv7 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49837#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {49837#(= (_ bv8 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {49837#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {49837#(= (_ bv8 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {49837#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:17,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {49837#(= (_ bv8 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {49847#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:17,805 INFO L273 TraceCheckUtils]: 47: Hoare triple {49847#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {49696#false} is VALID [2018-11-23 11:39:17,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {49696#false} assume !false; {49696#false} is VALID [2018-11-23 11:39:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:17,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:18,186 INFO L273 TraceCheckUtils]: 48: Hoare triple {49696#false} assume !false; {49696#false} is VALID [2018-11-23 11:39:18,186 INFO L273 TraceCheckUtils]: 47: Hoare triple {49857#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {49696#false} is VALID [2018-11-23 11:39:18,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {49861#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {49857#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} is VALID [2018-11-23 11:39:18,188 INFO L273 TraceCheckUtils]: 45: Hoare triple {49861#(bvsle (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {49861#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:18,188 INFO L273 TraceCheckUtils]: 44: Hoare triple {49861#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {49861#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:18,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {49871#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49861#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:18,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {49871#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {49871#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:18,191 INFO L273 TraceCheckUtils]: 41: Hoare triple {49871#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {49871#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:18,192 INFO L273 TraceCheckUtils]: 40: Hoare triple {49871#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {49871#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:18,195 INFO L273 TraceCheckUtils]: 39: Hoare triple {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49871#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:18,195 INFO L273 TraceCheckUtils]: 38: Hoare triple {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:18,196 INFO L273 TraceCheckUtils]: 37: Hoare triple {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:18,196 INFO L273 TraceCheckUtils]: 36: Hoare triple {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:18,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:18,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {49900#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49884#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:18,199 INFO L273 TraceCheckUtils]: 33: Hoare triple {49900#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {49900#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:18,199 INFO L273 TraceCheckUtils]: 32: Hoare triple {49900#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {49900#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:18,200 INFO L273 TraceCheckUtils]: 31: Hoare triple {49900#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {49900#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:18,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49900#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:18,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:18,203 INFO L273 TraceCheckUtils]: 28: Hoare triple {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:18,203 INFO L273 TraceCheckUtils]: 27: Hoare triple {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:18,203 INFO L273 TraceCheckUtils]: 26: Hoare triple {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:18,205 INFO L273 TraceCheckUtils]: 25: Hoare triple {49929#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49913#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:18,205 INFO L273 TraceCheckUtils]: 24: Hoare triple {49929#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {49929#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:18,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {49929#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {49929#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:18,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {49929#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {49929#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:18,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49929#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:18,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:18,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:18,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:18,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:18,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49942#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:18,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~1; {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:18,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:18,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:18,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:18,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49958#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:18,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:18,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:18,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:18,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:18,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {49695#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {49974#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:18,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {49695#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {49695#true} is VALID [2018-11-23 11:39:18,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {49695#true} call #t~ret7 := main(); {49695#true} is VALID [2018-11-23 11:39:18,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49695#true} {49695#true} #181#return; {49695#true} is VALID [2018-11-23 11:39:18,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {49695#true} assume true; {49695#true} is VALID [2018-11-23 11:39:18,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {49695#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {49695#true} is VALID [2018-11-23 11:39:18,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {49695#true} call ULTIMATE.init(); {49695#true} is VALID [2018-11-23 11:39:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:18,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:18,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:39:18,226 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:39:18,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:18,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:39:18,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:18,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:39:18,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:39:18,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:39:18,359 INFO L87 Difference]: Start difference. First operand 336 states and 418 transitions. Second operand 22 states. [2018-11-23 11:39:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:27,477 INFO L93 Difference]: Finished difference Result 423 states and 487 transitions. [2018-11-23 11:39:27,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:39:27,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:39:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 487 transitions. [2018-11-23 11:39:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 487 transitions. [2018-11-23 11:39:27,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 487 transitions. [2018-11-23 11:39:28,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:28,197 INFO L225 Difference]: With dead ends: 423 [2018-11-23 11:39:28,197 INFO L226 Difference]: Without dead ends: 411 [2018-11-23 11:39:28,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=467, Invalid=1093, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:39:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-11-23 11:39:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 337. [2018-11-23 11:39:28,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:28,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand 337 states. [2018-11-23 11:39:28,736 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand 337 states. [2018-11-23 11:39:28,736 INFO L87 Difference]: Start difference. First operand 411 states. Second operand 337 states. [2018-11-23 11:39:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:28,745 INFO L93 Difference]: Finished difference Result 411 states and 466 transitions. [2018-11-23 11:39:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 466 transitions. [2018-11-23 11:39:28,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:28,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:28,746 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 411 states. [2018-11-23 11:39:28,746 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 411 states. [2018-11-23 11:39:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:28,754 INFO L93 Difference]: Finished difference Result 411 states and 466 transitions. [2018-11-23 11:39:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 466 transitions. [2018-11-23 11:39:28,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:28,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:28,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:28,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-23 11:39:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 410 transitions. [2018-11-23 11:39:28,760 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 410 transitions. Word has length 49 [2018-11-23 11:39:28,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:28,760 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 410 transitions. [2018-11-23 11:39:28,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:39:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 410 transitions. [2018-11-23 11:39:28,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:39:28,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:28,761 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:28,761 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:28,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:28,762 INFO L82 PathProgramCache]: Analyzing trace with hash -666043961, now seen corresponding path program 2 times [2018-11-23 11:39:28,762 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:28,762 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 55 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 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:28,788 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:39:28,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:39:28,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:28,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:28,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {51780#true} call ULTIMATE.init(); {51780#true} is VALID [2018-11-23 11:39:28,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {51780#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {51780#true} is VALID [2018-11-23 11:39:28,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {51780#true} assume true; {51780#true} is VALID [2018-11-23 11:39:28,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51780#true} {51780#true} #181#return; {51780#true} is VALID [2018-11-23 11:39:28,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {51780#true} call #t~ret7 := main(); {51780#true} is VALID [2018-11-23 11:39:28,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {51780#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {51780#true} is VALID [2018-11-23 11:39:28,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {51780#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,937 INFO L273 TraceCheckUtils]: 8: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,939 INFO L273 TraceCheckUtils]: 15: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,943 INFO L273 TraceCheckUtils]: 21: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,945 INFO L273 TraceCheckUtils]: 25: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,945 INFO L273 TraceCheckUtils]: 26: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,952 INFO L273 TraceCheckUtils]: 39: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,953 INFO L273 TraceCheckUtils]: 41: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,953 INFO L273 TraceCheckUtils]: 42: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,954 INFO L273 TraceCheckUtils]: 43: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,954 INFO L273 TraceCheckUtils]: 44: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,955 INFO L273 TraceCheckUtils]: 45: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,955 INFO L273 TraceCheckUtils]: 46: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,956 INFO L273 TraceCheckUtils]: 48: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,965 INFO L273 TraceCheckUtils]: 49: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:28,968 INFO L273 TraceCheckUtils]: 53: Hoare triple {51803#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {51945#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:28,968 INFO L273 TraceCheckUtils]: 54: Hoare triple {51945#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {51781#false} is VALID [2018-11-23 11:39:28,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {51781#false} assume !false; {51781#false} is VALID [2018-11-23 11:39:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 11:39:28,972 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:28,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:28,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:39:28,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-23 11:39:28,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:28,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:39:29,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:29,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:39:29,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:39:29,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:39:29,014 INFO L87 Difference]: Start difference. First operand 337 states and 410 transitions. Second operand 4 states. [2018-11-23 11:39:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:29,860 INFO L93 Difference]: Finished difference Result 337 states and 410 transitions. [2018-11-23 11:39:29,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:39:29,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-23 11:39:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:39:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 11:39:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:39:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 11:39:29,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2018-11-23 11:39:29,947 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-23 11:39:29,953 INFO L225 Difference]: With dead ends: 337 [2018-11-23 11:39:29,954 INFO L226 Difference]: Without dead ends: 334 [2018-11-23 11:39:29,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:39:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-23 11:39:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2018-11-23 11:39:30,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:30,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:30,869 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:30,869 INFO L87 Difference]: Start difference. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:30,876 INFO L93 Difference]: Finished difference Result 334 states and 400 transitions. [2018-11-23 11:39:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2018-11-23 11:39:30,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:30,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:30,876 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:30,876 INFO L87 Difference]: Start difference. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:30,882 INFO L93 Difference]: Finished difference Result 334 states and 400 transitions. [2018-11-23 11:39:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2018-11-23 11:39:30,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:30,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:30,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:30,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-23 11:39:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 400 transitions. [2018-11-23 11:39:30,888 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 400 transitions. Word has length 56 [2018-11-23 11:39:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:30,888 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 400 transitions. [2018-11-23 11:39:30,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:39:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2018-11-23 11:39:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:39:30,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:30,889 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:30,889 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:30,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:30,889 INFO L82 PathProgramCache]: Analyzing trace with hash 827903808, now seen corresponding path program 2 times [2018-11-23 11:39:30,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:30,890 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 56 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 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:30,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:39:30,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:39:30,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:30,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:31,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {53440#true} call ULTIMATE.init(); {53440#true} is VALID [2018-11-23 11:39:31,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {53440#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {53440#true} is VALID [2018-11-23 11:39:31,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {53440#true} assume true; {53440#true} is VALID [2018-11-23 11:39:31,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53440#true} {53440#true} #181#return; {53440#true} is VALID [2018-11-23 11:39:31,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {53440#true} call #t~ret7 := main(); {53440#true} is VALID [2018-11-23 11:39:31,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {53440#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {53440#true} is VALID [2018-11-23 11:39:31,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {53440#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {53463#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:31,449 INFO L273 TraceCheckUtils]: 7: Hoare triple {53463#(= (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {53463#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:31,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {53463#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {53463#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:31,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {53463#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {53473#(or (and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))) (and (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)) (not (bvsle (_ bv0 32) main_~main__tagbuf_len~0))))} is VALID [2018-11-23 11:39:31,452 INFO L273 TraceCheckUtils]: 10: Hoare triple {53473#(or (and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))) (and (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)) (not (bvsle (_ bv0 32) main_~main__tagbuf_len~0))))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,453 INFO L273 TraceCheckUtils]: 12: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,453 INFO L273 TraceCheckUtils]: 14: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,454 INFO L273 TraceCheckUtils]: 15: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,456 INFO L273 TraceCheckUtils]: 19: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,458 INFO L273 TraceCheckUtils]: 23: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,460 INFO L273 TraceCheckUtils]: 27: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,461 INFO L273 TraceCheckUtils]: 29: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,461 INFO L273 TraceCheckUtils]: 30: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,462 INFO L273 TraceCheckUtils]: 32: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,463 INFO L273 TraceCheckUtils]: 33: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,463 INFO L273 TraceCheckUtils]: 34: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,464 INFO L273 TraceCheckUtils]: 35: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,464 INFO L273 TraceCheckUtils]: 36: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,465 INFO L273 TraceCheckUtils]: 37: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,466 INFO L273 TraceCheckUtils]: 39: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,468 INFO L273 TraceCheckUtils]: 43: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,468 INFO L273 TraceCheckUtils]: 44: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,469 INFO L273 TraceCheckUtils]: 45: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,469 INFO L273 TraceCheckUtils]: 46: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:31,471 INFO L273 TraceCheckUtils]: 48: Hoare triple {53477#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53592#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:39:31,471 INFO L273 TraceCheckUtils]: 49: Hoare triple {53592#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53592#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:39:31,473 INFO L273 TraceCheckUtils]: 50: Hoare triple {53592#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53599#(and (or (and (= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~main__t~0)) (and (not (bvsle (_ bv0 32) main_~main__t~0)) (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:39:31,485 INFO L273 TraceCheckUtils]: 51: Hoare triple {53599#(and (or (and (= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~main__t~0)) (and (not (bvsle (_ bv0 32) main_~main__t~0)) (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53603#(or (and (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)) (exists ((main_~main__tagbuf_len~0 (_ BitVec 32))) (and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0)))) (and (bvsle (_ bv0 32) main_~main__t~0) (exists ((v_prenex_1 (_ BitVec 32))) (and (bvsle (_ bv0 32) v_prenex_1) (bvsle main_~main__t~0 v_prenex_1) (not (= v_prenex_1 main_~main__t~0)))) (= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:31,499 INFO L273 TraceCheckUtils]: 52: Hoare triple {53603#(or (and (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)) (exists ((main_~main__tagbuf_len~0 (_ BitVec 32))) (and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) main_~main__tagbuf_len~0)))) (and (bvsle (_ bv0 32) main_~main__t~0) (exists ((v_prenex_1 (_ BitVec 32))) (and (bvsle (_ bv0 32) v_prenex_1) (bvsle main_~main__t~0 v_prenex_1) (not (= v_prenex_1 main_~main__t~0)))) (= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53607#(and (exists ((v_prenex_1 (_ BitVec 32))) (and (not (= (bvadd v_prenex_1 (_ bv1 32)) main_~main__t~0)) (bvsle (_ bv0 32) v_prenex_1) (bvsle (bvadd main_~main__t~0 (_ bv4294967295 32)) v_prenex_1))) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:39:31,499 INFO L273 TraceCheckUtils]: 53: Hoare triple {53607#(and (exists ((v_prenex_1 (_ BitVec 32))) (and (not (= (bvadd v_prenex_1 (_ bv1 32)) main_~main__t~0)) (bvsle (_ bv0 32) v_prenex_1) (bvsle (bvadd main_~main__t~0 (_ bv4294967295 32)) v_prenex_1))) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4294967295 32))))} assume !(~main__t~0 == ~main__tagbuf_len~0); {53607#(and (exists ((v_prenex_1 (_ BitVec 32))) (and (not (= (bvadd v_prenex_1 (_ bv1 32)) main_~main__t~0)) (bvsle (_ bv0 32) v_prenex_1) (bvsle (bvadd main_~main__t~0 (_ bv4294967295 32)) v_prenex_1))) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:39:31,501 INFO L273 TraceCheckUtils]: 54: Hoare triple {53607#(and (exists ((v_prenex_1 (_ BitVec 32))) (and (not (= (bvadd v_prenex_1 (_ bv1 32)) main_~main__t~0)) (bvsle (_ bv0 32) v_prenex_1) (bvsle (bvadd main_~main__t~0 (_ bv4294967295 32)) v_prenex_1))) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4294967295 32))))} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53614#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:31,502 INFO L273 TraceCheckUtils]: 55: Hoare triple {53614#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {53441#false} is VALID [2018-11-23 11:39:31,502 INFO L273 TraceCheckUtils]: 56: Hoare triple {53441#false} assume !false; {53441#false} is VALID [2018-11-23 11:39:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-23 11:39:31,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:31,876 INFO L273 TraceCheckUtils]: 56: Hoare triple {53441#false} assume !false; {53441#false} is VALID [2018-11-23 11:39:31,876 INFO L273 TraceCheckUtils]: 55: Hoare triple {53624#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {53441#false} is VALID [2018-11-23 11:39:31,877 INFO L273 TraceCheckUtils]: 54: Hoare triple {53628#(bvsle (_ bv0 32) main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53624#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} is VALID [2018-11-23 11:39:31,877 INFO L273 TraceCheckUtils]: 53: Hoare triple {53628#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {53628#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:31,878 INFO L273 TraceCheckUtils]: 52: Hoare triple {53635#(or (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32))))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53628#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:31,880 INFO L273 TraceCheckUtils]: 51: Hoare triple {53639#(or (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32))))} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53635#(or (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32))))} is VALID [2018-11-23 11:39:31,882 INFO L273 TraceCheckUtils]: 50: Hoare triple {53643#(or (not (bvsle (_ bv0 32) main_~main__t~0)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32))))} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53639#(or (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32))))} is VALID [2018-11-23 11:39:31,883 INFO L273 TraceCheckUtils]: 49: Hoare triple {53643#(or (not (bvsle (_ bv0 32) main_~main__t~0)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32))))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53643#(or (not (bvsle (_ bv0 32) main_~main__t~0)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32))))} is VALID [2018-11-23 11:39:31,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53643#(or (not (bvsle (_ bv0 32) main_~main__t~0)) (not (bvsle main_~main__t~0 main_~main__tagbuf_len~0)) (bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32))))} is VALID [2018-11-23 11:39:31,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53440#true} is VALID [2018-11-23 11:39:31,885 INFO L273 TraceCheckUtils]: 46: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {53440#true} is VALID [2018-11-23 11:39:31,885 INFO L273 TraceCheckUtils]: 45: Hoare triple {53440#true} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53440#true} is VALID [2018-11-23 11:39:31,885 INFO L273 TraceCheckUtils]: 44: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {53440#true} is VALID [2018-11-23 11:39:31,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53440#true} is VALID [2018-11-23 11:39:31,885 INFO L273 TraceCheckUtils]: 42: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53440#true} is VALID [2018-11-23 11:39:31,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {53440#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53440#true} is VALID [2018-11-23 11:39:31,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {53440#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53440#true} is VALID [2018-11-23 11:39:31,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53440#true} is VALID [2018-11-23 11:39:31,886 INFO L273 TraceCheckUtils]: 38: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53440#true} is VALID [2018-11-23 11:39:31,886 INFO L273 TraceCheckUtils]: 37: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {53440#true} is VALID [2018-11-23 11:39:31,886 INFO L273 TraceCheckUtils]: 36: Hoare triple {53440#true} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53440#true} is VALID [2018-11-23 11:39:31,886 INFO L273 TraceCheckUtils]: 35: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {53440#true} is VALID [2018-11-23 11:39:31,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53440#true} is VALID [2018-11-23 11:39:31,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53440#true} is VALID [2018-11-23 11:39:31,886 INFO L273 TraceCheckUtils]: 32: Hoare triple {53440#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53440#true} is VALID [2018-11-23 11:39:31,887 INFO L273 TraceCheckUtils]: 31: Hoare triple {53440#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53440#true} is VALID [2018-11-23 11:39:31,887 INFO L273 TraceCheckUtils]: 30: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53440#true} is VALID [2018-11-23 11:39:31,887 INFO L273 TraceCheckUtils]: 29: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53440#true} is VALID [2018-11-23 11:39:31,887 INFO L273 TraceCheckUtils]: 28: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {53440#true} is VALID [2018-11-23 11:39:31,887 INFO L273 TraceCheckUtils]: 27: Hoare triple {53440#true} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53440#true} is VALID [2018-11-23 11:39:31,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {53440#true} is VALID [2018-11-23 11:39:31,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53440#true} is VALID [2018-11-23 11:39:31,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53440#true} is VALID [2018-11-23 11:39:31,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {53440#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53440#true} is VALID [2018-11-23 11:39:31,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {53440#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53440#true} is VALID [2018-11-23 11:39:31,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53440#true} is VALID [2018-11-23 11:39:31,888 INFO L273 TraceCheckUtils]: 20: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53440#true} is VALID [2018-11-23 11:39:31,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {53440#true} is VALID [2018-11-23 11:39:31,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {53440#true} havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {53440#true} is VALID [2018-11-23 11:39:31,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {53440#true} is VALID [2018-11-23 11:39:31,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53440#true} is VALID [2018-11-23 11:39:31,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {53440#true} is VALID [2018-11-23 11:39:31,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {53440#true} assume !(0bv32 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {53440#true} is VALID [2018-11-23 11:39:31,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {53440#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {53440#true} is VALID [2018-11-23 11:39:31,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {53440#true} is VALID [2018-11-23 11:39:31,889 INFO L273 TraceCheckUtils]: 11: Hoare triple {53440#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {53440#true} is VALID [2018-11-23 11:39:31,889 INFO L273 TraceCheckUtils]: 10: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {53440#true} is VALID [2018-11-23 11:39:31,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {53440#true} assume !(0bv32 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(~main__t~0, ~main__tagbuf_len~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {53440#true} is VALID [2018-11-23 11:39:31,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {53440#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvsle32(0bv32, ~main__t~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {53440#true} is VALID [2018-11-23 11:39:31,889 INFO L273 TraceCheckUtils]: 7: Hoare triple {53440#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {53440#true} is VALID [2018-11-23 11:39:31,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {53440#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {53440#true} is VALID [2018-11-23 11:39:31,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {53440#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {53440#true} is VALID [2018-11-23 11:39:31,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {53440#true} call #t~ret7 := main(); {53440#true} is VALID [2018-11-23 11:39:31,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53440#true} {53440#true} #181#return; {53440#true} is VALID [2018-11-23 11:39:31,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {53440#true} assume true; {53440#true} is VALID [2018-11-23 11:39:31,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {53440#true} ~__return_main~0 := 0bv32;~__tmp_259_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {53440#true} is VALID [2018-11-23 11:39:31,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {53440#true} call ULTIMATE.init(); {53440#true} is VALID [2018-11-23 11:39:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-23 11:39:31,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:39:31,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-11-23 11:39:31,894 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-23 11:39:31,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:31,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:39:31,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:31,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:39:31,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:39:31,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:39:31,992 INFO L87 Difference]: Start difference. First operand 334 states and 400 transitions. Second operand 15 states. [2018-11-23 11:39:33,610 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-11-23 11:39:34,206 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-11-23 11:39:34,891 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2018-11-23 11:39:35,545 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-11-23 11:39:36,202 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-11-23 11:39:37,143 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-23 11:39:37,576 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-11-23 11:39:38,056 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33