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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:36:23,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:36:23,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:36:23,106 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:36:23,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:36:23,107 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:36:23,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:36:23,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:36:23,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:36:23,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:36:23,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:36:23,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:36:23,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:36:23,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:36:23,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:36:23,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:36:23,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:36:23,121 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:36:23,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:36:23,124 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:36:23,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:36:23,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:36:23,130 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:36:23,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:36:23,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:36:23,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:36:23,135 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:36:23,139 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:36:23,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:36:23,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:36:23,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:36:23,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:36:23,143 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:36:23,144 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:36:23,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:36:23,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:36:23,147 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:23,170 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:36:23,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:36:23,171 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:36:23,172 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:36:23,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:36:23,173 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:36:23,173 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:36:23,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:36:23,173 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:36:23,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:36:23,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:36:23,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:36:23,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:36:23,174 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:36:23,174 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:36:23,175 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:36:23,177 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:36:23,178 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:36:23,178 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:36:23,178 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:36:23,178 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:36:23,178 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:36:23,179 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:36:23,179 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:36:23,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:36:23,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:36:23,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:36:23,180 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:36:23,180 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:36:23,180 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:36:23,180 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:36:23,181 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:36:23,181 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:36:23,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:36:23,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:36:23,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:36:23,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:36:23,280 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:36:23,280 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+nlh-reducer.c [2018-11-23 11:36:23,337 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a9b22ad/ca0be513691644e095ae5f19711d1b98/FLAGc8b6d5d1f [2018-11-23 11:36:23,793 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:36:23,794 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-23 11:36:23,803 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a9b22ad/ca0be513691644e095ae5f19711d1b98/FLAGc8b6d5d1f [2018-11-23 11:36:24,131 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a9b22ad/ca0be513691644e095ae5f19711d1b98 [2018-11-23 11:36:24,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:36:24,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:36:24,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:24,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:36:24,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:36:24,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:24" (1/1) ... [2018-11-23 11:36:24,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d9d738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:24, skipping insertion in model container [2018-11-23 11:36:24,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:24" (1/1) ... [2018-11-23 11:36:24,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:36:24,209 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:36:24,520 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:24,526 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:36:24,609 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:36:24,626 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:36:24,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:24 WrapperNode [2018-11-23 11:36:24,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:36:24,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:24,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:36:24,628 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:36:24,638 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:24" (1/1) ... [2018-11-23 11:36:24,647 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:24" (1/1) ... [2018-11-23 11:36:24,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:36:24,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:36:24,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:36:24,660 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:36:24,669 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:24" (1/1) ... [2018-11-23 11:36:24,669 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:24" (1/1) ... [2018-11-23 11:36:24,672 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:24" (1/1) ... [2018-11-23 11:36:24,673 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:24" (1/1) ... [2018-11-23 11:36:24,688 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:24" (1/1) ... [2018-11-23 11:36:24,696 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:24" (1/1) ... [2018-11-23 11:36:24,699 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:24" (1/1) ... [2018-11-23 11:36:24,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:36:24,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:36:24,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:36:24,703 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:36:24,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:24" (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:24,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:36:24,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:36:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:36:24,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:36:24,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:36:24,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:36:25,995 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:36:25,995 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:36:25,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:25 BoogieIcfgContainer [2018-11-23 11:36:25,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:36:25,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:36:25,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:36:26,001 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:36:26,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:36:24" (1/3) ... [2018-11-23 11:36:26,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264b2bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:26, skipping insertion in model container [2018-11-23 11:36:26,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:24" (2/3) ... [2018-11-23 11:36:26,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264b2bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:26, skipping insertion in model container [2018-11-23 11:36:26,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:25" (3/3) ... [2018-11-23 11:36:26,005 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-23 11:36:26,013 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:36:26,021 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-23 11:36:26,038 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-23 11:36:26,073 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:36:26,074 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:36:26,074 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:36:26,075 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:36:26,076 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:36:26,076 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:36:26,076 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:36:26,077 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:36:26,077 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:36:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-23 11:36:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:36:26,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:26,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:26,110 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:26,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:26,116 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-11-23 11:36:26,120 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:26,121 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:26,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:26,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:26,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {79#true} is VALID [2018-11-23 11:36:26,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {79#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {79#true} is VALID [2018-11-23 11:36:26,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2018-11-23 11:36:26,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #171#return; {79#true} is VALID [2018-11-23 11:36:26,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {79#true} call #t~ret7 := main(); {79#true} is VALID [2018-11-23 11:36:26,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {79#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {79#true} is VALID [2018-11-23 11:36:26,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {79#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {102#(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:26,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {102#(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; {102#(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:26,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {102#(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; {102#(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:26,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {102#(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; {112#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:26,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {112#(= (bvadd main_~__VERIFIER_assert__cond~13 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~13; {80#false} is VALID [2018-11-23 11:36:26,517 INFO L273 TraceCheckUtils]: 11: Hoare triple {80#false} assume !false; {80#false} is VALID [2018-11-23 11:36:26,521 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:26,522 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 (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:36:26,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:26,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:36:26,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:36:26,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:26,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:36:26,576 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:26,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:36:26,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:36:26,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:36:26,587 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2018-11-23 11:36:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:28,372 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-11-23 11:36:28,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:28,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:36:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2018-11-23 11:36:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2018-11-23 11:36:28,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 172 transitions. [2018-11-23 11:36:28,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:28,789 INFO L225 Difference]: With dead ends: 129 [2018-11-23 11:36:28,789 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 11:36:28,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 11:36:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-23 11:36:28,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:28,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 69 states. [2018-11-23 11:36:28,888 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 69 states. [2018-11-23 11:36:28,888 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 69 states. [2018-11-23 11:36:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:28,898 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-23 11:36:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-23 11:36:28,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:28,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:28,900 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 113 states. [2018-11-23 11:36:28,900 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 113 states. [2018-11-23 11:36:28,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:28,910 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-23 11:36:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-23 11:36:28,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:28,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:28,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:28,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:36:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 11:36:28,919 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-11-23 11:36:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:28,919 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 11:36:28,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:36:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 11:36:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:36:28,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:28,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:28,922 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:28,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:28,922 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-11-23 11:36:28,923 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:28,923 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:28,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:29,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:29,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2018-11-23 11:36:29,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {566#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {566#true} is VALID [2018-11-23 11:36:29,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {566#true} assume true; {566#true} is VALID [2018-11-23 11:36:29,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {566#true} {566#true} #171#return; {566#true} is VALID [2018-11-23 11:36:29,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {566#true} call #t~ret7 := main(); {566#true} is VALID [2018-11-23 11:36:29,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {566#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {566#true} is VALID [2018-11-23 11:36:29,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:29,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {589#(= (_ 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; {589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:29,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {589#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:29,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {589#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {599#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:29,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {599#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {567#false} is VALID [2018-11-23 11:36:29,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {567#false} assume !false; {567#false} is VALID [2018-11-23 11:36:29,306 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:29,307 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:29,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:29,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:36:29,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:36:29,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:29,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:36:29,339 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:29,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:36:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:36:29,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:36:29,340 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-23 11:36:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:29,920 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-23 11:36:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:29,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:36:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2018-11-23 11:36:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2018-11-23 11:36:29,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 119 transitions. [2018-11-23 11:36:30,150 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,155 INFO L225 Difference]: With dead ends: 113 [2018-11-23 11:36:30,155 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 11:36:30,156 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:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 11:36:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2018-11-23 11:36:30,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:30,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 71 states. [2018-11-23 11:36:30,209 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 71 states. [2018-11-23 11:36:30,209 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 71 states. [2018-11-23 11:36:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:30,217 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-23 11:36:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-11-23 11:36:30,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:30,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:30,219 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 111 states. [2018-11-23 11:36:30,219 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 111 states. [2018-11-23 11:36:30,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:30,226 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-23 11:36:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-11-23 11:36:30,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:30,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:30,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:30,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 11:36:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 11:36:30,232 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2018-11-23 11:36:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:30,232 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 11:36:30,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:36:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 11:36:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:36:30,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:30,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:30,234 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:30,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-11-23 11:36:30,235 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:30,235 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:30,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:30,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:30,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1034#true} is VALID [2018-11-23 11:36:30,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {1034#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {1034#true} is VALID [2018-11-23 11:36:30,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-23 11:36:30,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #171#return; {1034#true} is VALID [2018-11-23 11:36:30,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret7 := main(); {1034#true} is VALID [2018-11-23 11:36:30,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {1034#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1034#true} is VALID [2018-11-23 11:36:30,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {1034#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1057#(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:30,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {1057#(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; {1057#(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:30,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {1057#(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);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {1057#(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:30,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {1057#(and (= (_ bv0 32) main_~main__t~0) (bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {1057#(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:30,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {1057#(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; {1070#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:30,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {1070#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {1035#false} is VALID [2018-11-23 11:36:30,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2018-11-23 11:36:30,438 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,439 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:30,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:30,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:36:30,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 11:36:30,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:30,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:36:30,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:30,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:36:30,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:36:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:36:30,473 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 4 states. [2018-11-23 11:36:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:30,992 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-23 11:36:30,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:30,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 11:36:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2018-11-23 11:36:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:36:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2018-11-23 11:36:30,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 117 transitions. [2018-11-23 11:36:31,186 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:31,189 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:36:31,189 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:36:31,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:36:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 72. [2018-11-23 11:36:31,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:31,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 72 states. [2018-11-23 11:36:31,227 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 72 states. [2018-11-23 11:36:31,228 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 72 states. [2018-11-23 11:36:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:31,232 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-23 11:36:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-11-23 11:36:31,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:31,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:31,234 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 109 states. [2018-11-23 11:36:31,234 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 109 states. [2018-11-23 11:36:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:31,239 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-23 11:36:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-11-23 11:36:31,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:31,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:31,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:31,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:36:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-11-23 11:36:31,243 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 13 [2018-11-23 11:36:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:31,244 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-11-23 11:36:31,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:36:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:36:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:36:31,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:31,245 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:31,246 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:31,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:31,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-11-23 11:36:31,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:31,247 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:31,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:31,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:31,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1500#true} is VALID [2018-11-23 11:36:31,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {1500#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {1500#true} is VALID [2018-11-23 11:36:31,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2018-11-23 11:36:31,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #171#return; {1500#true} is VALID [2018-11-23 11:36:31,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {1500#true} call #t~ret7 := main(); {1500#true} is VALID [2018-11-23 11:36:31,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {1500#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1500#true} is VALID [2018-11-23 11:36:31,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {1500#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {1523#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:31,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#(= (_ 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; {1523#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:31,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {1523#(= (_ 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; {1523#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:31,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {1523#(= (_ 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; {1523#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:31,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {1523#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1523#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:31,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {1523#(= (_ 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); {1539#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:31,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {1539#(= (_ 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; {1543#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:31,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {1543#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~14; {1501#false} is VALID [2018-11-23 11:36:31,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {1501#false} assume !false; {1501#false} is VALID [2018-11-23 11:36:31,425 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,425 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:31,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:31,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:31,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:31,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:31,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:31,450 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:31,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:31,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:31,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:31,452 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2018-11-23 11:36:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:32,061 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-11-23 11:36:32,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:32,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-23 11:36:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-23 11:36:32,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2018-11-23 11:36:32,231 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:32,233 INFO L225 Difference]: With dead ends: 124 [2018-11-23 11:36:32,234 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:36:32,234 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:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:36:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 75. [2018-11-23 11:36:32,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:32,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 75 states. [2018-11-23 11:36:32,264 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 75 states. [2018-11-23 11:36:32,265 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 75 states. [2018-11-23 11:36:32,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:32,269 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-23 11:36:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 11:36:32,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:32,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:32,270 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 122 states. [2018-11-23 11:36:32,271 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 122 states. [2018-11-23 11:36:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:32,275 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-23 11:36:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-23 11:36:32,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:32,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:32,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:32,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 11:36:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-23 11:36:32,280 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 15 [2018-11-23 11:36:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:32,280 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-23 11:36:32,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-23 11:36:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:36:32,281 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:32,281 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:32,282 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:32,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-11-23 11:36:32,283 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:32,283 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:32,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:32,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:32,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {2018#true} call ULTIMATE.init(); {2018#true} is VALID [2018-11-23 11:36:32,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {2018#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {2018#true} is VALID [2018-11-23 11:36:32,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {2018#true} assume true; {2018#true} is VALID [2018-11-23 11:36:32,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2018#true} {2018#true} #171#return; {2018#true} is VALID [2018-11-23 11:36:32,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {2018#true} call #t~ret7 := main(); {2018#true} is VALID [2018-11-23 11:36:32,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {2018#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2018#true} is VALID [2018-11-23 11:36:32,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {2018#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {2041#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {2041#(= (_ 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; {2041#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {2041#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {2041#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {2041#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {2041#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {2041#(= (_ 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; {2041#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {2041#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {2057#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:32,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {2057#(= (_ 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; {2061#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:32,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {2061#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {2019#false} is VALID [2018-11-23 11:36:32,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {2019#false} assume !false; {2019#false} is VALID [2018-11-23 11:36:32,472 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:32,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:32,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:32,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:32,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:32,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:32,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:32,507 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:32,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:32,508 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-11-23 11:36:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:33,272 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-23 11:36:33,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:33,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:36:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2018-11-23 11:36:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2018-11-23 11:36:33,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2018-11-23 11:36:33,600 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:33,603 INFO L225 Difference]: With dead ends: 122 [2018-11-23 11:36:33,603 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 11:36:33,604 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:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 11:36:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2018-11-23 11:36:33,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:33,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 77 states. [2018-11-23 11:36:33,628 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 77 states. [2018-11-23 11:36:33,628 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 77 states. [2018-11-23 11:36:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:33,632 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-11-23 11:36:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-11-23 11:36:33,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:33,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:33,633 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 120 states. [2018-11-23 11:36:33,633 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 120 states. [2018-11-23 11:36:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:33,638 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-11-23 11:36:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-11-23 11:36:33,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:33,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:33,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:33,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 11:36:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-11-23 11:36:33,642 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2018-11-23 11:36:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:33,642 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-11-23 11:36:33,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-11-23 11:36:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:33,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:33,643 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:33,644 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:33,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-11-23 11:36:33,645 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:33,645 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:33,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:33,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:33,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {2533#true} call ULTIMATE.init(); {2533#true} is VALID [2018-11-23 11:36:33,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {2533#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {2533#true} is VALID [2018-11-23 11:36:33,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {2533#true} assume true; {2533#true} is VALID [2018-11-23 11:36:33,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2533#true} {2533#true} #171#return; {2533#true} is VALID [2018-11-23 11:36:33,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {2533#true} call #t~ret7 := main(); {2533#true} is VALID [2018-11-23 11:36:33,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {2533#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2533#true} is VALID [2018-11-23 11:36:33,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {2533#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {2556#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {2556#(= (_ 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; {2556#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {2556#(= (_ 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; {2556#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {2556#(= (_ 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; {2556#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {2556#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2556#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {2556#(= (_ 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); {2572#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {2572#(= (_ 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; {2572#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:33,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {2572#(= (_ 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; {2579#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:33,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {2579#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {2534#false} is VALID [2018-11-23 11:36:33,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {2534#false} assume !false; {2534#false} is VALID [2018-11-23 11:36:33,784 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,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:33,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:33,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:33,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:36:33,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:33,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:33,852 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:33,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:33,853 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 5 states. [2018-11-23 11:36:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:34,921 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-11-23 11:36:34,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:34,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 11:36:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2018-11-23 11:36:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2018-11-23 11:36:34,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 181 transitions. [2018-11-23 11:36:35,282 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:35,286 INFO L225 Difference]: With dead ends: 171 [2018-11-23 11:36:35,286 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 11:36:35,287 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:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 11:36:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 79. [2018-11-23 11:36:35,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:35,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 79 states. [2018-11-23 11:36:35,313 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 79 states. [2018-11-23 11:36:35,313 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 79 states. [2018-11-23 11:36:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:35,320 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-11-23 11:36:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2018-11-23 11:36:35,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:35,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:35,321 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 169 states. [2018-11-23 11:36:35,321 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 169 states. [2018-11-23 11:36:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:35,326 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-11-23 11:36:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2018-11-23 11:36:35,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:35,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:35,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:35,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:36:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-11-23 11:36:35,330 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 16 [2018-11-23 11:36:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:35,330 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-23 11:36:35,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-23 11:36:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:35,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:35,331 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:35,332 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:35,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-11-23 11:36:35,333 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:35,333 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:35,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:35,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:35,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {3203#true} call ULTIMATE.init(); {3203#true} is VALID [2018-11-23 11:36:35,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {3203#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {3203#true} is VALID [2018-11-23 11:36:35,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {3203#true} assume true; {3203#true} is VALID [2018-11-23 11:36:35,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3203#true} {3203#true} #171#return; {3203#true} is VALID [2018-11-23 11:36:35,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {3203#true} call #t~ret7 := main(); {3203#true} is VALID [2018-11-23 11:36:35,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {3203#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3203#true} is VALID [2018-11-23 11:36:35,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {3203#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3226#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {3226#(= (_ 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; {3226#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {3226#(= (_ 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; {3226#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {3226#(= (_ 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; {3226#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {3226#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3226#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {3226#(= (_ 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); {3242#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:35,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {3242#(= (_ 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; {3246#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:35,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {3246#(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; {3250#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:35,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {3250#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~15; {3204#false} is VALID [2018-11-23 11:36:35,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {3204#false} assume !false; {3204#false} is VALID [2018-11-23 11:36:35,480 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,480 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:35,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:35,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:35,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:35,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:35,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:35,505 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:35,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:35,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:35,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:35,506 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 6 states. [2018-11-23 11:36:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:36,135 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-11-23 11:36:36,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:36,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2018-11-23 11:36:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2018-11-23 11:36:36,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2018-11-23 11:36:36,395 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:36,397 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:36:36,397 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 11:36:36,398 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:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 11:36:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 78. [2018-11-23 11:36:36,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:36,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 78 states. [2018-11-23 11:36:36,438 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 78 states. [2018-11-23 11:36:36,438 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 78 states. [2018-11-23 11:36:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:36,442 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-11-23 11:36:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-23 11:36:36,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:36,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:36,443 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 114 states. [2018-11-23 11:36:36,443 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 114 states. [2018-11-23 11:36:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:36,447 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-11-23 11:36:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-23 11:36:36,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:36,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:36,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:36,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:36:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-11-23 11:36:36,450 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 16 [2018-11-23 11:36:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:36,451 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-11-23 11:36:36,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-11-23 11:36:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:36:36,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:36,452 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:36,452 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:36,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-11-23 11:36:36,453 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:36,453 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:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:36,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:36,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {3707#true} call ULTIMATE.init(); {3707#true} is VALID [2018-11-23 11:36:36,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {3707#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {3707#true} is VALID [2018-11-23 11:36:36,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {3707#true} assume true; {3707#true} is VALID [2018-11-23 11:36:36,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3707#true} {3707#true} #171#return; {3707#true} is VALID [2018-11-23 11:36:36,586 INFO L256 TraceCheckUtils]: 4: Hoare triple {3707#true} call #t~ret7 := main(); {3707#true} is VALID [2018-11-23 11:36:36,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {3707#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3707#true} is VALID [2018-11-23 11:36:36,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {3707#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {3730#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {3730#(= (_ 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; {3730#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {3730#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {3730#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {3730#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {3730#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {3730#(= (_ 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; {3730#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {3730#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {3746#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:36,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {3746#(= (_ 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; {3750#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:36:36,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {3750#(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; {3754#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:36,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {3754#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~3; {3708#false} is VALID [2018-11-23 11:36:36,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {3708#false} assume !false; {3708#false} is VALID [2018-11-23 11:36:36,635 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:36,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:36,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:36,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:36,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:36,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:36,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:36,656 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:36,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:36,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:36,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:36,656 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 6 states. [2018-11-23 11:36:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:37,281 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-11-23 11:36:37,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:37,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:36:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-23 11:36:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2018-11-23 11:36:37,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 121 transitions. [2018-11-23 11:36:37,442 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:36:37,445 INFO L225 Difference]: With dead ends: 114 [2018-11-23 11:36:37,446 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 11:36:37,446 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:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 11:36:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2018-11-23 11:36:37,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:37,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 77 states. [2018-11-23 11:36:37,675 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 77 states. [2018-11-23 11:36:37,675 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 77 states. [2018-11-23 11:36:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:37,679 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-11-23 11:36:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-11-23 11:36:37,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:37,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:37,680 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 110 states. [2018-11-23 11:36:37,680 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 110 states. [2018-11-23 11:36:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:37,683 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-11-23 11:36:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-11-23 11:36:37,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:37,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:37,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:37,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 11:36:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-23 11:36:37,687 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 16 [2018-11-23 11:36:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:37,687 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-23 11:36:37,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-23 11:36:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:37,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:37,688 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,689 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:37,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1488946805, now seen corresponding path program 1 times [2018-11-23 11:36:37,690 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:37,690 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:37,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:37,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:38,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {4198#true} call ULTIMATE.init(); {4198#true} is VALID [2018-11-23 11:36:38,016 INFO L273 TraceCheckUtils]: 1: Hoare triple {4198#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {4198#true} is VALID [2018-11-23 11:36:38,017 INFO L273 TraceCheckUtils]: 2: Hoare triple {4198#true} assume true; {4198#true} is VALID [2018-11-23 11:36:38,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4198#true} {4198#true} #171#return; {4198#true} is VALID [2018-11-23 11:36:38,017 INFO L256 TraceCheckUtils]: 4: Hoare triple {4198#true} call #t~ret7 := main(); {4198#true} is VALID [2018-11-23 11:36:38,018 INFO L273 TraceCheckUtils]: 5: Hoare triple {4198#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4198#true} is VALID [2018-11-23 11:36:38,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {4198#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {4221#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,033 INFO L273 TraceCheckUtils]: 7: Hoare triple {4221#(= (_ 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; {4221#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,034 INFO L273 TraceCheckUtils]: 8: Hoare triple {4221#(= (_ 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; {4221#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {4221#(= (_ 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; {4221#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {4221#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {4221#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,037 INFO L273 TraceCheckUtils]: 11: Hoare triple {4221#(= (_ 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); {4237#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {4237#(= (_ 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; {4237#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {4237#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {4237#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:38,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {4237#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {4247#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:38,042 INFO L273 TraceCheckUtils]: 15: Hoare triple {4247#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {4199#false} is VALID [2018-11-23 11:36:38,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {4199#false} assume !false; {4199#false} is VALID [2018-11-23 11:36:38,043 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,043 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:38,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:38,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:38,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:38,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:38,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:38,063 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:38,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:38,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:38,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:38,065 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-23 11:36:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:38,667 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-23 11:36:38,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:36:38,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-23 11:36:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-23 11:36:38,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2018-11-23 11:36:38,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:38,851 INFO L225 Difference]: With dead ends: 146 [2018-11-23 11:36:38,851 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 11:36:38,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 11:36:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 79. [2018-11-23 11:36:38,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:38,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 79 states. [2018-11-23 11:36:38,879 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 79 states. [2018-11-23 11:36:38,879 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 79 states. [2018-11-23 11:36:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:38,883 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-11-23 11:36:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-23 11:36:38,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:38,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:38,884 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 144 states. [2018-11-23 11:36:38,884 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 144 states. [2018-11-23 11:36:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:38,886 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-11-23 11:36:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-23 11:36:38,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:38,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:38,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:38,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:36:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-23 11:36:38,888 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 17 [2018-11-23 11:36:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:38,888 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-23 11:36:38,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-23 11:36:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:38,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:38,889 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:38,890 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:38,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:38,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-11-23 11:36:38,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:38,890 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:38,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:38,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:39,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {4798#true} call ULTIMATE.init(); {4798#true} is VALID [2018-11-23 11:36:39,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {4798#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {4798#true} is VALID [2018-11-23 11:36:39,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {4798#true} assume true; {4798#true} is VALID [2018-11-23 11:36:39,378 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4798#true} {4798#true} #171#return; {4798#true} is VALID [2018-11-23 11:36:39,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {4798#true} call #t~ret7 := main(); {4798#true} is VALID [2018-11-23 11:36:39,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {4798#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4798#true} is VALID [2018-11-23 11:36:39,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {4798#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {4821#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:39,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {4821#(= (_ 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; {4825#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:39,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {4825#(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; {4825#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:39,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {4825#(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; {4832#(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:39,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {4832#(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; {4836#(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:39,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {4836#(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); {4840#(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:39,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {4840#(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; {4840#(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:39,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {4840#(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; {4840#(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:39,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {4840#(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; {4850#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:39,387 INFO L273 TraceCheckUtils]: 15: Hoare triple {4850#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~17; {4799#false} is VALID [2018-11-23 11:36:39,387 INFO L273 TraceCheckUtils]: 16: Hoare triple {4799#false} assume !false; {4799#false} is VALID [2018-11-23 11:36:39,389 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:39,389 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:39,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:39,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:36:39,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:36:39,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:39,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:36:39,455 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:39,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:36:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:36:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:39,455 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 8 states. [2018-11-23 11:36:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:41,197 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-23 11:36:41,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:36:41,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:36:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-23 11:36:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2018-11-23 11:36:41,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2018-11-23 11:36:41,448 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:41,450 INFO L225 Difference]: With dead ends: 140 [2018-11-23 11:36:41,450 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 11:36:41,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 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,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 11:36:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 80. [2018-11-23 11:36:41,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:41,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 80 states. [2018-11-23 11:36:41,581 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 80 states. [2018-11-23 11:36:41,581 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 80 states. [2018-11-23 11:36:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:41,585 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 11:36:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-11-23 11:36:41,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:41,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:41,586 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 138 states. [2018-11-23 11:36:41,586 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 138 states. [2018-11-23 11:36:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:41,589 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 11:36:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-11-23 11:36:41,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:41,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:41,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:41,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:36:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-23 11:36:41,591 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 17 [2018-11-23 11:36:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:41,591 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-23 11:36:41,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:36:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-23 11:36:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:41,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:41,592 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:41,593 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:41,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-11-23 11:36:41,594 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:41,594 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:41,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:41,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:41,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {5384#true} call ULTIMATE.init(); {5384#true} is VALID [2018-11-23 11:36:41,761 INFO L273 TraceCheckUtils]: 1: Hoare triple {5384#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {5384#true} is VALID [2018-11-23 11:36:41,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {5384#true} assume true; {5384#true} is VALID [2018-11-23 11:36:41,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5384#true} {5384#true} #171#return; {5384#true} is VALID [2018-11-23 11:36:41,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {5384#true} call #t~ret7 := main(); {5384#true} is VALID [2018-11-23 11:36:41,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {5384#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5384#true} is VALID [2018-11-23 11:36:41,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {5384#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5407#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:41,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {5407#(= (_ 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; {5407#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:41,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {5407#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5407#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:41,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {5407#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {5407#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:41,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {5407#(= (_ 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; {5407#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:41,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {5407#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {5423#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:41,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {5423#(= (_ 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; {5423#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:41,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {5423#(= (_ 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; {5423#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:41,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {5423#(= (_ 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; {5433#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:41,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {5433#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {5385#false} is VALID [2018-11-23 11:36:41,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {5385#false} assume !false; {5385#false} is VALID [2018-11-23 11:36:41,770 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:41,770 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:41,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:41,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:41,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:41,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:41,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:41,799 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:41,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:41,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:41,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:41,800 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2018-11-23 11:36:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:42,934 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-11-23 11:36:42,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:42,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2018-11-23 11:36:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2018-11-23 11:36:42,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 145 transitions. [2018-11-23 11:36:43,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:43,109 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:36:43,109 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 11:36:43,110 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:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 11:36:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2018-11-23 11:36:43,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:43,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 83 states. [2018-11-23 11:36:43,197 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 83 states. [2018-11-23 11:36:43,197 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 83 states. [2018-11-23 11:36:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:43,200 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-11-23 11:36:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-11-23 11:36:43,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:43,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:43,201 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 134 states. [2018-11-23 11:36:43,201 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 134 states. [2018-11-23 11:36:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:43,204 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-11-23 11:36:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-11-23 11:36:43,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:43,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:43,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:43,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:43,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 11:36:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-11-23 11:36:43,207 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 17 [2018-11-23 11:36:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:43,208 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-11-23 11:36:43,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-11-23 11:36:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:36:43,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:43,209 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:43,209 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:43,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:43,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-11-23 11:36:43,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:43,210 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:43,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:43,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:43,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {5956#true} call ULTIMATE.init(); {5956#true} is VALID [2018-11-23 11:36:43,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {5956#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {5956#true} is VALID [2018-11-23 11:36:43,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {5956#true} assume true; {5956#true} is VALID [2018-11-23 11:36:43,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5956#true} {5956#true} #171#return; {5956#true} is VALID [2018-11-23 11:36:43,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {5956#true} call #t~ret7 := main(); {5956#true} is VALID [2018-11-23 11:36:43,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {5956#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5956#true} is VALID [2018-11-23 11:36:43,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {5956#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {5979#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {5979#(= (_ 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; {5979#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {5979#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5979#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {5979#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {5979#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,701 INFO L273 TraceCheckUtils]: 10: Hoare triple {5979#(= (_ 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; {5979#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {5979#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {5995#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {5995#(= (_ 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; {5995#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {5995#(= (_ 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; {5995#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:43,705 INFO L273 TraceCheckUtils]: 14: Hoare triple {5995#(= (_ 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; {6005#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:43,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {6005#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {5957#false} is VALID [2018-11-23 11:36:43,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {5957#false} assume !false; {5957#false} is VALID [2018-11-23 11:36:43,706 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:43,707 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:43,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:43,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:43,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:43,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:43,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:43,729 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:43,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:43,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:43,731 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 5 states. [2018-11-23 11:36:44,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:44,330 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-11-23 11:36:44,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:36:44,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:36:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2018-11-23 11:36:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2018-11-23 11:36:44,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 111 transitions. [2018-11-23 11:36:44,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:44,936 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:36:44,936 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 11:36:44,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 11:36:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2018-11-23 11:36:44,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:44,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 85 states. [2018-11-23 11:36:44,966 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 85 states. [2018-11-23 11:36:44,966 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 85 states. [2018-11-23 11:36:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:44,968 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-23 11:36:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-11-23 11:36:44,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:44,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:44,969 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 102 states. [2018-11-23 11:36:44,969 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 102 states. [2018-11-23 11:36:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:44,971 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-23 11:36:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-11-23 11:36:44,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:44,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:44,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:44,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 11:36:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2018-11-23 11:36:44,974 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 17 [2018-11-23 11:36:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:44,975 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2018-11-23 11:36:44,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-11-23 11:36:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:44,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:44,976 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:44,976 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:44,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-11-23 11:36:44,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:44,977 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:45,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:45,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:45,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {6432#true} call ULTIMATE.init(); {6432#true} is VALID [2018-11-23 11:36:45,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {6432#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {6432#true} is VALID [2018-11-23 11:36:45,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {6432#true} assume true; {6432#true} is VALID [2018-11-23 11:36:45,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6432#true} {6432#true} #171#return; {6432#true} is VALID [2018-11-23 11:36:45,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {6432#true} call #t~ret7 := main(); {6432#true} is VALID [2018-11-23 11:36:45,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {6432#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6432#true} is VALID [2018-11-23 11:36:45,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {6432#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {6455#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:45,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {6455#(= (_ 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; {6459#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:45,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {6459#(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; {6459#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:45,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {6459#(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; {6466#(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:45,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {6466#(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; {6470#(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:45,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {6470#(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); {6474#(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:45,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {6474#(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; {6474#(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:45,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {6474#(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);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {6474#(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:45,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {6474#(and (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_247_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; {6474#(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:45,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {6474#(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~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; {6487#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:45,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {6487#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {6433#false} is VALID [2018-11-23 11:36:45,729 INFO L273 TraceCheckUtils]: 17: Hoare triple {6433#false} assume !false; {6433#false} is VALID [2018-11-23 11:36:45,730 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:45,730 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:45,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:45,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:36:45,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:36:45,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:45,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:36:45,762 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:45,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:36:45,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:36:45,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:45,763 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 8 states. [2018-11-23 11:36:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:47,256 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-11-23 11:36:47,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:36:47,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:36:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2018-11-23 11:36:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:36:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2018-11-23 11:36:47,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 126 transitions. [2018-11-23 11:36:47,397 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:47,398 INFO L225 Difference]: With dead ends: 125 [2018-11-23 11:36:47,399 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 11:36:47,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 11:36:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. [2018-11-23 11:36:47,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:47,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 86 states. [2018-11-23 11:36:47,423 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 86 states. [2018-11-23 11:36:47,424 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 86 states. [2018-11-23 11:36:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:47,426 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-11-23 11:36:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-11-23 11:36:47,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:47,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:47,427 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 123 states. [2018-11-23 11:36:47,427 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 123 states. [2018-11-23 11:36:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:47,430 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-11-23 11:36:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-11-23 11:36:47,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:47,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:47,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:47,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 11:36:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-11-23 11:36:47,432 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 18 [2018-11-23 11:36:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:47,433 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-11-23 11:36:47,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:36:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-11-23 11:36:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:47,433 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:47,433 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:47,434 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:47,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:47,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-11-23 11:36:47,435 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:47,435 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:47,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:47,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:47,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {6981#true} call ULTIMATE.init(); {6981#true} is VALID [2018-11-23 11:36:47,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {6981#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {6981#true} is VALID [2018-11-23 11:36:47,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {6981#true} assume true; {6981#true} is VALID [2018-11-23 11:36:47,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6981#true} {6981#true} #171#return; {6981#true} is VALID [2018-11-23 11:36:47,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {6981#true} call #t~ret7 := main(); {6981#true} is VALID [2018-11-23 11:36:47,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {6981#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6981#true} is VALID [2018-11-23 11:36:47,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {6981#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {7004#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {7004#(= (_ 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; {7004#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {7004#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {7004#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {7004#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {7004#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {7004#(= (_ 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; {7004#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {7004#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7020#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {7020#(= (_ 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; {7020#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {7020#(= (_ 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; {7020#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {7020#(= (_ bv1 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {7020#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:47,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {7020#(= (_ 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; {7033#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:47,600 INFO L273 TraceCheckUtils]: 16: Hoare triple {7033#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {6982#false} is VALID [2018-11-23 11:36:47,600 INFO L273 TraceCheckUtils]: 17: Hoare triple {6982#false} assume !false; {6982#false} is VALID [2018-11-23 11:36:47,601 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:47,601 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:47,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:47,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:36:47,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 11:36:47,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:47,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:36:47,622 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:47,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:36:47,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:36:47,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:36:47,624 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 5 states. [2018-11-23 11:36:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:48,281 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-23 11:36:48,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:48,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 11:36:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2018-11-23 11:36:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:36:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2018-11-23 11:36:48,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 139 transitions. [2018-11-23 11:36:48,428 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:48,431 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:36:48,431 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 11:36:48,432 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:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 11:36:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2018-11-23 11:36:48,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:48,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 88 states. [2018-11-23 11:36:48,481 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 88 states. [2018-11-23 11:36:48,481 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 88 states. [2018-11-23 11:36:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:48,484 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-11-23 11:36:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-23 11:36:48,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:48,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:48,485 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 128 states. [2018-11-23 11:36:48,485 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 128 states. [2018-11-23 11:36:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:48,488 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-11-23 11:36:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-23 11:36:48,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:48,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:48,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:48,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:36:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-11-23 11:36:48,491 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 18 [2018-11-23 11:36:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:48,491 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-11-23 11:36:48,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:36:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-23 11:36:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:48,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:48,492 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:48,493 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:48,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:48,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-11-23 11:36:48,494 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:48,494 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:48,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:48,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:48,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {7544#true} call ULTIMATE.init(); {7544#true} is VALID [2018-11-23 11:36:48,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {7544#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {7544#true} is VALID [2018-11-23 11:36:48,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {7544#true} assume true; {7544#true} is VALID [2018-11-23 11:36:48,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7544#true} {7544#true} #171#return; {7544#true} is VALID [2018-11-23 11:36:48,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {7544#true} call #t~ret7 := main(); {7544#true} is VALID [2018-11-23 11:36:48,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {7544#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {7544#true} is VALID [2018-11-23 11:36:48,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {7544#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {7567#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:48,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {7567#(= (_ 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; {7571#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:48,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {7571#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {7571#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:48,703 INFO L273 TraceCheckUtils]: 9: Hoare triple {7571#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {7571#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:48,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {7571#(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; {7581#(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:48,706 INFO L273 TraceCheckUtils]: 11: Hoare triple {7581#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {7585#(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:48,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {7585#(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; {7585#(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:48,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {7585#(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; {7585#(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:48,709 INFO L273 TraceCheckUtils]: 14: Hoare triple {7585#(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; {7585#(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:48,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {7585#(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; {7598#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:48,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {7598#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {7545#false} is VALID [2018-11-23 11:36:48,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {7545#false} assume !false; {7545#false} is VALID [2018-11-23 11:36:48,712 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:48,712 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:48,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:48,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:48,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:36:48,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:48,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:48,736 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:48,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:48,737 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 7 states. [2018-11-23 11:36:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:49,743 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-23 11:36:49,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:36:49,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:36:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2018-11-23 11:36:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2018-11-23 11:36:49,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2018-11-23 11:36:49,922 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:49,925 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:36:49,925 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 11:36:49,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 11:36:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 89. [2018-11-23 11:36:50,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:50,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 89 states. [2018-11-23 11:36:50,041 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 89 states. [2018-11-23 11:36:50,041 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 89 states. [2018-11-23 11:36:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:50,043 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-11-23 11:36:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-23 11:36:50,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:50,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:50,044 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 128 states. [2018-11-23 11:36:50,044 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 128 states. [2018-11-23 11:36:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:50,046 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-11-23 11:36:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-23 11:36:50,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:50,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:50,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:50,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 11:36:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-11-23 11:36:50,049 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 18 [2018-11-23 11:36:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:50,049 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-11-23 11:36:50,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-11-23 11:36:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:36:50,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:50,050 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:50,050 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:50,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:50,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-11-23 11:36:50,051 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:50,051 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:50,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:50,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:50,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {8109#true} call ULTIMATE.init(); {8109#true} is VALID [2018-11-23 11:36:50,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {8109#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {8109#true} is VALID [2018-11-23 11:36:50,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {8109#true} assume true; {8109#true} is VALID [2018-11-23 11:36:50,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8109#true} {8109#true} #171#return; {8109#true} is VALID [2018-11-23 11:36:50,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {8109#true} call #t~ret7 := main(); {8109#true} is VALID [2018-11-23 11:36:50,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {8109#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8109#true} is VALID [2018-11-23 11:36:50,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {8109#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8132#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:50,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {8132#(= (_ 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; {8136#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:50,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {8136#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {8136#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:50,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {8136#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {8136#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:50,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {8136#(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; {8146#(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:50,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {8146#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8150#(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:50,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {8150#(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; {8150#(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:50,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {8150#(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; {8150#(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:50,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {8150#(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; {8150#(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:50,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {8150#(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; {8163#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:50,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {8163#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {8110#false} is VALID [2018-11-23 11:36:50,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {8110#false} assume !false; {8110#false} is VALID [2018-11-23 11:36:50,282 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:50,282 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:50,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:50,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:50,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:36:50,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:50,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:50,306 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:50,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:50,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:50,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:50,308 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 7 states. [2018-11-23 11:36:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:50,968 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-23 11:36:50,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:36:50,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 11:36:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2018-11-23 11:36:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2018-11-23 11:36:50,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2018-11-23 11:36:51,071 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:51,072 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:36:51,073 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:36:51,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:36:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-11-23 11:36:51,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:51,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 88 states. [2018-11-23 11:36:51,109 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 88 states. [2018-11-23 11:36:51,110 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 88 states. [2018-11-23 11:36:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:51,112 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-11-23 11:36:51,112 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-11-23 11:36:51,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:51,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:51,113 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 91 states. [2018-11-23 11:36:51,113 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 91 states. [2018-11-23 11:36:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:51,115 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-11-23 11:36:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-11-23 11:36:51,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:51,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:51,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:51,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:36:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-11-23 11:36:51,118 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 18 [2018-11-23 11:36:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:51,118 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-11-23 11:36:51,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-11-23 11:36:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:36:51,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:51,119 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:51,121 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:51,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-11-23 11:36:51,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:51,122 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:51,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:51,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:51,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {8562#true} call ULTIMATE.init(); {8562#true} is VALID [2018-11-23 11:36:51,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {8562#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {8562#true} is VALID [2018-11-23 11:36:51,499 INFO L273 TraceCheckUtils]: 2: Hoare triple {8562#true} assume true; {8562#true} is VALID [2018-11-23 11:36:51,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8562#true} {8562#true} #171#return; {8562#true} is VALID [2018-11-23 11:36:51,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {8562#true} call #t~ret7 := main(); {8562#true} is VALID [2018-11-23 11:36:51,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {8562#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {8562#true} is VALID [2018-11-23 11:36:51,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {8562#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {8585#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:51,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {8585#(= (_ 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; {8589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:51,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {8589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {8589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:51,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {8589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {8589#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:36:51,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {8589#(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; {8599#(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:51,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {8599#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {8603#(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:51,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {8603#(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; {8603#(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:51,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {8603#(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; {8603#(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:51,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {8603#(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); {8603#(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:51,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {8603#(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; {8603#(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:51,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {8603#(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; {8619#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:51,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {8619#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {8563#false} is VALID [2018-11-23 11:36:51,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {8563#false} assume !false; {8563#false} is VALID [2018-11-23 11:36: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:36:51,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:51,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:51,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:36:51,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:36:51,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:51,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:36:51,547 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:51,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:36:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:36:51,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:36:51,548 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 7 states. [2018-11-23 11:36:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:52,653 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-11-23 11:36:52,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:36:52,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:36:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2018-11-23 11:36:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:36:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2018-11-23 11:36:52,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 125 transitions. [2018-11-23 11:36:52,846 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:52,849 INFO L225 Difference]: With dead ends: 124 [2018-11-23 11:36:52,849 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:36:52,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:36:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:36:52,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2018-11-23 11:36:52,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:52,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 89 states. [2018-11-23 11:36:52,899 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 89 states. [2018-11-23 11:36:52,900 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 89 states. [2018-11-23 11:36:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:52,901 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-11-23 11:36:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-11-23 11:36:52,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:52,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:52,902 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 122 states. [2018-11-23 11:36:52,902 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 122 states. [2018-11-23 11:36:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:52,903 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-11-23 11:36:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-11-23 11:36:52,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:52,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:52,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:52,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 11:36:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-11-23 11:36:52,905 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 19 [2018-11-23 11:36:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:52,906 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-11-23 11:36:52,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:36:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-11-23 11:36:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:52,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:52,906 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:52,907 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:52,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1211007090, now seen corresponding path program 1 times [2018-11-23 11:36:52,907 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:52,907 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:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:52,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:53,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {9112#true} call ULTIMATE.init(); {9112#true} is VALID [2018-11-23 11:36:53,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {9112#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {9112#true} is VALID [2018-11-23 11:36:53,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {9112#true} assume true; {9112#true} is VALID [2018-11-23 11:36:53,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9112#true} {9112#true} #171#return; {9112#true} is VALID [2018-11-23 11:36:53,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {9112#true} call #t~ret7 := main(); {9112#true} is VALID [2018-11-23 11:36:53,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {9112#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {9112#true} is VALID [2018-11-23 11:36:53,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {9112#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {9135#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {9135#(= (_ 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; {9135#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {9135#(= (_ 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; {9135#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {9135#(= (_ 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; {9135#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {9135#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9135#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {9135#(= (_ 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); {9151#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {9151#(= (_ 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; {9151#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {9151#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9151#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {9151#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {9151#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {9151#(= (_ bv1 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; {9151#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {9151#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {9167#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:53,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {9167#(= (_ 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; {9171#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:53,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {9171#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {9113#false} is VALID [2018-11-23 11:36:53,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {9113#false} assume !false; {9113#false} is VALID [2018-11-23 11:36:53,030 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,030 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:53,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:53,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:53,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:53,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:53,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:53,059 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,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:53,060 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 6 states. [2018-11-23 11:36:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:54,076 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2018-11-23 11:36:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:54,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2018-11-23 11:36:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2018-11-23 11:36:54,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 158 transitions. [2018-11-23 11:36:54,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:54,251 INFO L225 Difference]: With dead ends: 148 [2018-11-23 11:36:54,251 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 11:36:54,251 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,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 11:36:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 91. [2018-11-23 11:36:54,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:54,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 91 states. [2018-11-23 11:36:54,309 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 91 states. [2018-11-23 11:36:54,309 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 91 states. [2018-11-23 11:36:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:54,312 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-11-23 11:36:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-11-23 11:36:54,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:54,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:54,313 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 146 states. [2018-11-23 11:36:54,313 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 146 states. [2018-11-23 11:36:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:54,316 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-11-23 11:36:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-11-23 11:36:54,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:54,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:54,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:54,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 11:36:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-11-23 11:36:54,319 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 20 [2018-11-23 11:36:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:54,319 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-23 11:36:54,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:36:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-11-23 11:36:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:54,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:54,320 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:54,320 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:54,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:54,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1374718285, now seen corresponding path program 1 times [2018-11-23 11:36:54,321 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:54,321 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:54,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:54,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:54,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {9742#true} call ULTIMATE.init(); {9742#true} is VALID [2018-11-23 11:36:54,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {9742#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {9742#true} is VALID [2018-11-23 11:36:54,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {9742#true} assume true; {9742#true} is VALID [2018-11-23 11:36:54,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9742#true} {9742#true} #171#return; {9742#true} is VALID [2018-11-23 11:36:54,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {9742#true} call #t~ret7 := main(); {9742#true} is VALID [2018-11-23 11:36:54,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {9742#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {9742#true} is VALID [2018-11-23 11:36:54,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {9742#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {9765#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {9765#(= (_ 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; {9765#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {9765#(= (_ 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; {9765#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {9765#(= (_ 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; {9765#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {9765#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9765#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {9765#(= (_ 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); {9781#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {9781#(= (_ 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; {9781#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {9781#(= (_ 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; {9781#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {9781#(= (_ 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; {9781#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {9781#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {9781#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {9781#(= (_ 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); {9797#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {9797#(= (_ 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; {9801#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:54,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {9801#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~14; {9743#false} is VALID [2018-11-23 11:36:54,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {9743#false} assume !false; {9743#false} is VALID [2018-11-23 11:36:54,462 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:54,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:36:54,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {9743#false} assume !false; {9743#false} is VALID [2018-11-23 11:36:54,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {9811#(not (= main_~__VERIFIER_assert__cond~14 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~14; {9743#false} is VALID [2018-11-23 11:36:54,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {9815#(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; {9811#(not (= main_~__VERIFIER_assert__cond~14 (_ bv0 32)))} is VALID [2018-11-23 11:36:54,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {9819#(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); {9815#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:54,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {9819#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {9819#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:54,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {9819#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {9819#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:54,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {9819#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {9819#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:54,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {9819#(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; {9819#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:54,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {9835#(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); {9819#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:36:54,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {9835#(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; {9835#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:54,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {9835#(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; {9835#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:54,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {9835#(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; {9835#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:54,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {9835#(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; {9835#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:54,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {9742#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {9835#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:36:54,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {9742#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {9742#true} is VALID [2018-11-23 11:36:54,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {9742#true} call #t~ret7 := main(); {9742#true} is VALID [2018-11-23 11:36:54,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9742#true} {9742#true} #171#return; {9742#true} is VALID [2018-11-23 11:36:54,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {9742#true} assume true; {9742#true} is VALID [2018-11-23 11:36:54,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {9742#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {9742#true} is VALID [2018-11-23 11:36:54,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {9742#true} call ULTIMATE.init(); {9742#true} is VALID [2018-11-23 11:36:54,555 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:54,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:36:54,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:36:54,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 11:36:54,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:54,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:36:54,608 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:54,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:36:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:36:54,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:36:54,609 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 10 states. [2018-11-23 11:36:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:56,269 INFO L93 Difference]: Finished difference Result 314 states and 336 transitions. [2018-11-23 11:36:56,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:36:56,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 11:36:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:36:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 336 transitions. [2018-11-23 11:36:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:36:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 336 transitions. [2018-11-23 11:36:56,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 336 transitions. [2018-11-23 11:36:58,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:58,279 INFO L225 Difference]: With dead ends: 314 [2018-11-23 11:36:58,279 INFO L226 Difference]: Without dead ends: 312 [2018-11-23 11:36:58,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:36:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-23 11:36:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 109. [2018-11-23 11:36:58,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:58,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand 109 states. [2018-11-23 11:36:58,597 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 109 states. [2018-11-23 11:36:58,597 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 109 states. [2018-11-23 11:36:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:58,603 INFO L93 Difference]: Finished difference Result 312 states and 331 transitions. [2018-11-23 11:36:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 331 transitions. [2018-11-23 11:36:58,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:58,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:58,604 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 312 states. [2018-11-23 11:36:58,604 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 312 states. [2018-11-23 11:36:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:58,610 INFO L93 Difference]: Finished difference Result 312 states and 331 transitions. [2018-11-23 11:36:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 331 transitions. [2018-11-23 11:36:58,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:58,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:58,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:58,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 11:36:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2018-11-23 11:36:58,613 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 20 [2018-11-23 11:36:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:58,614 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2018-11-23 11:36:58,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:36:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2018-11-23 11:36:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:36:58,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:58,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] [2018-11-23 11:36:58,615 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:58,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-11-23 11:36:58,616 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:58,616 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:58,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:36:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:58,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:58,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {10978#true} call ULTIMATE.init(); {10978#true} is VALID [2018-11-23 11:36:58,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {10978#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {10978#true} is VALID [2018-11-23 11:36:58,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {10978#true} assume true; {10978#true} is VALID [2018-11-23 11:36:58,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10978#true} {10978#true} #171#return; {10978#true} is VALID [2018-11-23 11:36:58,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {10978#true} call #t~ret7 := main(); {10978#true} is VALID [2018-11-23 11:36:58,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {10978#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {10978#true} is VALID [2018-11-23 11:36:58,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {10978#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {11001#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {11001#(= (_ 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; {11001#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {11001#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {11001#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {11001#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {11001#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {11001#(= (_ 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; {11001#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,909 INFO L273 TraceCheckUtils]: 11: Hoare triple {11001#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11017#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {11017#(= (_ 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; {11017#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,910 INFO L273 TraceCheckUtils]: 13: Hoare triple {11017#(= (_ 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; {11017#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {11017#(= (_ 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; {11017#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {11017#(= (_ 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; {11017#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,912 INFO L273 TraceCheckUtils]: 16: Hoare triple {11017#(= (_ 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); {11033#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:36:58,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {11033#(= (_ 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; {11037#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:36:58,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {11037#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {10979#false} is VALID [2018-11-23 11:36:58,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {10979#false} assume !false; {10979#false} is VALID [2018-11-23 11:36:58,915 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:58,915 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:36:58,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:36:58,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:36:58,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:58,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:58,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:36:58,966 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:58,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:36:58,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:36:58,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:36:58,967 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand 6 states. [2018-11-23 11:36:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:59,944 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2018-11-23 11:36:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:36:59,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:36:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2018-11-23 11:36:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:36:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2018-11-23 11:36:59,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 154 transitions. [2018-11-23 11:37:00,112 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:37:00,115 INFO L225 Difference]: With dead ends: 156 [2018-11-23 11:37:00,116 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 11:37:00,116 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:37:00,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 11:37:00,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 111. [2018-11-23 11:37:00,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:00,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 111 states. [2018-11-23 11:37:00,186 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 111 states. [2018-11-23 11:37:00,186 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 111 states. [2018-11-23 11:37:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:00,188 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-11-23 11:37:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2018-11-23 11:37:00,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:00,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:00,189 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 154 states. [2018-11-23 11:37:00,189 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 154 states. [2018-11-23 11:37:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:00,191 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-11-23 11:37:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2018-11-23 11:37:00,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:00,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:00,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:00,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:37:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2018-11-23 11:37:00,193 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 20 [2018-11-23 11:37:00,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:00,193 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2018-11-23 11:37:00,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:37:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2018-11-23 11:37:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:37:00,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:00,194 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:00,194 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:00,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:00,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1113482793, now seen corresponding path program 1 times [2018-11-23 11:37:00,195 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:00,195 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:37:00,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:00,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:00,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {11658#true} call ULTIMATE.init(); {11658#true} is VALID [2018-11-23 11:37:00,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {11658#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {11658#true} is VALID [2018-11-23 11:37:00,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {11658#true} assume true; {11658#true} is VALID [2018-11-23 11:37:00,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11658#true} {11658#true} #171#return; {11658#true} is VALID [2018-11-23 11:37:00,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {11658#true} call #t~ret7 := main(); {11658#true} is VALID [2018-11-23 11:37:00,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {11658#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {11658#true} is VALID [2018-11-23 11:37:00,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {11658#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {11681#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {11681#(= (_ 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; {11681#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {11681#(= (_ 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; {11681#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {11681#(= (_ 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; {11681#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {11681#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {11681#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {11681#(= (_ 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); {11697#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {11697#(= (_ 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; {11697#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {11697#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {11697#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {11697#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {11697#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {11697#(= (_ bv1 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; {11697#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {11697#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {11713#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:00,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {11713#(= (_ 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; {11717#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:00,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {11717#(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; {11721#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:00,337 INFO L273 TraceCheckUtils]: 19: Hoare triple {11721#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~3; {11659#false} is VALID [2018-11-23 11:37:00,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {11659#false} assume !false; {11659#false} is VALID [2018-11-23 11:37:00,338 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:00,338 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:00,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:00,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:00,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:37:00,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:00,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:00,365 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:00,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:00,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:00,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:00,366 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand 7 states. [2018-11-23 11:37:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:01,435 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-11-23 11:37:01,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:01,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:37:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2018-11-23 11:37:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2018-11-23 11:37:01,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 152 transitions. [2018-11-23 11:37:01,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:01,602 INFO L225 Difference]: With dead ends: 154 [2018-11-23 11:37:01,602 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 11:37:01,602 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:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 11:37:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 110. [2018-11-23 11:37:01,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:01,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 110 states. [2018-11-23 11:37:01,675 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 110 states. [2018-11-23 11:37:01,676 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 110 states. [2018-11-23 11:37:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:01,678 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2018-11-23 11:37:01,679 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-11-23 11:37:01,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:01,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:01,679 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 150 states. [2018-11-23 11:37:01,679 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 150 states. [2018-11-23 11:37:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:01,681 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2018-11-23 11:37:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-11-23 11:37:01,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:01,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:01,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:01,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 11:37:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2018-11-23 11:37:01,683 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 21 [2018-11-23 11:37:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:01,683 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2018-11-23 11:37:01,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2018-11-23 11:37:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:37:01,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:01,684 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:37:01,684 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:01,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash 333839291, now seen corresponding path program 1 times [2018-11-23 11:37:01,685 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:01,685 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:01,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:01,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:01,854 INFO L256 TraceCheckUtils]: 0: Hoare triple {12331#true} call ULTIMATE.init(); {12331#true} is VALID [2018-11-23 11:37:01,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {12331#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {12331#true} is VALID [2018-11-23 11:37:01,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {12331#true} assume true; {12331#true} is VALID [2018-11-23 11:37:01,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12331#true} {12331#true} #171#return; {12331#true} is VALID [2018-11-23 11:37:01,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {12331#true} call #t~ret7 := main(); {12331#true} is VALID [2018-11-23 11:37:01,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {12331#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {12331#true} is VALID [2018-11-23 11:37:01,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {12331#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {12354#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {12354#(= (_ 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; {12354#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {12354#(= (_ 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; {12354#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {12354#(= (_ 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; {12354#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {12354#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {12354#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {12354#(= (_ 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); {12370#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {12370#(= (_ 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; {12370#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,867 INFO L273 TraceCheckUtils]: 13: Hoare triple {12370#(= (_ 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; {12370#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {12370#(= (_ 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; {12370#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {12370#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {12370#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {12370#(= (_ 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); {12386#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {12386#(= (_ 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; {12386#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:01,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {12386#(= (_ 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; {12393#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:01,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {12393#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {12332#false} is VALID [2018-11-23 11:37:01,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {12332#false} assume !false; {12332#false} is VALID [2018-11-23 11:37:01,877 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:37:01,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:02,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {12332#false} assume !false; {12332#false} is VALID [2018-11-23 11:37:02,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {12403#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {12332#false} is VALID [2018-11-23 11:37:02,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {12407#(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; {12403#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} is VALID [2018-11-23 11:37:02,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {12407#(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; {12407#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:02,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {12414#(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); {12407#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:02,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {12414#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {12414#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:02,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {12414#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {12414#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:02,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {12414#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {12414#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:02,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {12414#(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; {12414#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:02,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {12430#(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); {12414#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:02,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {12430#(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; {12430#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:02,129 INFO L273 TraceCheckUtils]: 9: Hoare triple {12430#(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; {12430#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:02,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {12430#(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; {12430#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:02,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {12430#(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; {12430#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:02,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {12331#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {12430#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:02,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {12331#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {12331#true} is VALID [2018-11-23 11:37:02,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {12331#true} call #t~ret7 := main(); {12331#true} is VALID [2018-11-23 11:37:02,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12331#true} {12331#true} #171#return; {12331#true} is VALID [2018-11-23 11:37:02,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {12331#true} assume true; {12331#true} is VALID [2018-11-23 11:37:02,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {12331#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {12331#true} is VALID [2018-11-23 11:37:02,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {12331#true} call ULTIMATE.init(); {12331#true} is VALID [2018-11-23 11:37:02,135 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:37:02,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:02,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:37:02,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-23 11:37:02,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:02,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:02,378 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:37:02,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:02,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:02,378 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 10 states. [2018-11-23 11:37:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,082 INFO L93 Difference]: Finished difference Result 488 states and 521 transitions. [2018-11-23 11:37:05,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:37:05,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-23 11:37:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 521 transitions. [2018-11-23 11:37:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 521 transitions. [2018-11-23 11:37:05,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 521 transitions. [2018-11-23 11:37:05,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:05,784 INFO L225 Difference]: With dead ends: 488 [2018-11-23 11:37:05,785 INFO L226 Difference]: Without dead ends: 486 [2018-11-23 11:37:05,785 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:37:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-23 11:37:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 112. [2018-11-23 11:37:05,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:05,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 486 states. Second operand 112 states. [2018-11-23 11:37:05,856 INFO L74 IsIncluded]: Start isIncluded. First operand 486 states. Second operand 112 states. [2018-11-23 11:37:05,856 INFO L87 Difference]: Start difference. First operand 486 states. Second operand 112 states. [2018-11-23 11:37:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,869 INFO L93 Difference]: Finished difference Result 486 states and 516 transitions. [2018-11-23 11:37:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 516 transitions. [2018-11-23 11:37:05,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:05,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:05,870 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 486 states. [2018-11-23 11:37:05,870 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 486 states. [2018-11-23 11:37:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:05,883 INFO L93 Difference]: Finished difference Result 486 states and 516 transitions. [2018-11-23 11:37:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 516 transitions. [2018-11-23 11:37:05,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:05,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:05,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:05,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 11:37:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2018-11-23 11:37:05,885 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 21 [2018-11-23 11:37:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:05,885 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2018-11-23 11:37:05,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2018-11-23 11:37:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:37:05,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:05,886 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:05,887 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:05,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 333409308, now seen corresponding path program 1 times [2018-11-23 11:37:05,887 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:05,887 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,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:05,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:06,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {14111#true} call ULTIMATE.init(); {14111#true} is VALID [2018-11-23 11:37:06,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {14111#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {14111#true} is VALID [2018-11-23 11:37:06,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {14111#true} assume true; {14111#true} is VALID [2018-11-23 11:37:06,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14111#true} {14111#true} #171#return; {14111#true} is VALID [2018-11-23 11:37:06,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {14111#true} call #t~ret7 := main(); {14111#true} is VALID [2018-11-23 11:37:06,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {14111#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {14111#true} is VALID [2018-11-23 11:37:06,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {14111#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {14134#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {14134#(= (_ 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; {14134#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {14134#(= (_ 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; {14134#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {14134#(= (_ 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; {14134#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {14134#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {14134#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {14134#(= (_ 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); {14150#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {14150#(= (_ 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; {14150#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {14150#(= (_ 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; {14150#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {14150#(= (_ 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; {14150#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {14150#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {14150#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {14150#(= (_ 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); {14166#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:06,163 INFO L273 TraceCheckUtils]: 17: Hoare triple {14166#(= (_ 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; {14170#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:06,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {14170#(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; {14174#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:06,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {14174#(= (bvadd main_~__VERIFIER_assert__cond~15 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~15; {14112#false} is VALID [2018-11-23 11:37:06,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {14112#false} assume !false; {14112#false} is VALID [2018-11-23 11:37:06,166 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:06,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:06,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {14112#false} assume !false; {14112#false} is VALID [2018-11-23 11:37:06,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {14184#(not (= main_~__VERIFIER_assert__cond~15 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~15; {14112#false} is VALID [2018-11-23 11:37:06,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {14188#(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; {14184#(not (= main_~__VERIFIER_assert__cond~15 (_ bv0 32)))} is VALID [2018-11-23 11:37:06,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {14111#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; {14188#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:06,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {14111#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); {14111#true} is VALID [2018-11-23 11:37:06,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {14111#true} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {14111#true} is VALID [2018-11-23 11:37:06,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {14111#true} 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; {14111#true} is VALID [2018-11-23 11:37:06,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {14111#true} 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; {14111#true} is VALID [2018-11-23 11:37:06,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {14111#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; {14111#true} is VALID [2018-11-23 11:37:06,229 INFO L273 TraceCheckUtils]: 11: Hoare triple {14111#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); {14111#true} is VALID [2018-11-23 11:37:06,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {14111#true} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {14111#true} is VALID [2018-11-23 11:37:06,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {14111#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; {14111#true} is VALID [2018-11-23 11:37:06,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {14111#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; {14111#true} is VALID [2018-11-23 11:37:06,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {14111#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; {14111#true} is VALID [2018-11-23 11:37:06,230 INFO L273 TraceCheckUtils]: 6: Hoare triple {14111#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {14111#true} is VALID [2018-11-23 11:37:06,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {14111#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {14111#true} is VALID [2018-11-23 11:37:06,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {14111#true} call #t~ret7 := main(); {14111#true} is VALID [2018-11-23 11:37:06,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14111#true} {14111#true} #171#return; {14111#true} is VALID [2018-11-23 11:37:06,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {14111#true} assume true; {14111#true} is VALID [2018-11-23 11:37:06,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {14111#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {14111#true} is VALID [2018-11-23 11:37:06,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {14111#true} call ULTIMATE.init(); {14111#true} is VALID [2018-11-23 11:37:06,232 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:06,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:37:06,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 11:37:06,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-23 11:37:06,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:06,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:37:06,506 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:06,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:37:06,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:37:06,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:06,507 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand 9 states. [2018-11-23 11:37:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:07,812 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2018-11-23 11:37:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:37:07,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-23 11:37:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2018-11-23 11:37:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2018-11-23 11:37:07,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2018-11-23 11:37:07,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:07,970 INFO L225 Difference]: With dead ends: 148 [2018-11-23 11:37:07,970 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 11:37:07,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 11:37:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2018-11-23 11:37:08,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:08,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 108 states. [2018-11-23 11:37:08,016 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 108 states. [2018-11-23 11:37:08,016 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 108 states. [2018-11-23 11:37:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:08,019 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2018-11-23 11:37:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-11-23 11:37:08,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:08,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:08,019 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 142 states. [2018-11-23 11:37:08,019 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 142 states. [2018-11-23 11:37:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:08,022 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2018-11-23 11:37:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-11-23 11:37:08,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:08,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:08,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:08,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 11:37:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-11-23 11:37:08,025 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 21 [2018-11-23 11:37:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:08,025 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-11-23 11:37:08,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:37:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-11-23 11:37:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:37:08,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:08,026 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,026 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:08,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1724593994, now seen corresponding path program 1 times [2018-11-23 11:37:08,027 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:08,027 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:08,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:08,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:08,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {14830#true} call ULTIMATE.init(); {14830#true} is VALID [2018-11-23 11:37:08,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {14830#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {14830#true} is VALID [2018-11-23 11:37:08,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {14830#true} assume true; {14830#true} is VALID [2018-11-23 11:37:08,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14830#true} {14830#true} #171#return; {14830#true} is VALID [2018-11-23 11:37:08,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {14830#true} call #t~ret7 := main(); {14830#true} is VALID [2018-11-23 11:37:08,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {14830#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {14830#true} is VALID [2018-11-23 11:37:08,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {14830#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {14853#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {14853#(= (_ 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; {14853#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {14853#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {14853#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {14853#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {14853#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {14853#(= (_ 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; {14853#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {14853#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {14869#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {14869#(= (_ 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; {14869#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {14869#(= (_ 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; {14869#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {14869#(= (_ 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; {14869#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {14869#(= (_ 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; {14869#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {14869#(= (_ 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); {14885#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {14885#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {14885#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:08,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {14885#(= (_ 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; {14892#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:08,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {14892#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {14831#false} is VALID [2018-11-23 11:37:08,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {14831#false} assume !false; {14831#false} is VALID [2018-11-23 11:37:08,179 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,179 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:08,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:08,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:37:08,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:37:08,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:08,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:37:08,207 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,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:37:08,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:37:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:37:08,208 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 6 states. [2018-11-23 11:37:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:09,266 INFO L93 Difference]: Finished difference Result 189 states and 208 transitions. [2018-11-23 11:37:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:09,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:37:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2018-11-23 11:37:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2018-11-23 11:37:09,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 190 transitions. [2018-11-23 11:37:09,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:09,474 INFO L225 Difference]: With dead ends: 189 [2018-11-23 11:37:09,474 INFO L226 Difference]: Without dead ends: 187 [2018-11-23 11:37:09,474 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:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-23 11:37:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 113. [2018-11-23 11:37:09,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:09,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 113 states. [2018-11-23 11:37:09,522 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 113 states. [2018-11-23 11:37:09,522 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 113 states. [2018-11-23 11:37:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:09,525 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-11-23 11:37:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 206 transitions. [2018-11-23 11:37:09,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:09,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:09,526 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 187 states. [2018-11-23 11:37:09,526 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 187 states. [2018-11-23 11:37:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:09,529 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-11-23 11:37:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 206 transitions. [2018-11-23 11:37:09,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:09,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:09,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:09,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 11:37:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2018-11-23 11:37:09,532 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 21 [2018-11-23 11:37:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:09,532 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2018-11-23 11:37:09,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:37:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2018-11-23 11:37:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:37:09,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:09,533 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:09,534 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:09,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-11-23 11:37:09,534 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:09,534 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:09,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:09,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:09,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {15621#true} call ULTIMATE.init(); {15621#true} is VALID [2018-11-23 11:37:09,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {15621#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {15621#true} is VALID [2018-11-23 11:37:09,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {15621#true} assume true; {15621#true} is VALID [2018-11-23 11:37:09,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15621#true} {15621#true} #171#return; {15621#true} is VALID [2018-11-23 11:37:09,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {15621#true} call #t~ret7 := main(); {15621#true} is VALID [2018-11-23 11:37:09,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {15621#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {15621#true} is VALID [2018-11-23 11:37:09,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {15621#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {15644#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {15644#(= (_ 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; {15644#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {15644#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {15644#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {15644#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {15644#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {15644#(= (_ 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; {15644#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {15644#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {15660#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {15660#(= (_ 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; {15660#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {15660#(= (_ 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; {15660#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {15660#(= (_ 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; {15660#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {15660#(= (_ 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; {15660#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {15660#(= (_ 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); {15676#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:09,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {15676#(= (_ 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; {15680#(and (= (_ bv2 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:37:09,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {15680#(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; {15684#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:09,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {15684#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {15622#false} is VALID [2018-11-23 11:37:09,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {15622#false} assume !false; {15622#false} is VALID [2018-11-23 11:37:09,726 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:09,726 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:09,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:09,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:09,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:37:09,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:09,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:09,751 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:09,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:09,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:09,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:09,752 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 7 states. [2018-11-23 11:37:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:10,795 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2018-11-23 11:37:10,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:10,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:37:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2018-11-23 11:37:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2018-11-23 11:37:10,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 137 transitions. [2018-11-23 11:37:10,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:10,967 INFO L225 Difference]: With dead ends: 140 [2018-11-23 11:37:10,967 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 11:37:10,968 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:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 11:37:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 112. [2018-11-23 11:37:11,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:11,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 112 states. [2018-11-23 11:37:11,018 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 112 states. [2018-11-23 11:37:11,018 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 112 states. [2018-11-23 11:37:11,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:11,021 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2018-11-23 11:37:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2018-11-23 11:37:11,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:11,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:11,021 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 136 states. [2018-11-23 11:37:11,022 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 136 states. [2018-11-23 11:37:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:11,024 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2018-11-23 11:37:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2018-11-23 11:37:11,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:11,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:11,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:11,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 11:37:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2018-11-23 11:37:11,027 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 21 [2018-11-23 11:37:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:11,027 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2018-11-23 11:37:11,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2018-11-23 11:37:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:11,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:11,028 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:11,029 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:11,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:11,029 INFO L82 PathProgramCache]: Analyzing trace with hash -144005884, now seen corresponding path program 1 times [2018-11-23 11:37:11,029 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:11,029 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:11,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:11,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:11,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {16255#true} call ULTIMATE.init(); {16255#true} is VALID [2018-11-23 11:37:11,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {16255#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {16255#true} is VALID [2018-11-23 11:37:11,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {16255#true} assume true; {16255#true} is VALID [2018-11-23 11:37:11,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16255#true} {16255#true} #171#return; {16255#true} is VALID [2018-11-23 11:37:11,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {16255#true} call #t~ret7 := main(); {16255#true} is VALID [2018-11-23 11:37:11,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {16255#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {16255#true} is VALID [2018-11-23 11:37:11,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {16255#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {16278#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {16278#(= (_ 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; {16278#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {16278#(= (_ 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; {16278#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {16278#(= (_ 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; {16278#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {16278#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {16278#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {16278#(= (_ 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); {16294#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {16294#(= (_ 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; {16294#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {16294#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {16294#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {16294#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {16294#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {16294#(= (_ bv1 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; {16294#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {16294#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {16310#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {16310#(= (_ 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; {16310#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {16310#(= (_ 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; {16310#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:11,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {16310#(= (_ 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; {16320#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:11,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {16320#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {16256#false} is VALID [2018-11-23 11:37:11,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {16256#false} assume !false; {16256#false} is VALID [2018-11-23 11:37:11,195 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:11,195 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:11,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:11,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:37:11,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:37:11,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:11,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:37:11,222 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:11,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:37:11,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:37:11,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:37:11,223 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand 6 states. [2018-11-23 11:37:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:12,193 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2018-11-23 11:37:12,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:12,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:37:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2018-11-23 11:37:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2018-11-23 11:37:12,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 170 transitions. [2018-11-23 11:37:12,423 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:37:12,427 INFO L225 Difference]: With dead ends: 171 [2018-11-23 11:37:12,427 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 11:37:12,428 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:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 11:37:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113. [2018-11-23 11:37:12,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:12,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 113 states. [2018-11-23 11:37:12,479 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 113 states. [2018-11-23 11:37:12,479 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 113 states. [2018-11-23 11:37:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:12,482 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2018-11-23 11:37:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2018-11-23 11:37:12,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:12,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:12,483 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 169 states. [2018-11-23 11:37:12,483 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 169 states. [2018-11-23 11:37:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:12,485 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2018-11-23 11:37:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2018-11-23 11:37:12,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:12,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:12,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:12,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 11:37:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2018-11-23 11:37:12,488 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 22 [2018-11-23 11:37:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:12,488 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2018-11-23 11:37:12,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:37:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2018-11-23 11:37:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:12,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:12,489 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:12,489 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:12,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:12,490 INFO L82 PathProgramCache]: Analyzing trace with hash -142466684, now seen corresponding path program 1 times [2018-11-23 11:37:12,490 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:12,490 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:12,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:12,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:12,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {16994#true} call ULTIMATE.init(); {16994#true} is VALID [2018-11-23 11:37:12,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {16994#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {16994#true} is VALID [2018-11-23 11:37:12,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {16994#true} assume true; {16994#true} is VALID [2018-11-23 11:37:12,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16994#true} {16994#true} #171#return; {16994#true} is VALID [2018-11-23 11:37:12,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {16994#true} call #t~ret7 := main(); {16994#true} is VALID [2018-11-23 11:37:12,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {16994#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {16994#true} is VALID [2018-11-23 11:37:12,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {16994#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {17017#(= (_ 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; {17017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {17017#(= (_ 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; {17017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {17017#(= (_ 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; {17017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {17017#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {17017#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {17017#(= (_ 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); {17033#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {17033#(= (_ 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; {17033#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {17033#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {17033#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {17033#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {17033#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,622 INFO L273 TraceCheckUtils]: 15: Hoare triple {17033#(= (_ bv1 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; {17033#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {17033#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {17049#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {17049#(= (_ 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; {17049#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {17049#(= (_ 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; {17049#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:12,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {17049#(= (_ 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; {17059#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:12,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {17059#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {16995#false} is VALID [2018-11-23 11:37:12,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {16995#false} assume !false; {16995#false} is VALID [2018-11-23 11:37:12,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:37:12,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:12,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:12,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:37:12,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:37:12,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:12,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:37:12,654 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:12,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:37:12,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:37:12,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:37:12,655 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 6 states. [2018-11-23 11:37:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:13,460 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2018-11-23 11:37:13,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:37:13,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:37:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2018-11-23 11:37:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:37:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2018-11-23 11:37:13,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 131 transitions. [2018-11-23 11:37:13,601 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:37:13,603 INFO L225 Difference]: With dead ends: 134 [2018-11-23 11:37:13,603 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 11:37:13,603 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:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 11:37:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-11-23 11:37:13,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:13,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 114 states. [2018-11-23 11:37:13,652 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 114 states. [2018-11-23 11:37:13,652 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 114 states. [2018-11-23 11:37:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:13,655 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-11-23 11:37:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2018-11-23 11:37:13,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:13,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:13,656 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 132 states. [2018-11-23 11:37:13,656 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 132 states. [2018-11-23 11:37:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:13,658 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-11-23 11:37:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2018-11-23 11:37:13,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:13,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:13,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:13,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:37:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2018-11-23 11:37:13,660 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 22 [2018-11-23 11:37:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:13,660 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-11-23 11:37:13,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:37:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2018-11-23 11:37:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:13,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:13,660 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:13,661 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:13,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:13,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1758885050, now seen corresponding path program 1 times [2018-11-23 11:37:13,661 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:13,661 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:13,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:13,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:13,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {17618#true} call ULTIMATE.init(); {17618#true} is VALID [2018-11-23 11:37:13,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {17618#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {17618#true} is VALID [2018-11-23 11:37:13,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {17618#true} assume true; {17618#true} is VALID [2018-11-23 11:37:13,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17618#true} {17618#true} #171#return; {17618#true} is VALID [2018-11-23 11:37:13,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {17618#true} call #t~ret7 := main(); {17618#true} is VALID [2018-11-23 11:37:13,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {17618#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17618#true} is VALID [2018-11-23 11:37:13,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {17618#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17641#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {17641#(= (_ 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#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {17641#(= (_ 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; {17641#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {17641#(= (_ 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; {17641#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {17641#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {17641#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {17641#(= (_ 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); {17657#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {17657#(= (_ 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; {17657#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {17657#(= (_ 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; {17657#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {17657#(= (_ 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; {17657#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {17657#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {17657#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {17657#(= (_ 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#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {17673#(= (_ 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; {17673#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {17673#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {17673#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {17673#(= (_ bv2 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {17683#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:13,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {17683#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {17619#false} is VALID [2018-11-23 11:37:13,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {17619#false} assume !false; {17619#false} is VALID [2018-11-23 11:37:13,798 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:13,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:13,935 INFO L273 TraceCheckUtils]: 21: Hoare triple {17619#false} assume !false; {17619#false} is VALID [2018-11-23 11:37:13,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {17693#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {17619#false} is VALID [2018-11-23 11:37:13,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {17697#(bvsle (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {17693#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-23 11:37:13,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {17697#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {17697#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {17697#(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; {17697#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {17707#(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); {17697#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:13,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {17707#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {17707#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:13,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {17707#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {17707#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:13,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {17707#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {17707#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:13,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {17707#(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; {17707#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:13,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {17723#(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); {17707#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:13,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {17723#(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; {17723#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:13,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {17723#(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; {17723#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:13,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {17723#(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; {17723#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:13,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {17723#(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; {17723#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:13,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {17618#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {17723#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:13,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {17618#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {17618#true} is VALID [2018-11-23 11:37:13,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {17618#true} call #t~ret7 := main(); {17618#true} is VALID [2018-11-23 11:37:13,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17618#true} {17618#true} #171#return; {17618#true} is VALID [2018-11-23 11:37:13,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {17618#true} assume true; {17618#true} is VALID [2018-11-23 11:37:13,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {17618#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {17618#true} is VALID [2018-11-23 11:37:13,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {17618#true} call ULTIMATE.init(); {17618#true} is VALID [2018-11-23 11:37:13,946 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:13,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:13,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:37:13,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 11:37:13,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:13,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:13,993 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:13,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:13,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:13,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:13,994 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 10 states. [2018-11-23 11:37:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:15,847 INFO L93 Difference]: Finished difference Result 299 states and 323 transitions. [2018-11-23 11:37:15,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:37:15,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 11:37:15,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 323 transitions. [2018-11-23 11:37:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 323 transitions. [2018-11-23 11:37:15,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 323 transitions. [2018-11-23 11:37:16,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:16,290 INFO L225 Difference]: With dead ends: 299 [2018-11-23 11:37:16,291 INFO L226 Difference]: Without dead ends: 297 [2018-11-23 11:37:16,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:37:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-23 11:37:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 116. [2018-11-23 11:37:16,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:16,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand 116 states. [2018-11-23 11:37:16,359 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 116 states. [2018-11-23 11:37:16,359 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 116 states. [2018-11-23 11:37:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:16,364 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2018-11-23 11:37:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 318 transitions. [2018-11-23 11:37:16,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:16,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:16,365 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 297 states. [2018-11-23 11:37:16,365 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 297 states. [2018-11-23 11:37:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:16,371 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2018-11-23 11:37:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 318 transitions. [2018-11-23 11:37:16,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:16,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:16,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:16,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 11:37:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2018-11-23 11:37:16,374 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 22 [2018-11-23 11:37:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:16,374 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2018-11-23 11:37:16,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2018-11-23 11:37:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:16,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:16,375 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:16,376 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:16,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:16,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1759086631, now seen corresponding path program 1 times [2018-11-23 11:37:16,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:16,376 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:16,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:16,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:16,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {18836#true} call ULTIMATE.init(); {18836#true} is VALID [2018-11-23 11:37:16,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {18836#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {18836#true} is VALID [2018-11-23 11:37:16,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {18836#true} assume true; {18836#true} is VALID [2018-11-23 11:37:16,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18836#true} {18836#true} #171#return; {18836#true} is VALID [2018-11-23 11:37:16,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {18836#true} call #t~ret7 := main(); {18836#true} is VALID [2018-11-23 11:37:16,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {18836#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {18836#true} is VALID [2018-11-23 11:37:16,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {18836#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {18859#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:16,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {18859#(= (_ 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; {18863#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:16,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {18863#(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; {18863#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:16,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {18863#(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; {18870#(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:16,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {18870#(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; {18874#(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:16,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {18874#(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); {18878#(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:16,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {18878#(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; {18882#(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:16,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {18882#(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; {18882#(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:16,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {18882#(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; {18882#(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:16,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {18882#(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_383_0~0 := ~main____CPAchecker_TMP_0~1; {18882#(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:16,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {18882#(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); {18895#(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:16,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {18895#(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; {18895#(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:16,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {18895#(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; {18895#(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:16,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {18895#(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; {18905#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:16,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {18905#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~17; {18837#false} is VALID [2018-11-23 11:37:16,671 INFO L273 TraceCheckUtils]: 21: Hoare triple {18837#false} assume !false; {18837#false} is VALID [2018-11-23 11:37:16,672 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:16,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:17,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {18837#false} assume !false; {18837#false} is VALID [2018-11-23 11:37:17,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {18915#(not (= main_~__VERIFIER_assert__cond~17 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~17; {18837#false} is VALID [2018-11-23 11:37:17,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {18919#(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; {18915#(not (= main_~__VERIFIER_assert__cond~17 (_ bv0 32)))} is VALID [2018-11-23 11:37:17,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {18919#(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; {18919#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:17,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {18919#(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; {18919#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:17,205 INFO L273 TraceCheckUtils]: 16: Hoare triple {18929#(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); {18919#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:17,205 INFO L273 TraceCheckUtils]: 15: Hoare triple {18929#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {18929#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:17,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {18929#(bvsle (bvadd main_~main__t~0 (_ bv1 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; {18929#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:17,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {18929#(bvsle (bvadd main_~main__t~0 (_ bv1 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; {18929#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:17,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {18942#(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; {18929#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:17,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {18946#(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); {18942#(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:17,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {18950#(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; {18946#(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:17,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {18954#(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; {18950#(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:17,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {18954#(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; {18954#(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:17,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {18836#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; {18954#(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:17,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {18836#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {18836#true} is VALID [2018-11-23 11:37:17,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {18836#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {18836#true} is VALID [2018-11-23 11:37:17,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {18836#true} call #t~ret7 := main(); {18836#true} is VALID [2018-11-23 11:37:17,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18836#true} {18836#true} #171#return; {18836#true} is VALID [2018-11-23 11:37:17,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {18836#true} assume true; {18836#true} is VALID [2018-11-23 11:37:17,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {18836#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {18836#true} is VALID [2018-11-23 11:37:17,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {18836#true} call ULTIMATE.init(); {18836#true} is VALID [2018-11-23 11:37:17,268 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:17,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:17,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-23 11:37:17,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-23 11:37:17,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:17,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:37:17,414 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:17,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:37:17,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:37:17,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:37:17,416 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand 17 states. [2018-11-23 11:37:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:21,877 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2018-11-23 11:37:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:37:21,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-23 11:37:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 164 transitions. [2018-11-23 11:37:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 164 transitions. [2018-11-23 11:37:21,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 164 transitions. [2018-11-23 11:37:22,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:22,221 INFO L225 Difference]: With dead ends: 166 [2018-11-23 11:37:22,221 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 11:37:22,222 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:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 11:37:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2018-11-23 11:37:22,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:22,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 114 states. [2018-11-23 11:37:22,401 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 114 states. [2018-11-23 11:37:22,401 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 114 states. [2018-11-23 11:37:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:22,404 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2018-11-23 11:37:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 179 transitions. [2018-11-23 11:37:22,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:22,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:22,404 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 164 states. [2018-11-23 11:37:22,405 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 164 states. [2018-11-23 11:37:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:22,406 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2018-11-23 11:37:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 179 transitions. [2018-11-23 11:37:22,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:22,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:22,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:22,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:37:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-11-23 11:37:22,408 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 22 [2018-11-23 11:37:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:22,409 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-11-23 11:37:22,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:37:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-11-23 11:37:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:37:22,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:22,409 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,409 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:22,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1922803129, now seen corresponding path program 1 times [2018-11-23 11:37:22,410 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:22,410 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:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:22,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:22,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {19653#true} call ULTIMATE.init(); {19653#true} is VALID [2018-11-23 11:37:22,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {19653#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {19653#true} is VALID [2018-11-23 11:37:22,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {19653#true} assume true; {19653#true} is VALID [2018-11-23 11:37:22,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19653#true} {19653#true} #171#return; {19653#true} is VALID [2018-11-23 11:37:22,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {19653#true} call #t~ret7 := main(); {19653#true} is VALID [2018-11-23 11:37:22,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {19653#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {19653#true} is VALID [2018-11-23 11:37:22,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {19653#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {19676#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:22,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {19676#(= (_ 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; {19680#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:22,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {19680#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {19680#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:22,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {19680#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {19680#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:22,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {19680#(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; {19690#(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:22,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {19690#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {19694#(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:22,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {19694#(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; {19698#(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:22,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {19698#(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; {19698#(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:22,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {19698#(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; {19698#(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:22,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {19698#(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; {19698#(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:22,785 INFO L273 TraceCheckUtils]: 16: Hoare triple {19698#(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); {19711#(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:22,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {19711#(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); {19711#(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:22,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {19711#(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; {19711#(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:22,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {19711#(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; {19721#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:22,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {19721#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {19654#false} is VALID [2018-11-23 11:37:22,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {19654#false} assume !false; {19654#false} is VALID [2018-11-23 11:37:22,790 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,791 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:22,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:22,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:37:22,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:37:22,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:22,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:37:22,822 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:22,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:37:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:37:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:22,823 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 9 states. [2018-11-23 11:37:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:24,265 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2018-11-23 11:37:24,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:37:24,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 11:37:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2018-11-23 11:37:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:37:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2018-11-23 11:37:24,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 140 transitions. [2018-11-23 11:37:24,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:24,428 INFO L225 Difference]: With dead ends: 166 [2018-11-23 11:37:24,428 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 11:37:24,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:37:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 11:37:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 121. [2018-11-23 11:37:24,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:24,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 121 states. [2018-11-23 11:37:24,873 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 121 states. [2018-11-23 11:37:24,873 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 121 states. [2018-11-23 11:37:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:24,875 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2018-11-23 11:37:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 182 transitions. [2018-11-23 11:37:24,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:24,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:24,876 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 164 states. [2018-11-23 11:37:24,876 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 164 states. [2018-11-23 11:37:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:24,878 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2018-11-23 11:37:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 182 transitions. [2018-11-23 11:37:24,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:24,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:24,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:24,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 11:37:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2018-11-23 11:37:24,880 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 22 [2018-11-23 11:37:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:24,881 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2018-11-23 11:37:24,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:37:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2018-11-23 11:37:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:37:24,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:24,881 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:24,882 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:24,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:24,882 INFO L82 PathProgramCache]: Analyzing trace with hash -169212006, now seen corresponding path program 1 times [2018-11-23 11:37:24,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:24,883 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:24,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:24,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:25,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {20393#true} call ULTIMATE.init(); {20393#true} is VALID [2018-11-23 11:37:25,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {20393#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {20393#true} is VALID [2018-11-23 11:37:25,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {20393#true} assume true; {20393#true} is VALID [2018-11-23 11:37:25,146 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20393#true} {20393#true} #171#return; {20393#true} is VALID [2018-11-23 11:37:25,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {20393#true} call #t~ret7 := main(); {20393#true} is VALID [2018-11-23 11:37:25,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {20393#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {20393#true} is VALID [2018-11-23 11:37:25,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {20393#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {20416#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:25,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {20416#(= (_ 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; {20420#(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,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {20420#(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; {20420#(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,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {20420#(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; {20427#(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:25,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {20427#(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; {20431#(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,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {20431#(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); {20435#(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,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {20435#(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; {20439#(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,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {20439#(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);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {20439#(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,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {20439#(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_247_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; {20439#(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,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {20439#(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~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; {20439#(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,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {20439#(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~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {20452#(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,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {20452#(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; {20452#(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,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {20452#(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; {20452#(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,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {20452#(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; {20452#(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,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {20452#(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; {20465#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:25,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {20465#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {20394#false} is VALID [2018-11-23 11:37:25,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {20394#false} assume !false; {20394#false} is VALID [2018-11-23 11:37:25,182 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,182 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:25,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:25,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:37:25,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:37:25,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:25,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:25,214 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:25,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:25,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:25,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:25,215 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand 10 states. [2018-11-23 11:37:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:26,427 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2018-11-23 11:37:26,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:37:26,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:37:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2018-11-23 11:37:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2018-11-23 11:37:26,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 146 transitions. [2018-11-23 11:37:26,597 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:26,601 INFO L225 Difference]: With dead ends: 170 [2018-11-23 11:37:26,601 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 11:37:26,601 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:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 11:37:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 123. [2018-11-23 11:37:26,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:26,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 123 states. [2018-11-23 11:37:26,733 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 123 states. [2018-11-23 11:37:26,733 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 123 states. [2018-11-23 11:37:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:26,735 INFO L93 Difference]: Finished difference Result 168 states and 186 transitions. [2018-11-23 11:37:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2018-11-23 11:37:26,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:26,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:26,736 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 168 states. [2018-11-23 11:37:26,736 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 168 states. [2018-11-23 11:37:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:26,738 INFO L93 Difference]: Finished difference Result 168 states and 186 transitions. [2018-11-23 11:37:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2018-11-23 11:37:26,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:26,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:26,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:26,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 11:37:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2018-11-23 11:37:26,741 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 23 [2018-11-23 11:37:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:26,741 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2018-11-23 11:37:26,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2018-11-23 11:37:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:37:26,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:26,742 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:26,742 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:26,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash -121496756, now seen corresponding path program 1 times [2018-11-23 11:37:26,742 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:26,742 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:26,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:26,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:27,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {21151#true} call ULTIMATE.init(); {21151#true} is VALID [2018-11-23 11:37:27,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {21151#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {21151#true} is VALID [2018-11-23 11:37:27,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {21151#true} assume true; {21151#true} is VALID [2018-11-23 11:37:27,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21151#true} {21151#true} #171#return; {21151#true} is VALID [2018-11-23 11:37:27,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {21151#true} call #t~ret7 := main(); {21151#true} is VALID [2018-11-23 11:37:27,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {21151#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {21151#true} is VALID [2018-11-23 11:37:27,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {21151#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {21174#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:27,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {21174#(= (_ 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; {21178#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:27,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {21178#(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; {21178#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:27,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {21178#(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; {21185#(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:27,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {21185#(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; {21189#(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:27,028 INFO L273 TraceCheckUtils]: 11: Hoare triple {21189#(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); {21193#(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:27,029 INFO L273 TraceCheckUtils]: 12: Hoare triple {21193#(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; {21197#(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:27,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {21197#(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);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {21197#(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:27,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {21197#(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_247_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; {21197#(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:27,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {21197#(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~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; {21197#(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:27,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {21197#(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~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {21210#(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:27,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {21210#(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; {21210#(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:27,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {21210#(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; {21210#(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:27,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {21210#(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; {21210#(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:27,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {21210#(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; {21223#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:27,038 INFO L273 TraceCheckUtils]: 21: Hoare triple {21223#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {21152#false} is VALID [2018-11-23 11:37:27,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {21152#false} assume !false; {21152#false} is VALID [2018-11-23 11:37:27,040 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:27,040 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:27,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:27,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:37:27,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:37:27,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:27,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:27,072 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:27,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:27,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:27,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:27,073 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand 10 states. [2018-11-23 11:37:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:28,581 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2018-11-23 11:37:28,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:28,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:37:28,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2018-11-23 11:37:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2018-11-23 11:37:28,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 109 transitions. [2018-11-23 11:37:28,706 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:37:28,709 INFO L225 Difference]: With dead ends: 135 [2018-11-23 11:37:28,709 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 11:37:28,710 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:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 11:37:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-11-23 11:37:28,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:28,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 123 states. [2018-11-23 11:37:28,838 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 123 states. [2018-11-23 11:37:28,838 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 123 states. [2018-11-23 11:37:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:28,840 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2018-11-23 11:37:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2018-11-23 11:37:28,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:28,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:28,841 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 131 states. [2018-11-23 11:37:28,841 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 131 states. [2018-11-23 11:37:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:28,842 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2018-11-23 11:37:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2018-11-23 11:37:28,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:28,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:28,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:28,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 11:37:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-11-23 11:37:28,844 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 23 [2018-11-23 11:37:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:28,845 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-11-23 11:37:28,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-11-23 11:37:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:37:28,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:28,845 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] [2018-11-23 11:37:28,845 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:28,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1309135233, now seen corresponding path program 1 times [2018-11-23 11:37:28,846 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:28,846 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:28,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:28,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:29,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {21798#true} call ULTIMATE.init(); {21798#true} is VALID [2018-11-23 11:37:29,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {21798#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {21798#true} is VALID [2018-11-23 11:37:29,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {21798#true} assume true; {21798#true} is VALID [2018-11-23 11:37:29,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21798#true} {21798#true} #171#return; {21798#true} is VALID [2018-11-23 11:37:29,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {21798#true} call #t~ret7 := main(); {21798#true} is VALID [2018-11-23 11:37:29,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {21798#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {21798#true} is VALID [2018-11-23 11:37:29,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {21798#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {21821#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:29,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {21821#(= (_ 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; {21825#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:29,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {21825#(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; {21825#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:29,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {21825#(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; {21832#(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:29,123 INFO L273 TraceCheckUtils]: 10: Hoare triple {21832#(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; {21836#(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:29,124 INFO L273 TraceCheckUtils]: 11: Hoare triple {21836#(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); {21840#(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:29,125 INFO L273 TraceCheckUtils]: 12: Hoare triple {21840#(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; {21844#(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:29,125 INFO L273 TraceCheckUtils]: 13: Hoare triple {21844#(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; {21844#(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:29,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {21844#(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; {21844#(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:29,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {21844#(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_383_0~0 := ~main____CPAchecker_TMP_0~1; {21844#(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:29,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {21844#(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); {21857#(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:29,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {21857#(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; {21857#(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:29,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {21857#(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);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {21857#(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:29,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {21857#(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))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {21857#(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:29,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {21857#(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~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; {21870#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:29,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {21870#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {21799#false} is VALID [2018-11-23 11:37:29,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {21799#false} assume !false; {21799#false} is VALID [2018-11-23 11:37:29,135 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:29,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:29,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {21799#false} assume !false; {21799#false} is VALID [2018-11-23 11:37:29,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {21880#(not (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~1; {21799#false} is VALID [2018-11-23 11:37:29,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {21884#(bvsle main_~main__t~0 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; {21880#(not (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))} is VALID [2018-11-23 11:37:29,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {21884#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {21884#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:29,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {21884#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {21884#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:29,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {21884#(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; {21884#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:29,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {21897#(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); {21884#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:29,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {21897#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {21897#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:29,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {21897#(bvsle (bvadd main_~main__t~0 (_ bv1 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; {21897#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:29,599 INFO L273 TraceCheckUtils]: 13: Hoare triple {21897#(bvsle (bvadd main_~main__t~0 (_ bv1 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; {21897#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:29,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {21910#(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; {21897#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:29,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {21914#(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); {21910#(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:29,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {21918#(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; {21914#(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:29,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {21922#(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; {21918#(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:29,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {21922#(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; {21922#(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:29,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {21798#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; {21922#(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:29,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {21798#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {21798#true} is VALID [2018-11-23 11:37:29,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {21798#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {21798#true} is VALID [2018-11-23 11:37:29,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {21798#true} call #t~ret7 := main(); {21798#true} is VALID [2018-11-23 11:37:29,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21798#true} {21798#true} #171#return; {21798#true} is VALID [2018-11-23 11:37:29,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {21798#true} assume true; {21798#true} is VALID [2018-11-23 11:37:29,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {21798#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {21798#true} is VALID [2018-11-23 11:37:29,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {21798#true} call ULTIMATE.init(); {21798#true} is VALID [2018-11-23 11:37:29,661 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:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-23 11:37:29,663 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 11:37:29,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:29,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:37:29,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:29,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:37:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:37:29,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:37:29,780 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 17 states. [2018-11-23 11:37:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:33,970 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2018-11-23 11:37:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:37:33,970 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 11:37:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 122 transitions. [2018-11-23 11:37:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:37:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 122 transitions. [2018-11-23 11:37:33,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 122 transitions. [2018-11-23 11:37:34,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:34,220 INFO L225 Difference]: With dead ends: 135 [2018-11-23 11:37:34,220 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:37:34,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:37:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:37:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2018-11-23 11:37:34,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:34,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 121 states. [2018-11-23 11:37:34,310 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 121 states. [2018-11-23 11:37:34,310 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 121 states. [2018-11-23 11:37:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:34,313 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2018-11-23 11:37:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2018-11-23 11:37:34,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:34,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:34,314 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 133 states. [2018-11-23 11:37:34,314 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 133 states. [2018-11-23 11:37:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:34,316 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2018-11-23 11:37:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2018-11-23 11:37:34,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:34,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:34,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:34,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 11:37:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2018-11-23 11:37:34,318 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 23 [2018-11-23 11:37:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:34,318 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2018-11-23 11:37:34,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:37:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2018-11-23 11:37:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:34,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:34,319 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:34,319 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:34,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash -908273737, now seen corresponding path program 1 times [2018-11-23 11:37:34,320 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:34,320 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:34,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:34,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:34,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {22541#true} call ULTIMATE.init(); {22541#true} is VALID [2018-11-23 11:37:34,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {22541#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {22541#true} is VALID [2018-11-23 11:37:34,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {22541#true} assume true; {22541#true} is VALID [2018-11-23 11:37:34,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22541#true} {22541#true} #171#return; {22541#true} is VALID [2018-11-23 11:37:34,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {22541#true} call #t~ret7 := main(); {22541#true} is VALID [2018-11-23 11:37:34,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {22541#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {22541#true} is VALID [2018-11-23 11:37:34,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {22541#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {22564#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:34,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {22564#(= (_ 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; {22568#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:34,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {22568#(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; {22568#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:34,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {22568#(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; {22575#(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:34,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {22575#(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; {22579#(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:34,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {22579#(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); {22583#(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:34,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {22583#(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; {22587#(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:34,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {22587#(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);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {22587#(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:34,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {22587#(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_247_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; {22587#(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:34,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {22587#(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~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; {22587#(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:34,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {22587#(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~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {22600#(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:34,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {22600#(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; {22600#(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:34,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {22600#(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; {22600#(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:34,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {22600#(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); {22600#(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:34,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {22600#(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; {22600#(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:34,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {22600#(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; {22616#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {22616#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {22542#false} is VALID [2018-11-23 11:37:34,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {22542#false} assume !false; {22542#false} is VALID [2018-11-23 11:37:34,630 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:34,630 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:34,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:34,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:37:34,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 11:37:34,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:34,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:34,674 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:34,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:34,674 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand 10 states. [2018-11-23 11:37:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:36,354 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2018-11-23 11:37:36,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:37:36,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 11:37:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2018-11-23 11:37:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2018-11-23 11:37:36,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 136 transitions. [2018-11-23 11:37:36,538 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:36,540 INFO L225 Difference]: With dead ends: 160 [2018-11-23 11:37:36,540 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 11:37:36,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 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:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 11:37:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 119. [2018-11-23 11:37:36,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:36,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 119 states. [2018-11-23 11:37:36,615 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 119 states. [2018-11-23 11:37:36,616 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 119 states. [2018-11-23 11:37:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:36,619 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2018-11-23 11:37:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-11-23 11:37:36,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:36,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:36,620 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 158 states. [2018-11-23 11:37:36,620 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 158 states. [2018-11-23 11:37:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:36,622 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2018-11-23 11:37:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-11-23 11:37:36,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:36,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:36,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:36,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 11:37:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-11-23 11:37:36,625 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 24 [2018-11-23 11:37:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:36,625 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-11-23 11:37:36,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-11-23 11:37:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:36,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:36,626 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:36,626 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:36,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash -109471765, now seen corresponding path program 1 times [2018-11-23 11:37:36,627 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:36,627 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:36,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:36,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:36,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {23267#true} call ULTIMATE.init(); {23267#true} is VALID [2018-11-23 11:37:36,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {23267#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {23267#true} is VALID [2018-11-23 11:37:36,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {23267#true} assume true; {23267#true} is VALID [2018-11-23 11:37:36,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23267#true} {23267#true} #171#return; {23267#true} is VALID [2018-11-23 11:37:36,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {23267#true} call #t~ret7 := main(); {23267#true} is VALID [2018-11-23 11:37:36,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {23267#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23267#true} is VALID [2018-11-23 11:37:36,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {23267#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23290#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:36,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {23290#(= (_ 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; {23294#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:36,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {23294#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {23294#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:36,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {23294#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {23294#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-23 11:37:36,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {23294#(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; {23304#(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:36,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {23304#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23308#(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:36,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {23308#(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; {23312#(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:36,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {23312#(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; {23312#(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:36,991 INFO L273 TraceCheckUtils]: 14: Hoare triple {23312#(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); {23312#(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:36,991 INFO L273 TraceCheckUtils]: 15: Hoare triple {23312#(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; {23312#(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:36,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {23312#(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; {23312#(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:36,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {23312#(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); {23328#(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:36,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {23328#(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; {23328#(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:36,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {23328#(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; {23328#(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:36,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {23328#(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; {23328#(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:36,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {23328#(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; {23341#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {23341#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {23268#false} is VALID [2018-11-23 11:37:37,000 INFO L273 TraceCheckUtils]: 23: Hoare triple {23268#false} assume !false; {23268#false} is VALID [2018-11-23 11:37:37,002 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:37,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:37,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {23268#false} assume !false; {23268#false} is VALID [2018-11-23 11:37:37,394 INFO L273 TraceCheckUtils]: 22: Hoare triple {23351#(not (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~5; {23268#false} is VALID [2018-11-23 11:37:37,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {23355#(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; {23351#(not (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)))} is VALID [2018-11-23 11:37:37,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {23355#(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; {23355#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:37,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {23355#(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; {23355#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:37,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {23355#(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; {23355#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:37,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {23368#(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); {23355#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:37,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {23368#(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; {23368#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:37,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {23368#(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; {23368#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:37,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {23368#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {23368#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:37,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {23368#(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; {23368#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:37,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {23384#(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; {23368#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:37,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {23388#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {23384#(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:37,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {23392#(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; {23388#(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:37,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {23392#(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))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {23392#(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:37,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {23392#(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);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {23392#(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:37,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {23267#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; {23392#(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:37,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {23267#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {23267#true} is VALID [2018-11-23 11:37:37,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {23267#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {23267#true} is VALID [2018-11-23 11:37:37,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {23267#true} call #t~ret7 := main(); {23267#true} is VALID [2018-11-23 11:37:37,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23267#true} {23267#true} #171#return; {23267#true} is VALID [2018-11-23 11:37:37,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {23267#true} assume true; {23267#true} is VALID [2018-11-23 11:37:37,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {23267#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {23267#true} is VALID [2018-11-23 11:37:37,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {23267#true} call ULTIMATE.init(); {23267#true} is VALID [2018-11-23 11:37:37,468 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:37,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:37,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 11:37:37,470 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 11:37:37,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:37,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:37:37,582 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:37,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:37:37,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:37:37,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:37:37,583 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 15 states. [2018-11-23 11:37:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:42,893 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2018-11-23 11:37:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:37:42,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 11:37:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2018-11-23 11:37:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2018-11-23 11:37:42,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 147 transitions. [2018-11-23 11:37:43,267 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:43,270 INFO L225 Difference]: With dead ends: 155 [2018-11-23 11:37:43,270 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 11:37:43,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:37:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 11:37:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 114. [2018-11-23 11:37:43,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:43,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 114 states. [2018-11-23 11:37:43,407 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 114 states. [2018-11-23 11:37:43,408 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 114 states. [2018-11-23 11:37:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:43,410 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-11-23 11:37:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-11-23 11:37:43,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:43,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:43,411 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 153 states. [2018-11-23 11:37:43,411 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 153 states. [2018-11-23 11:37:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:43,414 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-11-23 11:37:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-11-23 11:37:43,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:43,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:43,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:43,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:37:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-11-23 11:37:43,416 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 24 [2018-11-23 11:37:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:43,416 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-11-23 11:37:43,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:37:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-11-23 11:37:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:43,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:43,417 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:43,417 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:43,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:43,418 INFO L82 PathProgramCache]: Analyzing trace with hash -61756515, now seen corresponding path program 1 times [2018-11-23 11:37:43,418 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:43,418 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:43,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:43,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:43,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {24066#true} call ULTIMATE.init(); {24066#true} is VALID [2018-11-23 11:37:43,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {24066#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {24066#true} is VALID [2018-11-23 11:37:43,675 INFO L273 TraceCheckUtils]: 2: Hoare triple {24066#true} assume true; {24066#true} is VALID [2018-11-23 11:37:43,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24066#true} {24066#true} #171#return; {24066#true} is VALID [2018-11-23 11:37:43,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {24066#true} call #t~ret7 := main(); {24066#true} is VALID [2018-11-23 11:37:43,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {24066#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24066#true} is VALID [2018-11-23 11:37:43,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {24066#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24089#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:43,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {24089#(= (_ 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; {24093#(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,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {24093#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {24093#(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,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {24093#(and (= (_ bv0 32) main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {24093#(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,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {24093#(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; {24103#(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,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {24103#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24107#(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,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {24107#(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; {24111#(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,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {24111#(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; {24111#(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,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {24111#(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); {24111#(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,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {24111#(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; {24111#(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,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {24111#(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; {24111#(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,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {24111#(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); {24127#(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,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {24127#(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; {24127#(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,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {24127#(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; {24127#(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,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {24127#(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; {24127#(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,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {24127#(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; {24140#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:43,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {24140#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {24067#false} is VALID [2018-11-23 11:37:43,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {24067#false} assume !false; {24067#false} is VALID [2018-11-23 11:37:43,691 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,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:44,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {24067#false} assume !false; {24067#false} is VALID [2018-11-23 11:37:44,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {24150#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~11; {24067#false} is VALID [2018-11-23 11:37:44,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {24154#(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; {24150#(not (= main_~__VERIFIER_assert__cond~11 (_ bv0 32)))} is VALID [2018-11-23 11:37:44,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {24154#(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; {24154#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:44,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {24154#(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; {24154#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:44,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {24154#(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; {24154#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:44,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {24167#(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); {24154#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:44,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {24167#(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; {24167#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:44,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {24167#(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; {24167#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:44,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {24167#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {24167#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:44,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {24167#(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; {24167#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:44,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {24183#(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; {24167#(bvsle (bvadd main_~main__t~0 (_ bv1 32)) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:44,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {24187#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24183#(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:44,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {24191#(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; {24187#(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:44,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {24191#(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))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {24191#(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:44,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {24191#(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);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {24191#(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:44,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {24066#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; {24191#(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:44,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {24066#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24066#true} is VALID [2018-11-23 11:37:44,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {24066#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24066#true} is VALID [2018-11-23 11:37:44,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {24066#true} call #t~ret7 := main(); {24066#true} is VALID [2018-11-23 11:37:44,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24066#true} {24066#true} #171#return; {24066#true} is VALID [2018-11-23 11:37:44,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {24066#true} assume true; {24066#true} is VALID [2018-11-23 11:37:44,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {24066#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {24066#true} is VALID [2018-11-23 11:37:44,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {24066#true} call ULTIMATE.init(); {24066#true} is VALID [2018-11-23 11:37:44,385 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:44,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:44,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 11:37:44,387 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 11:37:44,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:44,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:37:44,509 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:44,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:37:44,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:37:44,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:37:44,510 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 15 states. [2018-11-23 11:37:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:47,716 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-11-23 11:37:47,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:37:47,716 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 11:37:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2018-11-23 11:37:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2018-11-23 11:37:47,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2018-11-23 11:37:47,951 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,952 INFO L225 Difference]: With dead ends: 119 [2018-11-23 11:37:47,953 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 11:37:47,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:37:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 11:37:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2018-11-23 11:37:48,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:48,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 107 states. [2018-11-23 11:37:48,160 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 107 states. [2018-11-23 11:37:48,161 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 107 states. [2018-11-23 11:37:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:48,162 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2018-11-23 11:37:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-11-23 11:37:48,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:48,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:48,163 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 114 states. [2018-11-23 11:37:48,163 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 114 states. [2018-11-23 11:37:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:48,165 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2018-11-23 11:37:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-11-23 11:37:48,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:48,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:48,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:48,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 11:37:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-11-23 11:37:48,167 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 24 [2018-11-23 11:37:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:48,168 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-11-23 11:37:48,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:37:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-11-23 11:37:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:37:48,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:48,168 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:48,169 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:48,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash -977838745, now seen corresponding path program 1 times [2018-11-23 11:37:48,169 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:48,169 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:48,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:48,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:48,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {24734#true} call ULTIMATE.init(); {24734#true} is VALID [2018-11-23 11:37:48,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {24734#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {24734#true} is VALID [2018-11-23 11:37:48,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {24734#true} assume true; {24734#true} is VALID [2018-11-23 11:37:48,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24734#true} {24734#true} #171#return; {24734#true} is VALID [2018-11-23 11:37:48,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {24734#true} call #t~ret7 := main(); {24734#true} is VALID [2018-11-23 11:37:48,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {24734#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24734#true} is VALID [2018-11-23 11:37:48,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {24734#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24757#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,647 INFO L273 TraceCheckUtils]: 7: Hoare triple {24757#(= (_ 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; {24757#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {24757#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {24757#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {24757#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {24757#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {24757#(= (_ 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; {24757#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {24757#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24773#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {24773#(= (_ 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; {24773#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {24773#(= (_ 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; {24773#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {24773#(= (_ 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; {24773#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {24773#(= (_ 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; {24773#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {24773#(= (_ 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); {24789#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {24789#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {24789#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {24789#(= (_ 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; {24789#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {24789#(= (_ 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; {24789#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {24789#(= (_ 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); {24802#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,656 INFO L273 TraceCheckUtils]: 21: Hoare triple {24802#(= (_ 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; {24806#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:48,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {24806#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {24735#false} is VALID [2018-11-23 11:37:48,657 INFO L273 TraceCheckUtils]: 23: Hoare triple {24735#false} assume !false; {24735#false} is VALID [2018-11-23 11:37:48,658 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,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:48,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {24735#false} assume !false; {24735#false} is VALID [2018-11-23 11:37:48,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {24816#(not (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {24735#false} is VALID [2018-11-23 11:37:48,762 INFO L273 TraceCheckUtils]: 21: Hoare triple {24820#(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; {24816#(not (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} is VALID [2018-11-23 11:37:48,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {24824#(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); {24820#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:48,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {24824#(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; {24824#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:48,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {24824#(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; {24824#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:48,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {24824#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {24824#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:48,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {24837#(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); {24824#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:48,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {24837#(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; {24837#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {24837#(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; {24837#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {24837#(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; {24837#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {24837#(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; {24837#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {24853#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {24837#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:37:48,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {24853#(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; {24853#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {24853#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {24853#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {24853#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {24853#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {24853#(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; {24853#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {24734#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {24853#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:37:48,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {24734#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {24734#true} is VALID [2018-11-23 11:37:48,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {24734#true} call #t~ret7 := main(); {24734#true} is VALID [2018-11-23 11:37:48,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24734#true} {24734#true} #171#return; {24734#true} is VALID [2018-11-23 11:37:48,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {24734#true} assume true; {24734#true} is VALID [2018-11-23 11:37:48,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {24734#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {24734#true} is VALID [2018-11-23 11:37:48,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {24734#true} call ULTIMATE.init(); {24734#true} is VALID [2018-11-23 11:37:48,775 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,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:48,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:37:48,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-23 11:37:48,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:48,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:37:48,829 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,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:37:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:37:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:48,830 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 12 states. [2018-11-23 11:37:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:51,110 INFO L93 Difference]: Finished difference Result 297 states and 326 transitions. [2018-11-23 11:37:51,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:37:51,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-23 11:37:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:37:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 326 transitions. [2018-11-23 11:37:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:37:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 326 transitions. [2018-11-23 11:37:51,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 326 transitions. [2018-11-23 11:37:51,542 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,549 INFO L225 Difference]: With dead ends: 297 [2018-11-23 11:37:51,549 INFO L226 Difference]: Without dead ends: 295 [2018-11-23 11:37:51,549 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,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-23 11:37:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 165. [2018-11-23 11:37:51,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:51,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand 165 states. [2018-11-23 11:37:51,692 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand 165 states. [2018-11-23 11:37:51,692 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 165 states. [2018-11-23 11:37:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:51,698 INFO L93 Difference]: Finished difference Result 295 states and 320 transitions. [2018-11-23 11:37:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 320 transitions. [2018-11-23 11:37:51,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:51,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:51,699 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 295 states. [2018-11-23 11:37:51,699 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 295 states. [2018-11-23 11:37:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:51,705 INFO L93 Difference]: Finished difference Result 295 states and 320 transitions. [2018-11-23 11:37:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 320 transitions. [2018-11-23 11:37:51,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:51,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:51,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:51,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 11:37:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 213 transitions. [2018-11-23 11:37:51,709 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 213 transitions. Word has length 24 [2018-11-23 11:37:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:51,710 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 213 transitions. [2018-11-23 11:37:51,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:37:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 213 transitions. [2018-11-23 11:37:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:51,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:51,710 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,711 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:51,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 596115965, now seen corresponding path program 1 times [2018-11-23 11:37:51,711 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:51,711 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:51,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:51,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:51,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {26029#true} call ULTIMATE.init(); {26029#true} is VALID [2018-11-23 11:37:51,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {26029#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {26029#true} is VALID [2018-11-23 11:37:51,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {26029#true} assume true; {26029#true} is VALID [2018-11-23 11:37:51,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26029#true} {26029#true} #171#return; {26029#true} is VALID [2018-11-23 11:37:51,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {26029#true} call #t~ret7 := main(); {26029#true} is VALID [2018-11-23 11:37:51,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {26029#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {26029#true} is VALID [2018-11-23 11:37:51,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {26029#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {26052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {26052#(= (_ 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; {26052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {26052#(= (_ 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; {26052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {26052#(= (_ 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; {26052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {26052#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {26052#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {26052#(= (_ 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); {26068#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {26068#(= (_ 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; {26068#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {26068#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {26068#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {26068#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {26068#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {26068#(= (_ bv1 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; {26068#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {26068#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26084#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {26084#(= (_ 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; {26084#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {26084#(= (_ 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; {26084#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {26084#(= (_ 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; {26084#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {26084#(= (_ 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; {26084#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {26084#(= (_ 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); {26100#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:51,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {26100#(= (_ 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; {26104#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:51,873 INFO L273 TraceCheckUtils]: 23: Hoare triple {26104#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {26030#false} is VALID [2018-11-23 11:37:51,873 INFO L273 TraceCheckUtils]: 24: Hoare triple {26030#false} assume !false; {26030#false} is VALID [2018-11-23 11:37:51,874 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,874 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:51,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:51,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:51,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:51,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:51,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:51,907 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,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:51,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:51,908 INFO L87 Difference]: Start difference. First operand 165 states and 213 transitions. Second operand 7 states. [2018-11-23 11:37:53,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:53,321 INFO L93 Difference]: Finished difference Result 184 states and 226 transitions. [2018-11-23 11:37:53,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:37:53,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:37:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2018-11-23 11:37:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2018-11-23 11:37:53,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 146 transitions. [2018-11-23 11:37:53,492 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,496 INFO L225 Difference]: With dead ends: 184 [2018-11-23 11:37:53,496 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 11:37:53,496 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,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 11:37:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 166. [2018-11-23 11:37:53,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:53,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 166 states. [2018-11-23 11:37:53,639 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 166 states. [2018-11-23 11:37:53,639 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 166 states. [2018-11-23 11:37:53,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:53,642 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2018-11-23 11:37:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-11-23 11:37:53,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:53,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:53,642 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 182 states. [2018-11-23 11:37:53,643 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 182 states. [2018-11-23 11:37:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:53,645 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2018-11-23 11:37:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-11-23 11:37:53,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:53,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:53,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:53,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 11:37:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2018-11-23 11:37:53,648 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 25 [2018-11-23 11:37:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:53,648 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2018-11-23 11:37:53,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2018-11-23 11:37:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:37:53,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:53,648 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,649 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:53,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:53,649 INFO L82 PathProgramCache]: Analyzing trace with hash -248226942, now seen corresponding path program 1 times [2018-11-23 11:37:53,649 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:53,649 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:53,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:53,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:53,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {26894#true} call ULTIMATE.init(); {26894#true} is VALID [2018-11-23 11:37:53,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {26894#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {26894#true} is VALID [2018-11-23 11:37:53,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {26894#true} assume true; {26894#true} is VALID [2018-11-23 11:37:53,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26894#true} {26894#true} #171#return; {26894#true} is VALID [2018-11-23 11:37:53,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {26894#true} call #t~ret7 := main(); {26894#true} is VALID [2018-11-23 11:37:53,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {26894#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {26894#true} is VALID [2018-11-23 11:37:53,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {26894#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {26917#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {26917#(= (_ 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; {26917#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {26917#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {26917#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {26917#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {26917#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {26917#(= (_ 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; {26917#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {26917#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26933#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {26933#(= (_ 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; {26933#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {26933#(= (_ 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; {26933#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {26933#(= (_ 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; {26933#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {26933#(= (_ 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; {26933#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {26933#(= (_ 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); {26949#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {26949#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {26949#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {26949#(= (_ 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; {26949#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,826 INFO L273 TraceCheckUtils]: 19: Hoare triple {26949#(= (_ 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; {26949#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,826 INFO L273 TraceCheckUtils]: 20: Hoare triple {26949#(= (_ 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); {26962#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:53,827 INFO L273 TraceCheckUtils]: 21: Hoare triple {26962#(= (_ 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; {26966#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:53,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {26966#(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; {26970#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:53,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {26970#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~3; {26895#false} is VALID [2018-11-23 11:37:53,829 INFO L273 TraceCheckUtils]: 24: Hoare triple {26895#false} assume !false; {26895#false} is VALID [2018-11-23 11:37:53,830 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,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:53,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {26895#false} assume !false; {26895#false} is VALID [2018-11-23 11:37:53,884 INFO L273 TraceCheckUtils]: 23: Hoare triple {26980#(not (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~3; {26895#false} is VALID [2018-11-23 11:37:53,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {26984#(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; {26980#(not (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)))} is VALID [2018-11-23 11:37:53,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {26894#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; {26984#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:37:53,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {26894#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26894#true} is VALID [2018-11-23 11:37:53,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {26894#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; {26894#true} is VALID [2018-11-23 11:37:53,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {26894#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; {26894#true} is VALID [2018-11-23 11:37:53,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {26894#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {26894#true} is VALID [2018-11-23 11:37:53,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {26894#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26894#true} is VALID [2018-11-23 11:37:53,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {26894#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; {26894#true} is VALID [2018-11-23 11:37:53,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {26894#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; {26894#true} is VALID [2018-11-23 11:37:53,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {26894#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {26894#true} is VALID [2018-11-23 11:37:53,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {26894#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; {26894#true} is VALID [2018-11-23 11:37:53,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {26894#true} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {26894#true} is VALID [2018-11-23 11:37:53,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {26894#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; {26894#true} is VALID [2018-11-23 11:37:53,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {26894#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {26894#true} is VALID [2018-11-23 11:37:53,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {26894#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {26894#true} is VALID [2018-11-23 11:37:53,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {26894#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; {26894#true} is VALID [2018-11-23 11:37:53,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {26894#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {26894#true} is VALID [2018-11-23 11:37:53,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {26894#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {26894#true} is VALID [2018-11-23 11:37:53,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {26894#true} call #t~ret7 := main(); {26894#true} is VALID [2018-11-23 11:37:53,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26894#true} {26894#true} #171#return; {26894#true} is VALID [2018-11-23 11:37:53,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {26894#true} assume true; {26894#true} is VALID [2018-11-23 11:37:53,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {26894#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {26894#true} is VALID [2018-11-23 11:37:53,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {26894#true} call ULTIMATE.init(); {26894#true} is VALID [2018-11-23 11:37:53,889 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,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:37:53,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-23 11:37:53,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 11:37:53,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:53,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:53,940 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,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:53,941 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand 10 states. [2018-11-23 11:37:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:55,553 INFO L93 Difference]: Finished difference Result 180 states and 223 transitions. [2018-11-23 11:37:55,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:55,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 11:37:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2018-11-23 11:37:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2018-11-23 11:37:55,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 143 transitions. [2018-11-23 11:37:55,725 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,729 INFO L225 Difference]: With dead ends: 180 [2018-11-23 11:37:55,729 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 11:37:55,729 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,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 11:37:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 162. [2018-11-23 11:37:55,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:55,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 162 states. [2018-11-23 11:37:55,880 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 162 states. [2018-11-23 11:37:55,880 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 162 states. [2018-11-23 11:37:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:55,883 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-11-23 11:37:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 212 transitions. [2018-11-23 11:37:55,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:55,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:55,883 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 174 states. [2018-11-23 11:37:55,883 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 174 states. [2018-11-23 11:37:55,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:55,885 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-11-23 11:37:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 212 transitions. [2018-11-23 11:37:55,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:55,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:55,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:55,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:37:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2018-11-23 11:37:55,888 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 25 [2018-11-23 11:37:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:55,889 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2018-11-23 11:37:55,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2018-11-23 11:37:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:37:55,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:55,889 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,889 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:55,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:55,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1300155852, now seen corresponding path program 1 times [2018-11-23 11:37:55,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:55,890 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:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:55,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:56,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {27818#true} call ULTIMATE.init(); {27818#true} is VALID [2018-11-23 11:37:56,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {27818#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {27818#true} is VALID [2018-11-23 11:37:56,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {27818#true} assume true; {27818#true} is VALID [2018-11-23 11:37:56,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27818#true} {27818#true} #171#return; {27818#true} is VALID [2018-11-23 11:37:56,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {27818#true} call #t~ret7 := main(); {27818#true} is VALID [2018-11-23 11:37:56,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {27818#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {27818#true} is VALID [2018-11-23 11:37:56,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {27818#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {27841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {27841#(= (_ 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; {27841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {27841#(= (_ 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; {27841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,027 INFO L273 TraceCheckUtils]: 9: Hoare triple {27841#(= (_ 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; {27841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {27841#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {27841#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,028 INFO L273 TraceCheckUtils]: 11: Hoare triple {27841#(= (_ 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); {27857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,028 INFO L273 TraceCheckUtils]: 12: Hoare triple {27857#(= (_ 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; {27857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {27857#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {27857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,029 INFO L273 TraceCheckUtils]: 14: Hoare triple {27857#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {27857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,029 INFO L273 TraceCheckUtils]: 15: Hoare triple {27857#(= (_ bv1 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; {27857#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,030 INFO L273 TraceCheckUtils]: 16: Hoare triple {27857#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {27873#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,031 INFO L273 TraceCheckUtils]: 17: Hoare triple {27873#(= (_ 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; {27873#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {27873#(= (_ 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; {27873#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,032 INFO L273 TraceCheckUtils]: 19: Hoare triple {27873#(= (_ 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; {27873#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,032 INFO L273 TraceCheckUtils]: 20: Hoare triple {27873#(= (_ 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; {27873#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {27873#(= (_ 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); {27889#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,034 INFO L273 TraceCheckUtils]: 22: Hoare triple {27889#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {27889#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:56,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {27889#(= (_ 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; {27896#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:56,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {27896#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {27819#false} is VALID [2018-11-23 11:37:56,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {27819#false} assume !false; {27819#false} is VALID [2018-11-23 11:37:56,036 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:56,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:56,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:56,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:37:56,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 11:37:56,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:56,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:37:56,069 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:56,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:37:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:37:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:37:56,070 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand 7 states. [2018-11-23 11:37:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:57,547 INFO L93 Difference]: Finished difference Result 219 states and 264 transitions. [2018-11-23 11:37:57,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:37:57,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 11:37:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2018-11-23 11:37:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:37:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2018-11-23 11:37:57,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 186 transitions. [2018-11-23 11:37:57,777 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,781 INFO L225 Difference]: With dead ends: 219 [2018-11-23 11:37:57,781 INFO L226 Difference]: Without dead ends: 217 [2018-11-23 11:37:57,782 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,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-23 11:37:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 162. [2018-11-23 11:37:58,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:58,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 162 states. [2018-11-23 11:37:58,013 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 162 states. [2018-11-23 11:37:58,014 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 162 states. [2018-11-23 11:37:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:58,018 INFO L93 Difference]: Finished difference Result 217 states and 262 transitions. [2018-11-23 11:37:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2018-11-23 11:37:58,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:58,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:58,019 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 217 states. [2018-11-23 11:37:58,019 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 217 states. [2018-11-23 11:37:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:58,022 INFO L93 Difference]: Finished difference Result 217 states and 262 transitions. [2018-11-23 11:37:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2018-11-23 11:37:58,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:58,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:58,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:58,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:37:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2018-11-23 11:37:58,026 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 26 [2018-11-23 11:37:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:58,026 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2018-11-23 11:37:58,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:37:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2018-11-23 11:37:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:37:58,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:58,027 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:58,027 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:58,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:58,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1299728848, now seen corresponding path program 1 times [2018-11-23 11:37:58,028 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:58,028 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:58,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:58,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:58,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {28798#true} call ULTIMATE.init(); {28798#true} is VALID [2018-11-23 11:37:58,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {28798#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {28798#true} is VALID [2018-11-23 11:37:58,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {28798#true} assume true; {28798#true} is VALID [2018-11-23 11:37:58,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28798#true} {28798#true} #171#return; {28798#true} is VALID [2018-11-23 11:37:58,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {28798#true} call #t~ret7 := main(); {28798#true} is VALID [2018-11-23 11:37:58,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {28798#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {28798#true} is VALID [2018-11-23 11:37:58,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {28798#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {28821#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {28821#(= (_ 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; {28821#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {28821#(= (_ 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; {28821#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {28821#(= (_ 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; {28821#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {28821#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {28821#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {28821#(= (_ 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); {28837#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {28837#(= (_ 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; {28837#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {28837#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {28837#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {28837#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {28837#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {28837#(= (_ bv1 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; {28837#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {28837#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {28853#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {28853#(= (_ 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; {28853#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {28853#(= (_ 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; {28853#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {28853#(= (_ 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; {28853#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {28853#(= (_ 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; {28853#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {28853#(= (_ 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); {28869#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:37:58,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {28869#(= (_ 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; {28873#(and (= main_~main__tagbuf_len~0 main_~main__t~0) (= (_ bv3 32) main_~main__t~0))} is VALID [2018-11-23 11:37:58,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {28873#(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; {28877#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:58,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {28877#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {28799#false} is VALID [2018-11-23 11:37:58,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {28799#false} assume !false; {28799#false} is VALID [2018-11-23 11:37:58,349 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,349 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:58,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:58,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:37:58,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 11:37:58,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:58,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:37:58,395 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,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:37:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:37:58,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:37:58,396 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand 8 states. [2018-11-23 11:37:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:59,756 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2018-11-23 11:37:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:59,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 11:37:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2018-11-23 11:37:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:37:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2018-11-23 11:37:59,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 135 transitions. [2018-11-23 11:37:59,918 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,921 INFO L225 Difference]: With dead ends: 172 [2018-11-23 11:37:59,921 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 11:37:59,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:37:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 11:38:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2018-11-23 11:38:00,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:00,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 161 states. [2018-11-23 11:38:00,104 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 161 states. [2018-11-23 11:38:00,104 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 161 states. [2018-11-23 11:38:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:00,107 INFO L93 Difference]: Finished difference Result 168 states and 206 transitions. [2018-11-23 11:38:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2018-11-23 11:38:00,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:00,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:00,108 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 168 states. [2018-11-23 11:38:00,108 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 168 states. [2018-11-23 11:38:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:00,111 INFO L93 Difference]: Finished difference Result 168 states and 206 transitions. [2018-11-23 11:38:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2018-11-23 11:38:00,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:00,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:00,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:00,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-23 11:38:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 202 transitions. [2018-11-23 11:38:00,114 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 202 transitions. Word has length 26 [2018-11-23 11:38:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:00,114 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 202 transitions. [2018-11-23 11:38:00,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:38:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 202 transitions. [2018-11-23 11:38:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:38:00,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:00,115 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:38:00,115 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:00,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:00,116 INFO L82 PathProgramCache]: Analyzing trace with hash 909121721, now seen corresponding path program 1 times [2018-11-23 11:38:00,116 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:00,116 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:00,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:00,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:00,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {29622#true} call ULTIMATE.init(); {29622#true} is VALID [2018-11-23 11:38:00,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {29622#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {29622#true} is VALID [2018-11-23 11:38:00,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {29622#true} assume true; {29622#true} is VALID [2018-11-23 11:38:00,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29622#true} {29622#true} #171#return; {29622#true} is VALID [2018-11-23 11:38:00,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {29622#true} call #t~ret7 := main(); {29622#true} is VALID [2018-11-23 11:38:00,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {29622#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {29622#true} is VALID [2018-11-23 11:38:00,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {29622#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {29645#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {29645#(= (_ 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; {29645#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {29645#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {29645#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {29645#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {29645#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {29645#(= (_ 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; {29645#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {29645#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29661#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {29661#(= (_ 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; {29661#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {29661#(= (_ 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; {29661#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {29661#(= (_ 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; {29661#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {29661#(= (_ 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; {29661#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {29661#(= (_ 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); {29677#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {29677#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {29677#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {29677#(= (_ 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; {29677#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {29677#(= (_ 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; {29677#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {29677#(= (_ 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); {29690#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {29690#(= (_ 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; {29690#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {29690#(= (_ 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; {29690#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {29690#(= (_ 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; {29700#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:00,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {29700#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {29623#false} is VALID [2018-11-23 11:38:00,306 INFO L273 TraceCheckUtils]: 25: Hoare triple {29623#false} assume !false; {29623#false} is VALID [2018-11-23 11:38:00,307 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,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:00,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {29623#false} assume !false; {29623#false} is VALID [2018-11-23 11:38:00,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {29710#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {29623#false} is VALID [2018-11-23 11:38:00,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {29714#(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; {29710#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} is VALID [2018-11-23 11:38:00,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {29714#(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; {29714#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,416 INFO L273 TraceCheckUtils]: 21: Hoare triple {29714#(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; {29714#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {29724#(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); {29714#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:00,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {29724#(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; {29724#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:00,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {29724#(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; {29724#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:00,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {29724#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {29724#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:00,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {29737#(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); {29724#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:00,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {29737#(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; {29737#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {29737#(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; {29737#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {29737#(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; {29737#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {29737#(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; {29737#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {29753#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {29737#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:00,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {29753#(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; {29753#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {29753#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {29753#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {29753#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {29753#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {29753#(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; {29753#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {29622#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {29753#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:00,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {29622#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {29622#true} is VALID [2018-11-23 11:38:00,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {29622#true} call #t~ret7 := main(); {29622#true} is VALID [2018-11-23 11:38:00,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29622#true} {29622#true} #171#return; {29622#true} is VALID [2018-11-23 11:38:00,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {29622#true} assume true; {29622#true} is VALID [2018-11-23 11:38:00,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {29622#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {29622#true} is VALID [2018-11-23 11:38:00,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {29622#true} call ULTIMATE.init(); {29622#true} is VALID [2018-11-23 11:38:00,431 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,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:00,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:38:00,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:38:00,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:00,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:38:00,494 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,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:38:00,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:38:00,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:00,495 INFO L87 Difference]: Start difference. First operand 161 states and 202 transitions. Second operand 12 states. [2018-11-23 11:38:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:03,538 INFO L93 Difference]: Finished difference Result 368 states and 411 transitions. [2018-11-23 11:38:03,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:38:03,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:38:03,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 411 transitions. [2018-11-23 11:38:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 411 transitions. [2018-11-23 11:38:03,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 411 transitions. [2018-11-23 11:38:04,100 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:04,108 INFO L225 Difference]: With dead ends: 368 [2018-11-23 11:38:04,108 INFO L226 Difference]: Without dead ends: 366 [2018-11-23 11:38:04,109 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:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-23 11:38:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 164. [2018-11-23 11:38:04,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:04,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand 164 states. [2018-11-23 11:38:04,285 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand 164 states. [2018-11-23 11:38:04,285 INFO L87 Difference]: Start difference. First operand 366 states. Second operand 164 states. [2018-11-23 11:38:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:04,291 INFO L93 Difference]: Finished difference Result 366 states and 405 transitions. [2018-11-23 11:38:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 405 transitions. [2018-11-23 11:38:04,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:04,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:04,292 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 366 states. [2018-11-23 11:38:04,292 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 366 states. [2018-11-23 11:38:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:04,298 INFO L93 Difference]: Finished difference Result 366 states and 405 transitions. [2018-11-23 11:38:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 405 transitions. [2018-11-23 11:38:04,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:04,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:04,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:04,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 11:38:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2018-11-23 11:38:04,301 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 26 [2018-11-23 11:38:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:04,301 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2018-11-23 11:38:04,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2018-11-23 11:38:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:38:04,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:04,301 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:04,302 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:04,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash 910660921, now seen corresponding path program 1 times [2018-11-23 11:38:04,302 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:04,302 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:04,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:04,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:04,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {31160#true} call ULTIMATE.init(); {31160#true} is VALID [2018-11-23 11:38:04,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {31160#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {31160#true} is VALID [2018-11-23 11:38:04,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {31160#true} assume true; {31160#true} is VALID [2018-11-23 11:38:04,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31160#true} {31160#true} #171#return; {31160#true} is VALID [2018-11-23 11:38:04,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {31160#true} call #t~ret7 := main(); {31160#true} is VALID [2018-11-23 11:38:04,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {31160#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {31160#true} is VALID [2018-11-23 11:38:04,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {31160#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {31183#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {31183#(= (_ 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; {31183#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {31183#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {31183#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {31183#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {31183#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {31183#(= (_ 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; {31183#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {31183#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31199#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {31199#(= (_ 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; {31199#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {31199#(= (_ 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; {31199#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {31199#(= (_ 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; {31199#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {31199#(= (_ 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; {31199#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,481 INFO L273 TraceCheckUtils]: 16: Hoare triple {31199#(= (_ 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); {31215#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,481 INFO L273 TraceCheckUtils]: 17: Hoare triple {31215#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {31215#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {31215#(= (_ 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; {31215#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,482 INFO L273 TraceCheckUtils]: 19: Hoare triple {31215#(= (_ 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; {31215#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,483 INFO L273 TraceCheckUtils]: 20: Hoare triple {31215#(= (_ 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); {31228#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {31228#(= (_ 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; {31228#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {31228#(= (_ 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; {31228#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {31228#(= (_ 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; {31238#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:04,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {31238#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {31161#false} is VALID [2018-11-23 11:38:04,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {31161#false} assume !false; {31161#false} is VALID [2018-11-23 11:38:04,487 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,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:04,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {31161#false} assume !false; {31161#false} is VALID [2018-11-23 11:38:04,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {31248#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {31161#false} is VALID [2018-11-23 11:38:04,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {31252#(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; {31248#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} is VALID [2018-11-23 11:38:04,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {31252#(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; {31252#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {31252#(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; {31252#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {31262#(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); {31252#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:04,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {31262#(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; {31262#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:04,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {31262#(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; {31262#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:04,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {31262#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {31262#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:04,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {31275#(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); {31262#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:04,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {31275#(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; {31275#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {31275#(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; {31275#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {31275#(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; {31275#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {31275#(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; {31275#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {31291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {31275#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:04,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {31291#(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; {31291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {31291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {31291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {31291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {31291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {31291#(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; {31291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {31160#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {31291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:04,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {31160#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {31160#true} is VALID [2018-11-23 11:38:04,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {31160#true} call #t~ret7 := main(); {31160#true} is VALID [2018-11-23 11:38:04,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31160#true} {31160#true} #171#return; {31160#true} is VALID [2018-11-23 11:38:04,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {31160#true} assume true; {31160#true} is VALID [2018-11-23 11:38:04,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {31160#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {31160#true} is VALID [2018-11-23 11:38:04,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {31160#true} call ULTIMATE.init(); {31160#true} is VALID [2018-11-23 11:38:04,597 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,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:04,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:38:04,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:38:04,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:04,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:38:04,660 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,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:38:04,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:38:04,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:04,661 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand 12 states. [2018-11-23 11:38:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:06,886 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2018-11-23 11:38:06,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:38:06,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 11:38:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 275 transitions. [2018-11-23 11:38:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 275 transitions. [2018-11-23 11:38:06,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 275 transitions. [2018-11-23 11:38:07,255 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,261 INFO L225 Difference]: With dead ends: 246 [2018-11-23 11:38:07,261 INFO L226 Difference]: Without dead ends: 239 [2018-11-23 11:38:07,262 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,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-23 11:38:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 165. [2018-11-23 11:38:07,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:07,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 165 states. [2018-11-23 11:38:07,441 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 165 states. [2018-11-23 11:38:07,441 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 165 states. [2018-11-23 11:38:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:07,445 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2018-11-23 11:38:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 264 transitions. [2018-11-23 11:38:07,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:07,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:07,446 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 239 states. [2018-11-23 11:38:07,446 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 239 states. [2018-11-23 11:38:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:07,449 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2018-11-23 11:38:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 264 transitions. [2018-11-23 11:38:07,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:07,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:07,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:07,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 11:38:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2018-11-23 11:38:07,452 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 26 [2018-11-23 11:38:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:07,452 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2018-11-23 11:38:07,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2018-11-23 11:38:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:38:07,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:07,453 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,453 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:07,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1650128881, now seen corresponding path program 1 times [2018-11-23 11:38:07,454 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:07,454 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:07,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:07,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:07,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {32304#true} call ULTIMATE.init(); {32304#true} is VALID [2018-11-23 11:38:07,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {32304#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {32304#true} is VALID [2018-11-23 11:38:07,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {32304#true} assume true; {32304#true} is VALID [2018-11-23 11:38:07,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32304#true} {32304#true} #171#return; {32304#true} is VALID [2018-11-23 11:38:07,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {32304#true} call #t~ret7 := main(); {32304#true} is VALID [2018-11-23 11:38:07,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {32304#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {32304#true} is VALID [2018-11-23 11:38:07,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {32304#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {32327#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:07,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {32327#(= (_ 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; {32327#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:07,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {32327#(= (_ 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; {32327#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:07,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {32327#(= (_ 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; {32337#(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,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {32337#(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; {32341#(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,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {32341#(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); {32345#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {32345#(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; {32345#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {32345#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {32345#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {32345#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {32345#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {32345#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 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; {32345#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:07,823 INFO L273 TraceCheckUtils]: 16: Hoare triple {32345#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {32361#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:07,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {32361#(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; {32365#(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,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {32365#(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; {32365#(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,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {32365#(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; {32365#(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,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {32365#(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; {32375#(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,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {32375#(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); {32379#(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,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {32379#(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); {32383#(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,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {32383#(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; {32383#(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,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {32383#(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; {32390#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:07,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {32390#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {32305#false} is VALID [2018-11-23 11:38:07,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {32305#false} assume !false; {32305#false} is VALID [2018-11-23 11:38:07,837 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,837 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:07,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:07,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 11:38:07,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 11:38:07,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:07,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:38:07,874 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,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:38:07,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:38:07,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:07,875 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,304 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,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2018-11-23 11:38:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:10,306 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,460 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,464 INFO L225 Difference]: With dead ends: 189 [2018-11-23 11:38:10,464 INFO L226 Difference]: Without dead ends: 187 [2018-11-23 11:38:10,464 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,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-23 11:38:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 168. [2018-11-23 11:38:10,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:10,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 168 states. [2018-11-23 11:38:10,653 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 168 states. [2018-11-23 11:38:10,653 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 168 states. [2018-11-23 11:38:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:10,657 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2018-11-23 11:38:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2018-11-23 11:38:10,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:10,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:10,658 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 187 states. [2018-11-23 11:38:10,658 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 187 states. [2018-11-23 11:38:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:10,660 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2018-11-23 11:38:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2018-11-23 11:38:10,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:10,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:10,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:10,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 11:38:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2018-11-23 11:38:10,663 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 27 [2018-11-23 11:38:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:10,663 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2018-11-23 11:38:10,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2018-11-23 11:38:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:38:10,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:10,664 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,664 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:10,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1830040108, now seen corresponding path program 1 times [2018-11-23 11:38:10,664 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:10,664 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:10,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:10,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:11,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {33204#true} call ULTIMATE.init(); {33204#true} is VALID [2018-11-23 11:38:11,016 INFO L273 TraceCheckUtils]: 1: Hoare triple {33204#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {33204#true} is VALID [2018-11-23 11:38:11,017 INFO L273 TraceCheckUtils]: 2: Hoare triple {33204#true} assume true; {33204#true} is VALID [2018-11-23 11:38:11,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33204#true} {33204#true} #171#return; {33204#true} is VALID [2018-11-23 11:38:11,017 INFO L256 TraceCheckUtils]: 4: Hoare triple {33204#true} call #t~ret7 := main(); {33204#true} is VALID [2018-11-23 11:38:11,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {33204#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {33204#true} is VALID [2018-11-23 11:38:11,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {33204#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {33227#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:11,018 INFO L273 TraceCheckUtils]: 7: Hoare triple {33227#(= (_ 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; {33227#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:11,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {33227#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {33227#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:11,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {33227#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {33227#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:11,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {33227#(= (_ 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; {33240#(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,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {33240#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33244#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {33244#(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; {33244#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {33244#(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; {33244#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {33244#(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; {33244#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {33244#(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; {33244#(and (bvsle (_ bv0 32) main_~main__tagbuf_len~0) (= (_ bv1 32) main_~main__t~0))} is VALID [2018-11-23 11:38:11,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {33244#(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); {33260#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} is VALID [2018-11-23 11:38:11,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {33260#(and (= (_ bv2 32) main_~main__t~0) (bvsle (_ bv0 32) main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0); {33264#(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,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {33264#(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; {33264#(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,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {33264#(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; {33271#(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,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {33271#(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); {33275#(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,031 INFO L273 TraceCheckUtils]: 21: Hoare triple {33275#(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; {33279#(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,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {33279#(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; {33279#(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,032 INFO L273 TraceCheckUtils]: 23: Hoare triple {33279#(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); {33279#(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,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {33279#(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; {33279#(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,033 INFO L273 TraceCheckUtils]: 25: Hoare triple {33279#(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; {33292#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:11,034 INFO L273 TraceCheckUtils]: 26: Hoare triple {33292#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {33205#false} is VALID [2018-11-23 11:38:11,034 INFO L273 TraceCheckUtils]: 27: Hoare triple {33205#false} assume !false; {33205#false} is VALID [2018-11-23 11:38:11,036 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,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:11,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {33205#false} assume !false; {33205#false} is VALID [2018-11-23 11:38:11,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {33302#(not (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~9; {33205#false} is VALID [2018-11-23 11:38:11,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {33306#(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; {33302#(not (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} is VALID [2018-11-23 11:38:11,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {33306#(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; {33306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {33306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {33306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {33306#(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; {33306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,274 INFO L273 TraceCheckUtils]: 21: Hoare triple {33306#(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; {33306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,275 INFO L273 TraceCheckUtils]: 20: Hoare triple {33322#(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); {33306#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:11,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {33326#(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; {33322#(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,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {33326#(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; {33326#(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,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {33204#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {33326#(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,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {33204#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33204#true} is VALID [2018-11-23 11:38:11,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {33204#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; {33204#true} is VALID [2018-11-23 11:38:11,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {33204#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; {33204#true} is VALID [2018-11-23 11:38:11,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {33204#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {33204#true} is VALID [2018-11-23 11:38:11,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {33204#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; {33204#true} is VALID [2018-11-23 11:38:11,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {33204#true} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {33204#true} is VALID [2018-11-23 11:38:11,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {33204#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; {33204#true} is VALID [2018-11-23 11:38:11,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {33204#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {33204#true} is VALID [2018-11-23 11:38:11,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {33204#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {33204#true} is VALID [2018-11-23 11:38:11,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {33204#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; {33204#true} is VALID [2018-11-23 11:38:11,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {33204#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {33204#true} is VALID [2018-11-23 11:38:11,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {33204#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {33204#true} is VALID [2018-11-23 11:38:11,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {33204#true} call #t~ret7 := main(); {33204#true} is VALID [2018-11-23 11:38:11,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33204#true} {33204#true} #171#return; {33204#true} is VALID [2018-11-23 11:38:11,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {33204#true} assume true; {33204#true} is VALID [2018-11-23 11:38:11,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {33204#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {33204#true} is VALID [2018-11-23 11:38:11,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {33204#true} call ULTIMATE.init(); {33204#true} is VALID [2018-11-23 11:38:11,298 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,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-11-23 11:38:11,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-23 11:38:11,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:11,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:38:11,374 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,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:38:11,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:38:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:38:11,375 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand 15 states. [2018-11-23 11:38:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:15,255 INFO L93 Difference]: Finished difference Result 242 states and 298 transitions. [2018-11-23 11:38:15,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:38:15,255 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-23 11:38:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:38:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2018-11-23 11:38:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:38:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2018-11-23 11:38:15,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 173 transitions. [2018-11-23 11:38:15,627 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:15,631 INFO L225 Difference]: With dead ends: 242 [2018-11-23 11:38:15,631 INFO L226 Difference]: Without dead ends: 240 [2018-11-23 11:38:15,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:38:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-11-23 11:38:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 163. [2018-11-23 11:38:15,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:15,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand 163 states. [2018-11-23 11:38:15,800 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand 163 states. [2018-11-23 11:38:15,800 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 163 states. [2018-11-23 11:38:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:15,805 INFO L93 Difference]: Finished difference Result 240 states and 292 transitions. [2018-11-23 11:38:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2018-11-23 11:38:15,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:15,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:15,806 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 240 states. [2018-11-23 11:38:15,806 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 240 states. [2018-11-23 11:38:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:15,809 INFO L93 Difference]: Finished difference Result 240 states and 292 transitions. [2018-11-23 11:38:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2018-11-23 11:38:15,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:15,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:15,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:15,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-23 11:38:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 195 transitions. [2018-11-23 11:38:15,812 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 195 transitions. Word has length 28 [2018-11-23 11:38:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:15,812 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 195 transitions. [2018-11-23 11:38:15,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:38:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2018-11-23 11:38:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:38:15,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:15,812 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:15,813 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:15,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash -415500760, now seen corresponding path program 1 times [2018-11-23 11:38:15,813 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:15,813 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:15,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:15,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:15,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {34395#true} call ULTIMATE.init(); {34395#true} is VALID [2018-11-23 11:38:15,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {34395#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {34395#true} is VALID [2018-11-23 11:38:15,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {34395#true} assume true; {34395#true} is VALID [2018-11-23 11:38:15,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34395#true} {34395#true} #171#return; {34395#true} is VALID [2018-11-23 11:38:15,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {34395#true} call #t~ret7 := main(); {34395#true} is VALID [2018-11-23 11:38:15,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {34395#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {34395#true} is VALID [2018-11-23 11:38:15,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {34395#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {34418#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {34418#(= (_ 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; {34418#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {34418#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {34418#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {34418#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {34418#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {34418#(= (_ 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; {34418#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {34418#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34434#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {34434#(= (_ 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; {34434#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,985 INFO L273 TraceCheckUtils]: 13: Hoare triple {34434#(= (_ 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; {34434#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {34434#(= (_ 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; {34434#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {34434#(= (_ 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; {34434#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {34434#(= (_ 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); {34450#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {34450#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {34450#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {34450#(= (_ 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; {34450#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {34450#(= (_ 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; {34450#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {34450#(= (_ 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); {34463#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,990 INFO L273 TraceCheckUtils]: 21: Hoare triple {34463#(= (_ 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; {34463#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {34463#(= (_ 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; {34463#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {34463#(= (_ 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; {34463#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {34463#(= (_ 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; {34463#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,992 INFO L273 TraceCheckUtils]: 25: Hoare triple {34463#(= (_ 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); {34479#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:15,993 INFO L273 TraceCheckUtils]: 26: Hoare triple {34479#(= (_ 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; {34483#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:15,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {34483#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {34396#false} is VALID [2018-11-23 11:38:15,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {34396#false} assume !false; {34396#false} is VALID [2018-11-23 11:38:15,995 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:15,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:16,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {34396#false} assume !false; {34396#false} is VALID [2018-11-23 11:38:16,117 INFO L273 TraceCheckUtils]: 27: Hoare triple {34493#(not (= main_~__VERIFIER_assert__cond~6 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {34396#false} is VALID [2018-11-23 11:38:16,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {34497#(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; {34493#(not (= main_~__VERIFIER_assert__cond~6 (_ bv0 32)))} is VALID [2018-11-23 11:38:16,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {34501#(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); {34497#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:16,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {34501#(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; {34501#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,121 INFO L273 TraceCheckUtils]: 23: Hoare triple {34501#(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; {34501#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {34501#(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; {34501#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {34501#(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; {34501#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,125 INFO L273 TraceCheckUtils]: 20: Hoare triple {34517#(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); {34501#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:16,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {34517#(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; {34517#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:16,126 INFO L273 TraceCheckUtils]: 18: Hoare triple {34517#(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; {34517#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:16,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {34517#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {34517#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:16,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {34530#(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); {34517#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:16,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {34530#(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; {34530#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {34530#(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; {34530#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {34530#(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; {34530#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {34530#(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; {34530#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {34546#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {34530#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:16,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {34546#(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; {34546#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {34546#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {34546#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {34546#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {34546#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {34546#(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; {34546#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {34395#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {34546#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:16,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {34395#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {34395#true} is VALID [2018-11-23 11:38:16,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {34395#true} call #t~ret7 := main(); {34395#true} is VALID [2018-11-23 11:38:16,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34395#true} {34395#true} #171#return; {34395#true} is VALID [2018-11-23 11:38:16,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {34395#true} assume true; {34395#true} is VALID [2018-11-23 11:38:16,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {34395#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {34395#true} is VALID [2018-11-23 11:38:16,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {34395#true} call ULTIMATE.init(); {34395#true} is VALID [2018-11-23 11:38:16,136 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,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:16,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:38:16,138 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 11:38:16,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:16,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:38:16,212 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,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:38:16,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:38:16,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:16,212 INFO L87 Difference]: Start difference. First operand 163 states and 195 transitions. Second operand 14 states. [2018-11-23 11:38:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:19,779 INFO L93 Difference]: Finished difference Result 299 states and 335 transitions. [2018-11-23 11:38:19,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:38:19,779 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 11:38:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 335 transitions. [2018-11-23 11:38:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 335 transitions. [2018-11-23 11:38:19,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 335 transitions. [2018-11-23 11:38:20,250 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,256 INFO L225 Difference]: With dead ends: 299 [2018-11-23 11:38:20,256 INFO L226 Difference]: Without dead ends: 297 [2018-11-23 11:38:20,256 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,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-23 11:38:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 184. [2018-11-23 11:38:20,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:20,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand 184 states. [2018-11-23 11:38:20,454 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 184 states. [2018-11-23 11:38:20,454 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 184 states. [2018-11-23 11:38:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:20,460 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2018-11-23 11:38:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 328 transitions. [2018-11-23 11:38:20,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:20,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:20,461 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 297 states. [2018-11-23 11:38:20,461 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 297 states. [2018-11-23 11:38:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:20,465 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2018-11-23 11:38:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 328 transitions. [2018-11-23 11:38:20,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:20,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:20,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:20,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 11:38:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 227 transitions. [2018-11-23 11:38:20,468 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 227 transitions. Word has length 29 [2018-11-23 11:38:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:20,469 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 227 transitions. [2018-11-23 11:38:20,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:38:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 227 transitions. [2018-11-23 11:38:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:38:20,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:20,469 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:20,469 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:20,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:20,470 INFO L82 PathProgramCache]: Analyzing trace with hash 4808449, now seen corresponding path program 1 times [2018-11-23 11:38:20,470 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:20,470 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:20,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:20,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:20,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {35763#true} call ULTIMATE.init(); {35763#true} is VALID [2018-11-23 11:38:20,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {35763#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {35763#true} is VALID [2018-11-23 11:38:20,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {35763#true} assume true; {35763#true} is VALID [2018-11-23 11:38:20,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35763#true} {35763#true} #171#return; {35763#true} is VALID [2018-11-23 11:38:20,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {35763#true} call #t~ret7 := main(); {35763#true} is VALID [2018-11-23 11:38:20,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {35763#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {35763#true} is VALID [2018-11-23 11:38:20,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {35763#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {35786#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {35786#(= (_ 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; {35786#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {35786#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {35786#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {35786#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {35786#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {35786#(= (_ 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; {35786#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {35786#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35802#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {35802#(= (_ 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; {35802#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {35802#(= (_ 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; {35802#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {35802#(= (_ 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; {35802#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {35802#(= (_ 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; {35802#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {35802#(= (_ 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); {35818#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {35818#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {35818#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {35818#(= (_ 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; {35818#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {35818#(= (_ 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; {35818#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {35818#(= (_ 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); {35831#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {35831#(= (_ 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; {35831#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {35831#(= (_ 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; {35831#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {35831#(= (_ 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; {35831#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {35831#(= (_ 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; {35831#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {35831#(= (_ 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); {35847#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {35847#(= (_ bv4 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {35847#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {35847#(= (_ 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; {35854#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:20,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {35854#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {35764#false} is VALID [2018-11-23 11:38:20,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {35764#false} assume !false; {35764#false} is VALID [2018-11-23 11:38:20,664 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:20,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:20,790 INFO L273 TraceCheckUtils]: 29: Hoare triple {35764#false} assume !false; {35764#false} is VALID [2018-11-23 11:38:20,791 INFO L273 TraceCheckUtils]: 28: Hoare triple {35864#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {35764#false} is VALID [2018-11-23 11:38:20,791 INFO L273 TraceCheckUtils]: 27: Hoare triple {35868#(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; {35864#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} is VALID [2018-11-23 11:38:20,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {35868#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {35868#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,793 INFO L273 TraceCheckUtils]: 25: Hoare triple {35875#(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); {35868#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:20,794 INFO L273 TraceCheckUtils]: 24: Hoare triple {35875#(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; {35875#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:20,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {35875#(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; {35875#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:20,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {35875#(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; {35875#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:20,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {35875#(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; {35875#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:20,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {35891#(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); {35875#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:20,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {35891#(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; {35891#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:20,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {35891#(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; {35891#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:20,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {35891#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {35891#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:20,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {35904#(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); {35891#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:20,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {35904#(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; {35904#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:20,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {35904#(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; {35904#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:20,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {35904#(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; {35904#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:20,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {35904#(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; {35904#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:20,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {35920#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {35904#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:20,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {35920#(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; {35920#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:20,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {35920#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {35920#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:20,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {35920#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {35920#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:20,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {35920#(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; {35920#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:20,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {35763#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {35920#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:20,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {35763#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {35763#true} is VALID [2018-11-23 11:38:20,808 INFO L256 TraceCheckUtils]: 4: Hoare triple {35763#true} call #t~ret7 := main(); {35763#true} is VALID [2018-11-23 11:38:20,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35763#true} {35763#true} #171#return; {35763#true} is VALID [2018-11-23 11:38:20,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {35763#true} assume true; {35763#true} is VALID [2018-11-23 11:38:20,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {35763#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {35763#true} is VALID [2018-11-23 11:38:20,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {35763#true} call ULTIMATE.init(); {35763#true} is VALID [2018-11-23 11:38:20,811 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:20,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:20,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:38:20,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 11:38:20,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:20,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:38:20,895 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:20,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:38:20,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:38:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:20,896 INFO L87 Difference]: Start difference. First operand 184 states and 227 transitions. Second operand 14 states. [2018-11-23 11:38:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:24,912 INFO L93 Difference]: Finished difference Result 434 states and 490 transitions. [2018-11-23 11:38:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:38:24,913 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 11:38:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 490 transitions. [2018-11-23 11:38:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 490 transitions. [2018-11-23 11:38:24,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 490 transitions. [2018-11-23 11:38:25,623 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:25,633 INFO L225 Difference]: With dead ends: 434 [2018-11-23 11:38:25,633 INFO L226 Difference]: Without dead ends: 432 [2018-11-23 11:38:25,634 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:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-11-23 11:38:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 204. [2018-11-23 11:38:25,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:25,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 432 states. Second operand 204 states. [2018-11-23 11:38:25,858 INFO L74 IsIncluded]: Start isIncluded. First operand 432 states. Second operand 204 states. [2018-11-23 11:38:25,858 INFO L87 Difference]: Start difference. First operand 432 states. Second operand 204 states. [2018-11-23 11:38:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:25,867 INFO L93 Difference]: Finished difference Result 432 states and 483 transitions. [2018-11-23 11:38:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 483 transitions. [2018-11-23 11:38:25,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:25,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:25,867 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 432 states. [2018-11-23 11:38:25,868 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 432 states. [2018-11-23 11:38:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:25,876 INFO L93 Difference]: Finished difference Result 432 states and 483 transitions. [2018-11-23 11:38:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 483 transitions. [2018-11-23 11:38:25,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:25,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:25,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:25,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 11:38:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2018-11-23 11:38:25,880 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 30 [2018-11-23 11:38:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:25,880 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2018-11-23 11:38:25,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:38:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2018-11-23 11:38:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:38:25,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:25,881 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:25,881 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:25,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 4381445, now seen corresponding path program 1 times [2018-11-23 11:38:25,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:25,881 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:25,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:25,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:26,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {37593#true} call ULTIMATE.init(); {37593#true} is VALID [2018-11-23 11:38:26,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {37593#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {37593#true} is VALID [2018-11-23 11:38:26,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {37593#true} assume true; {37593#true} is VALID [2018-11-23 11:38:26,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37593#true} {37593#true} #171#return; {37593#true} is VALID [2018-11-23 11:38:26,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {37593#true} call #t~ret7 := main(); {37593#true} is VALID [2018-11-23 11:38:26,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {37593#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {37593#true} is VALID [2018-11-23 11:38:26,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {37593#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {37616#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {37616#(= (_ 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; {37616#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {37616#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {37616#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {37616#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {37616#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {37616#(= (_ 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; {37616#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {37616#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37632#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {37632#(= (_ 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; {37632#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {37632#(= (_ 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; {37632#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {37632#(= (_ 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; {37632#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {37632#(= (_ 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; {37632#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {37632#(= (_ 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); {37648#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {37648#(= (_ bv2 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {37648#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {37648#(= (_ 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; {37648#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {37648#(= (_ 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; {37648#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {37648#(= (_ 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); {37661#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {37661#(= (_ 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; {37661#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {37661#(= (_ 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; {37661#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {37661#(= (_ 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; {37661#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {37661#(= (_ 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; {37661#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,149 INFO L273 TraceCheckUtils]: 25: Hoare triple {37661#(= (_ 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); {37677#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:26,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {37677#(= (_ 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; {37681#(and (= (_ bv4 32) main_~main__t~0) (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2018-11-23 11:38:26,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {37681#(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; {37685#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:26,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {37685#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {37594#false} is VALID [2018-11-23 11:38:26,151 INFO L273 TraceCheckUtils]: 29: Hoare triple {37594#false} assume !false; {37594#false} is VALID [2018-11-23 11:38:26,153 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:26,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:26,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {37594#false} assume !false; {37594#false} is VALID [2018-11-23 11:38:26,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {37695#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~7; {37594#false} is VALID [2018-11-23 11:38:26,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {37699#(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; {37695#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} is VALID [2018-11-23 11:38:26,209 INFO L273 TraceCheckUtils]: 26: Hoare triple {37593#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; {37699#(bvsle main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:38:26,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {37593#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37593#true} is VALID [2018-11-23 11:38:26,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {37593#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37593#true} is VALID [2018-11-23 11:38:26,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {37593#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37593#true} is VALID [2018-11-23 11:38:26,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {37593#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {37593#true} is VALID [2018-11-23 11:38:26,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {37593#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37593#true} is VALID [2018-11-23 11:38:26,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,211 INFO L273 TraceCheckUtils]: 14: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {37593#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {37593#true} is VALID [2018-11-23 11:38:26,212 INFO L273 TraceCheckUtils]: 12: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {37593#true} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {37593#true} is VALID [2018-11-23 11:38:26,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {37593#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {37593#true} is VALID [2018-11-23 11:38:26,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {37593#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {37593#true} is VALID [2018-11-23 11:38:26,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {37593#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; {37593#true} is VALID [2018-11-23 11:38:26,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {37593#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {37593#true} is VALID [2018-11-23 11:38:26,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {37593#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {37593#true} is VALID [2018-11-23 11:38:26,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {37593#true} call #t~ret7 := main(); {37593#true} is VALID [2018-11-23 11:38:26,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37593#true} {37593#true} #171#return; {37593#true} is VALID [2018-11-23 11:38:26,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {37593#true} assume true; {37593#true} is VALID [2018-11-23 11:38:26,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {37593#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {37593#true} is VALID [2018-11-23 11:38:26,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {37593#true} call ULTIMATE.init(); {37593#true} is VALID [2018-11-23 11:38:26,214 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:26,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:38:26,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-23 11:38:26,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-23 11:38:26,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:26,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:38:26,269 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:26,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:38:26,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:38:26,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:38:26,270 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand 11 states. [2018-11-23 11:38:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:29,009 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2018-11-23 11:38:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:38:29,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-23 11:38:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2018-11-23 11:38:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:38:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2018-11-23 11:38:29,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 146 transitions. [2018-11-23 11:38:29,244 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:29,248 INFO L225 Difference]: With dead ends: 206 [2018-11-23 11:38:29,248 INFO L226 Difference]: Without dead ends: 200 [2018-11-23 11:38:29,248 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:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-23 11:38:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-11-23 11:38:29,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:29,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:29,641 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:29,641 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:29,645 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2018-11-23 11:38:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2018-11-23 11:38:29,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:29,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:29,645 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:29,645 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 200 states. [2018-11-23 11:38:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:29,648 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2018-11-23 11:38:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2018-11-23 11:38:29,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:29,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:29,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:29,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 11:38:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 243 transitions. [2018-11-23 11:38:29,652 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 243 transitions. Word has length 30 [2018-11-23 11:38:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:29,652 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 243 transitions. [2018-11-23 11:38:29,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:38:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2018-11-23 11:38:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:38:29,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:29,652 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:29,653 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:29,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2081723405, now seen corresponding path program 2 times [2018-11-23 11:38:29,653 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:29,653 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:29,669 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:29,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:38:29,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:29,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:29,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {38682#true} call ULTIMATE.init(); {38682#true} is VALID [2018-11-23 11:38:29,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {38682#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {38682#true} is VALID [2018-11-23 11:38:29,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {38682#true} assume true; {38682#true} is VALID [2018-11-23 11:38:29,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38682#true} {38682#true} #171#return; {38682#true} is VALID [2018-11-23 11:38:29,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {38682#true} call #t~ret7 := main(); {38682#true} is VALID [2018-11-23 11:38:29,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {38682#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {38682#true} is VALID [2018-11-23 11:38:29,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {38682#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {38705#(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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {38705#(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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {38705#(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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {38705#(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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {38705#(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); {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {38705#(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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {38705#(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); {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {38705#(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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {38705#(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); {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {38705#(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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,802 INFO L273 TraceCheckUtils]: 24: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,803 INFO L273 TraceCheckUtils]: 25: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {38705#(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); {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {38705#(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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,806 INFO L273 TraceCheckUtils]: 31: Hoare triple {38705#(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); {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {38705#(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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,807 INFO L273 TraceCheckUtils]: 33: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 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; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,808 INFO L273 TraceCheckUtils]: 35: Hoare triple {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,808 INFO L273 TraceCheckUtils]: 36: Hoare triple {38705#(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); {38705#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:38:29,810 INFO L273 TraceCheckUtils]: 37: Hoare triple {38705#(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; {38799#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:29,811 INFO L273 TraceCheckUtils]: 38: Hoare triple {38799#(= (bvadd main_~__VERIFIER_assert__cond~14 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~14; {38683#false} is VALID [2018-11-23 11:38:29,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {38683#false} assume !false; {38683#false} is VALID [2018-11-23 11:38:29,814 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:29,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:29,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:29,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:38:29,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 11:38:29,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:29,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:38:29,846 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:29,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:38:29,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:38:29,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:38:29,847 INFO L87 Difference]: Start difference. First operand 200 states and 243 transitions. Second operand 4 states. [2018-11-23 11:38:30,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:30,330 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2018-11-23 11:38:30,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:38:30,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 11:38:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:38:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-11-23 11:38:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:38:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-11-23 11:38:30,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 53 transitions. [2018-11-23 11:38:30,419 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:30,423 INFO L225 Difference]: With dead ends: 200 [2018-11-23 11:38:30,423 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 11:38:30,423 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:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 11:38:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-11-23 11:38:30,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:30,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:30,674 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:30,674 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:30,678 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2018-11-23 11:38:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2018-11-23 11:38:30,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:30,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:30,679 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:30,679 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 197 states. [2018-11-23 11:38:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:30,681 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2018-11-23 11:38:30,682 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2018-11-23 11:38:30,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:30,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:30,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:30,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-23 11:38:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 237 transitions. [2018-11-23 11:38:30,686 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 237 transitions. Word has length 40 [2018-11-23 11:38:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:30,686 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 237 transitions. [2018-11-23 11:38:30,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:38:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2018-11-23 11:38:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:38:30,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:30,687 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:30,687 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:30,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash -108482949, now seen corresponding path program 2 times [2018-11-23 11:38:30,688 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:30,688 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:30,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:30,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:30,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:30,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:30,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {39684#true} call ULTIMATE.init(); {39684#true} is VALID [2018-11-23 11:38:30,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {39684#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {39684#true} is VALID [2018-11-23 11:38:30,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {39684#true} assume true; {39684#true} is VALID [2018-11-23 11:38:30,936 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39684#true} {39684#true} #171#return; {39684#true} is VALID [2018-11-23 11:38:30,936 INFO L256 TraceCheckUtils]: 4: Hoare triple {39684#true} call #t~ret7 := main(); {39684#true} is VALID [2018-11-23 11:38:30,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {39684#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {39684#true} is VALID [2018-11-23 11:38:30,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {39684#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {39707#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {39707#(= (_ 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; {39707#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {39707#(= (_ 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; {39707#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {39707#(= (_ 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; {39707#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,939 INFO L273 TraceCheckUtils]: 10: Hoare triple {39707#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {39707#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {39707#(= (_ 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); {39723#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,940 INFO L273 TraceCheckUtils]: 12: Hoare triple {39723#(= (_ 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; {39723#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,940 INFO L273 TraceCheckUtils]: 13: Hoare triple {39723#(= (_ 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; {39723#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {39723#(= (_ 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; {39723#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {39723#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39723#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {39723#(= (_ 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); {39739#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {39739#(= (_ 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; {39739#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {39739#(= (_ 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; {39739#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,943 INFO L273 TraceCheckUtils]: 19: Hoare triple {39739#(= (_ bv2 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; {39739#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {39739#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39739#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {39739#(= (_ 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); {39755#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,945 INFO L273 TraceCheckUtils]: 22: Hoare triple {39755#(= (_ 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; {39755#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {39755#(= (_ bv3 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; {39755#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,946 INFO L273 TraceCheckUtils]: 24: Hoare triple {39755#(= (_ bv3 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; {39755#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,947 INFO L273 TraceCheckUtils]: 25: Hoare triple {39755#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39755#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,947 INFO L273 TraceCheckUtils]: 26: Hoare triple {39755#(= (_ 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); {39771#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,948 INFO L273 TraceCheckUtils]: 27: Hoare triple {39771#(= (_ 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; {39771#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,948 INFO L273 TraceCheckUtils]: 28: Hoare triple {39771#(= (_ bv4 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; {39771#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,949 INFO L273 TraceCheckUtils]: 29: Hoare triple {39771#(= (_ bv4 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; {39771#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,949 INFO L273 TraceCheckUtils]: 30: Hoare triple {39771#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39771#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,950 INFO L273 TraceCheckUtils]: 31: Hoare triple {39771#(= (_ 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); {39787#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,951 INFO L273 TraceCheckUtils]: 32: Hoare triple {39787#(= (_ 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; {39787#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,951 INFO L273 TraceCheckUtils]: 33: Hoare triple {39787#(= (_ bv5 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; {39787#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,952 INFO L273 TraceCheckUtils]: 34: Hoare triple {39787#(= (_ bv5 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; {39787#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,952 INFO L273 TraceCheckUtils]: 35: Hoare triple {39787#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39787#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,953 INFO L273 TraceCheckUtils]: 36: Hoare triple {39787#(= (_ 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); {39803#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,953 INFO L273 TraceCheckUtils]: 37: Hoare triple {39803#(= (_ 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; {39803#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:30,954 INFO L273 TraceCheckUtils]: 38: Hoare triple {39803#(= (_ 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; {39810#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:30,955 INFO L273 TraceCheckUtils]: 39: Hoare triple {39810#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {39685#false} is VALID [2018-11-23 11:38:30,955 INFO L273 TraceCheckUtils]: 40: Hoare triple {39685#false} assume !false; {39685#false} is VALID [2018-11-23 11:38:30,957 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:30,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:31,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {39685#false} assume !false; {39685#false} is VALID [2018-11-23 11:38:31,165 INFO L273 TraceCheckUtils]: 39: Hoare triple {39820#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~16; {39685#false} is VALID [2018-11-23 11:38:31,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {39824#(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; {39820#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} is VALID [2018-11-23 11:38:31,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {39824#(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; {39824#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:31,167 INFO L273 TraceCheckUtils]: 36: Hoare triple {39831#(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); {39824#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:31,167 INFO L273 TraceCheckUtils]: 35: Hoare triple {39831#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39831#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:31,168 INFO L273 TraceCheckUtils]: 34: Hoare triple {39831#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {39831#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:31,169 INFO L273 TraceCheckUtils]: 33: Hoare triple {39831#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {39831#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:31,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {39831#(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; {39831#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:31,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {39847#(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); {39831#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:31,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {39847#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39847#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:31,173 INFO L273 TraceCheckUtils]: 29: Hoare triple {39847#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 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; {39847#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:31,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {39847#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 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; {39847#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:31,174 INFO L273 TraceCheckUtils]: 27: Hoare triple {39847#(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; {39847#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:31,176 INFO L273 TraceCheckUtils]: 26: Hoare triple {39863#(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); {39847#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:31,177 INFO L273 TraceCheckUtils]: 25: Hoare triple {39863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:31,177 INFO L273 TraceCheckUtils]: 24: Hoare triple {39863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 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; {39863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:31,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {39863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 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; {39863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:31,178 INFO L273 TraceCheckUtils]: 22: Hoare triple {39863#(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; {39863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:31,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {39879#(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); {39863#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:31,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {39879#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39879#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:31,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {39879#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 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; {39879#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:31,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {39879#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 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; {39879#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:31,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {39879#(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; {39879#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:31,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {39895#(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); {39879#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:31,184 INFO L273 TraceCheckUtils]: 15: Hoare triple {39895#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {39895#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:31,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {39895#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 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; {39895#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:31,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {39895#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 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; {39895#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:31,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {39895#(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; {39895#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:31,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {39911#(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); {39895#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:31,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {39911#(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; {39911#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:31,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {39911#(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; {39911#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:31,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {39911#(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; {39911#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:31,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {39911#(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; {39911#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:31,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {39684#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {39911#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:31,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {39684#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {39684#true} is VALID [2018-11-23 11:38:31,192 INFO L256 TraceCheckUtils]: 4: Hoare triple {39684#true} call #t~ret7 := main(); {39684#true} is VALID [2018-11-23 11:38:31,192 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39684#true} {39684#true} #171#return; {39684#true} is VALID [2018-11-23 11:38:31,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {39684#true} assume true; {39684#true} is VALID [2018-11-23 11:38:31,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {39684#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {39684#true} is VALID [2018-11-23 11:38:31,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {39684#true} call ULTIMATE.init(); {39684#true} is VALID [2018-11-23 11:38:31,195 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:31,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:31,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:38:31,197 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 11:38:31,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:31,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:38:31,305 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:31,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:38:31,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:38:31,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:38:31,306 INFO L87 Difference]: Start difference. First operand 197 states and 237 transitions. Second operand 18 states. [2018-11-23 11:38:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:39,061 INFO L93 Difference]: Finished difference Result 599 states and 676 transitions. [2018-11-23 11:38:39,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:38:39,061 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 11:38:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 676 transitions. [2018-11-23 11:38:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 676 transitions. [2018-11-23 11:38:39,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 676 transitions. [2018-11-23 11:38:40,245 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:40,263 INFO L225 Difference]: With dead ends: 599 [2018-11-23 11:38:40,263 INFO L226 Difference]: Without dead ends: 597 [2018-11-23 11:38:40,263 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:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-11-23 11:38:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 223. [2018-11-23 11:38:40,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:40,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand 223 states. [2018-11-23 11:38:40,538 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand 223 states. [2018-11-23 11:38:40,538 INFO L87 Difference]: Start difference. First operand 597 states. Second operand 223 states. [2018-11-23 11:38:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:40,554 INFO L93 Difference]: Finished difference Result 597 states and 667 transitions. [2018-11-23 11:38:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 667 transitions. [2018-11-23 11:38:40,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:40,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:40,554 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 597 states. [2018-11-23 11:38:40,555 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 597 states. [2018-11-23 11:38:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:40,569 INFO L93 Difference]: Finished difference Result 597 states and 667 transitions. [2018-11-23 11:38:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 667 transitions. [2018-11-23 11:38:40,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:40,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:40,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:40,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-23 11:38:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2018-11-23 11:38:40,573 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 41 [2018-11-23 11:38:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:40,573 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2018-11-23 11:38:40,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:38:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2018-11-23 11:38:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:38:40,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:40,574 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:40,574 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:40,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:40,575 INFO L82 PathProgramCache]: Analyzing trace with hash 931797498, now seen corresponding path program 2 times [2018-11-23 11:38:40,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:40,575 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:40,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:40,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:40,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:40,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:40,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {42138#true} call ULTIMATE.init(); {42138#true} is VALID [2018-11-23 11:38:40,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {42138#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {42138#true} is VALID [2018-11-23 11:38:40,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {42138#true} assume true; {42138#true} is VALID [2018-11-23 11:38:40,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42138#true} {42138#true} #171#return; {42138#true} is VALID [2018-11-23 11:38:40,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {42138#true} call #t~ret7 := main(); {42138#true} is VALID [2018-11-23 11:38:40,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {42138#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {42138#true} is VALID [2018-11-23 11:38:40,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {42138#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {42161#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {42161#(= (_ 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; {42161#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {42161#(= (_ 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; {42161#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {42161#(= (_ 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; {42161#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,827 INFO L273 TraceCheckUtils]: 10: Hoare triple {42161#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {42161#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,827 INFO L273 TraceCheckUtils]: 11: Hoare triple {42161#(= (_ 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); {42177#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {42177#(= (_ 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; {42177#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {42177#(= (_ 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; {42177#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,829 INFO L273 TraceCheckUtils]: 14: Hoare triple {42177#(= (_ 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; {42177#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {42177#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42177#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,830 INFO L273 TraceCheckUtils]: 16: Hoare triple {42177#(= (_ 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); {42193#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {42193#(= (_ 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; {42193#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {42193#(= (_ 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; {42193#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {42193#(= (_ bv2 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; {42193#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {42193#(= (_ bv2 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42193#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {42193#(= (_ 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); {42209#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {42209#(= (_ 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; {42209#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {42209#(= (_ bv3 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; {42209#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {42209#(= (_ bv3 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; {42209#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {42209#(= (_ bv3 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42209#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {42209#(= (_ 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); {42225#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {42225#(= (_ 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; {42225#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {42225#(= (_ bv4 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; {42225#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {42225#(= (_ bv4 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; {42225#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {42225#(= (_ bv4 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42225#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {42225#(= (_ 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); {42241#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {42241#(= (_ 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; {42241#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {42241#(= (_ bv5 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; {42241#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {42241#(= (_ bv5 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; {42241#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {42241#(= (_ bv5 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42241#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {42241#(= (_ 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); {42257#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,842 INFO L273 TraceCheckUtils]: 37: Hoare triple {42257#(= (_ 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; {42257#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,842 INFO L273 TraceCheckUtils]: 38: Hoare triple {42257#(= (_ bv6 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {42257#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:40,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {42257#(= (_ bv6 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {42267#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:40,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {42267#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {42139#false} is VALID [2018-11-23 11:38:40,844 INFO L273 TraceCheckUtils]: 41: Hoare triple {42139#false} assume !false; {42139#false} is VALID [2018-11-23 11:38:40,846 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:40,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:41,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {42139#false} assume !false; {42139#false} is VALID [2018-11-23 11:38:41,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {42277#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {42139#false} is VALID [2018-11-23 11:38:41,052 INFO L273 TraceCheckUtils]: 39: Hoare triple {42281#(bvsle (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {42277#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:41,052 INFO L273 TraceCheckUtils]: 38: Hoare triple {42281#(bvsle (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {42281#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:41,053 INFO L273 TraceCheckUtils]: 37: Hoare triple {42281#(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; {42281#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:41,068 INFO L273 TraceCheckUtils]: 36: Hoare triple {42291#(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); {42281#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:41,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {42291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:41,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {42291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {42291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:41,069 INFO L273 TraceCheckUtils]: 33: Hoare triple {42291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 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; {42291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:41,069 INFO L273 TraceCheckUtils]: 32: Hoare triple {42291#(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; {42291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:41,071 INFO L273 TraceCheckUtils]: 31: Hoare triple {42307#(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); {42291#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:41,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {42307#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42307#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:41,072 INFO L273 TraceCheckUtils]: 29: Hoare triple {42307#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 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; {42307#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:41,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {42307#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 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; {42307#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:41,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {42307#(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; {42307#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:41,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {42323#(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); {42307#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:41,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {42323#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42323#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:41,076 INFO L273 TraceCheckUtils]: 24: Hoare triple {42323#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 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; {42323#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:41,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {42323#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 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; {42323#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:41,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {42323#(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; {42323#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:41,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {42339#(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); {42323#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:41,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {42339#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42339#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:41,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {42339#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 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; {42339#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:41,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {42339#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 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; {42339#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:41,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {42339#(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; {42339#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:41,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {42355#(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); {42339#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:41,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {42355#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {42355#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:41,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {42355#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 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; {42355#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:41,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {42355#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 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; {42355#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:41,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {42355#(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; {42355#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:41,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {42371#(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); {42355#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:41,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {42371#(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; {42371#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:41,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {42371#(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; {42371#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:41,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {42371#(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; {42371#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:41,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {42371#(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; {42371#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:41,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {42138#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {42371#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:41,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {42138#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {42138#true} is VALID [2018-11-23 11:38:41,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {42138#true} call #t~ret7 := main(); {42138#true} is VALID [2018-11-23 11:38:41,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42138#true} {42138#true} #171#return; {42138#true} is VALID [2018-11-23 11:38:41,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {42138#true} assume true; {42138#true} is VALID [2018-11-23 11:38:41,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {42138#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {42138#true} is VALID [2018-11-23 11:38:41,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {42138#true} call ULTIMATE.init(); {42138#true} is VALID [2018-11-23 11:38:41,091 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:41,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:41,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:38:41,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-11-23 11:38:41,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:41,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:38:41,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:41,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:38:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:38:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:38:41,205 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand 18 states. [2018-11-23 11:38:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:47,182 INFO L93 Difference]: Finished difference Result 376 states and 428 transitions. [2018-11-23 11:38:47,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:38:47,182 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-11-23 11:38:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 428 transitions. [2018-11-23 11:38:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:38:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 428 transitions. [2018-11-23 11:38:47,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 428 transitions. [2018-11-23 11:38:47,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:47,837 INFO L225 Difference]: With dead ends: 376 [2018-11-23 11:38:47,838 INFO L226 Difference]: Without dead ends: 374 [2018-11-23 11:38:47,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=452, Invalid=954, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:38:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-23 11:38:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 225. [2018-11-23 11:38:48,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:48,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand 225 states. [2018-11-23 11:38:48,144 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand 225 states. [2018-11-23 11:38:48,145 INFO L87 Difference]: Start difference. First operand 374 states. Second operand 225 states. [2018-11-23 11:38:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:48,153 INFO L93 Difference]: Finished difference Result 374 states and 419 transitions. [2018-11-23 11:38:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 419 transitions. [2018-11-23 11:38:48,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:48,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:48,153 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 374 states. [2018-11-23 11:38:48,153 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 374 states. [2018-11-23 11:38:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:48,160 INFO L93 Difference]: Finished difference Result 374 states and 419 transitions. [2018-11-23 11:38:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 419 transitions. [2018-11-23 11:38:48,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:48,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:48,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:48,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-23 11:38:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2018-11-23 11:38:48,164 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 42 [2018-11-23 11:38:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:48,164 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2018-11-23 11:38:48,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:38:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2018-11-23 11:38:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:38:48,165 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:48,165 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:48,165 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:48,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:48,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1406452145, now seen corresponding path program 1 times [2018-11-23 11:38:48,166 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:48,166 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:38:48,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:38:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:48,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:48,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {43909#true} call ULTIMATE.init(); {43909#true} is VALID [2018-11-23 11:38:48,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {43909#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {43909#true} is VALID [2018-11-23 11:38:48,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {43909#true} assume true; {43909#true} is VALID [2018-11-23 11:38:48,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43909#true} {43909#true} #171#return; {43909#true} is VALID [2018-11-23 11:38:48,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {43909#true} call #t~ret7 := main(); {43909#true} is VALID [2018-11-23 11:38:48,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {43909#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {43909#true} is VALID [2018-11-23 11:38:48,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {43909#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {43932#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {43932#(= (_ 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; {43932#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {43932#(= (_ 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; {43932#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {43932#(= (_ 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; {43932#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {43932#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {43932#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {43932#(= (_ 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); {43948#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {43948#(= (_ 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; {43948#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {43948#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {43948#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {43948#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {43948#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,449 INFO L273 TraceCheckUtils]: 15: Hoare triple {43948#(= (_ bv1 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; {43948#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {43948#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {43964#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {43964#(= (_ 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; {43964#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,451 INFO L273 TraceCheckUtils]: 18: Hoare triple {43964#(= (_ 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; {43964#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {43964#(= (_ 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; {43964#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {43964#(= (_ 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; {43964#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {43964#(= (_ 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); {43980#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {43980#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {43980#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,455 INFO L273 TraceCheckUtils]: 23: Hoare triple {43980#(= (_ 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; {43980#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {43980#(= (_ 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; {43980#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,456 INFO L273 TraceCheckUtils]: 25: Hoare triple {43980#(= (_ 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); {43993#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,456 INFO L273 TraceCheckUtils]: 26: Hoare triple {43993#(= (_ 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; {43993#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,457 INFO L273 TraceCheckUtils]: 27: Hoare triple {43993#(= (_ 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; {43993#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,457 INFO L273 TraceCheckUtils]: 28: Hoare triple {43993#(= (_ 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; {43993#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,457 INFO L273 TraceCheckUtils]: 29: Hoare triple {43993#(= (_ 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; {43993#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,458 INFO L273 TraceCheckUtils]: 30: Hoare triple {43993#(= (_ 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); {44009#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,458 INFO L273 TraceCheckUtils]: 31: Hoare triple {44009#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {44009#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,458 INFO L273 TraceCheckUtils]: 32: Hoare triple {44009#(= (_ 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; {44009#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {44009#(= (_ 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; {44009#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,460 INFO L273 TraceCheckUtils]: 34: Hoare triple {44009#(= (_ 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); {44022#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,460 INFO L273 TraceCheckUtils]: 35: Hoare triple {44022#(= (_ 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; {44022#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,461 INFO L273 TraceCheckUtils]: 36: Hoare triple {44022#(= (_ 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; {44022#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,461 INFO L273 TraceCheckUtils]: 37: Hoare triple {44022#(= (_ 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; {44022#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,462 INFO L273 TraceCheckUtils]: 38: Hoare triple {44022#(= (_ 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; {44022#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,463 INFO L273 TraceCheckUtils]: 39: Hoare triple {44022#(= (_ 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); {44038#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,464 INFO L273 TraceCheckUtils]: 40: Hoare triple {44038#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {44038#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,465 INFO L273 TraceCheckUtils]: 41: Hoare triple {44038#(= (_ 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; {44038#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,465 INFO L273 TraceCheckUtils]: 42: Hoare triple {44038#(= (_ 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; {44038#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,465 INFO L273 TraceCheckUtils]: 43: Hoare triple {44038#(= (_ 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); {44051#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,466 INFO L273 TraceCheckUtils]: 44: Hoare triple {44051#(= (_ 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; {44055#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:48,466 INFO L273 TraceCheckUtils]: 45: Hoare triple {44055#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {43910#false} is VALID [2018-11-23 11:38:48,466 INFO L273 TraceCheckUtils]: 46: Hoare triple {43910#false} assume !false; {43910#false} is VALID [2018-11-23 11:38:48,468 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:48,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:48,762 INFO L273 TraceCheckUtils]: 46: Hoare triple {43910#false} assume !false; {43910#false} is VALID [2018-11-23 11:38:48,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {44065#(not (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~2; {43910#false} is VALID [2018-11-23 11:38:48,764 INFO L273 TraceCheckUtils]: 44: Hoare triple {44069#(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; {44065#(not (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} is VALID [2018-11-23 11:38:48,766 INFO L273 TraceCheckUtils]: 43: Hoare triple {44073#(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); {44069#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:38:48,770 INFO L273 TraceCheckUtils]: 42: Hoare triple {44073#(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; {44073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:48,770 INFO L273 TraceCheckUtils]: 41: Hoare triple {44073#(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; {44073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:48,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {44073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {44073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:48,773 INFO L273 TraceCheckUtils]: 39: Hoare triple {44086#(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); {44073#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:38:48,773 INFO L273 TraceCheckUtils]: 38: Hoare triple {44086#(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; {44086#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:48,774 INFO L273 TraceCheckUtils]: 37: Hoare triple {44086#(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; {44086#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:48,774 INFO L273 TraceCheckUtils]: 36: Hoare triple {44086#(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; {44086#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:48,775 INFO L273 TraceCheckUtils]: 35: Hoare triple {44086#(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; {44086#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:48,777 INFO L273 TraceCheckUtils]: 34: Hoare triple {44102#(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); {44086#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:38:48,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {44102#(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; {44102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:48,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {44102#(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; {44102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:48,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {44102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {44102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:48,782 INFO L273 TraceCheckUtils]: 30: Hoare triple {44115#(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); {44102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:38:48,782 INFO L273 TraceCheckUtils]: 29: Hoare triple {44115#(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; {44115#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:48,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {44115#(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; {44115#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:48,783 INFO L273 TraceCheckUtils]: 27: Hoare triple {44115#(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; {44115#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:48,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {44115#(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; {44115#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:48,785 INFO L273 TraceCheckUtils]: 25: Hoare triple {44131#(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); {44115#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:38:48,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {44131#(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; {44131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:48,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {44131#(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; {44131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:48,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {44131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {44131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:48,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {44144#(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); {44131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:38:48,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {44144#(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; {44144#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:48,791 INFO L273 TraceCheckUtils]: 19: Hoare triple {44144#(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; {44144#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:48,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {44144#(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; {44144#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:48,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {44144#(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; {44144#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:48,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {44160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {44144#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:38:48,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {44160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 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; {44160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:48,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {44160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {44160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:48,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {44160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {44160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:48,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {44160#(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; {44160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:48,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {44176#(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); {44160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:38:48,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {44176#(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; {44176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:48,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {44176#(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; {44176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:48,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {44176#(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; {44176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:48,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {44176#(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; {44176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:48,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {43909#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {44176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:38:48,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {43909#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {43909#true} is VALID [2018-11-23 11:38:48,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {43909#true} call #t~ret7 := main(); {43909#true} is VALID [2018-11-23 11:38:48,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43909#true} {43909#true} #171#return; {43909#true} is VALID [2018-11-23 11:38:48,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {43909#true} assume true; {43909#true} is VALID [2018-11-23 11:38:48,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {43909#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {43909#true} is VALID [2018-11-23 11:38:48,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {43909#true} call ULTIMATE.init(); {43909#true} is VALID [2018-11-23 11:38:48,828 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:48,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:48,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:38:48,830 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-11-23 11:38:48,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:48,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:38:48,956 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:48,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:38:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:38:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:38:48,958 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand 22 states. [2018-11-23 11:38:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:58,285 INFO L93 Difference]: Finished difference Result 473 states and 537 transitions. [2018-11-23 11:38:58,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:38:58,286 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-11-23 11:38:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:38:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 537 transitions. [2018-11-23 11:38:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:38:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 537 transitions. [2018-11-23 11:38:58,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 537 transitions. [2018-11-23 11:38:59,065 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:38:59,076 INFO L225 Difference]: With dead ends: 473 [2018-11-23 11:38:59,077 INFO L226 Difference]: Without dead ends: 461 [2018-11-23 11:38:59,077 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:38:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-23 11:38:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 333. [2018-11-23 11:38:59,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:59,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand 333 states. [2018-11-23 11:38:59,639 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand 333 states. [2018-11-23 11:38:59,639 INFO L87 Difference]: Start difference. First operand 461 states. Second operand 333 states. [2018-11-23 11:38:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:59,650 INFO L93 Difference]: Finished difference Result 461 states and 516 transitions. [2018-11-23 11:38:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 516 transitions. [2018-11-23 11:38:59,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:59,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:59,651 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand 461 states. [2018-11-23 11:38:59,651 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 461 states. [2018-11-23 11:38:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:59,661 INFO L93 Difference]: Finished difference Result 461 states and 516 transitions. [2018-11-23 11:38:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 516 transitions. [2018-11-23 11:38:59,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:59,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:59,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:59,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-23 11:38:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 421 transitions. [2018-11-23 11:38:59,668 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 421 transitions. Word has length 47 [2018-11-23 11:38:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:59,668 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 421 transitions. [2018-11-23 11:38:59,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:38:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 421 transitions. [2018-11-23 11:38:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:38:59,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:59,669 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:38:59,669 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:59,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1299869053, now seen corresponding path program 1 times [2018-11-23 11:38:59,669 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:59,669 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:38:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:59,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:00,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {46128#true} call ULTIMATE.init(); {46128#true} is VALID [2018-11-23 11:39:00,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {46128#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {46128#true} is VALID [2018-11-23 11:39:00,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {46128#true} assume true; {46128#true} is VALID [2018-11-23 11:39:00,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46128#true} {46128#true} #171#return; {46128#true} is VALID [2018-11-23 11:39:00,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {46128#true} call #t~ret7 := main(); {46128#true} is VALID [2018-11-23 11:39:00,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {46128#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {46128#true} is VALID [2018-11-23 11:39:00,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {46128#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {46151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {46151#(= (_ 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; {46151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {46151#(= (_ 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; {46151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {46151#(= (_ 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; {46151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {46151#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {46151#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {46151#(= (_ 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); {46167#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {46167#(= (_ 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; {46167#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {46167#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {46167#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {46167#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {46167#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {46167#(= (_ bv1 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; {46167#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {46167#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46183#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {46183#(= (_ 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; {46183#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {46183#(= (_ 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; {46183#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {46183#(= (_ 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; {46183#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {46183#(= (_ 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; {46183#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {46183#(= (_ 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); {46199#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {46199#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {46199#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {46199#(= (_ 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; {46199#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {46199#(= (_ 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; {46199#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {46199#(= (_ 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); {46212#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {46212#(= (_ 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; {46212#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {46212#(= (_ 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; {46212#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {46212#(= (_ 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; {46212#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {46212#(= (_ 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; {46212#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {46212#(= (_ 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); {46228#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {46228#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {46228#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {46228#(= (_ 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; {46228#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {46228#(= (_ 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; {46228#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {46228#(= (_ 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); {46241#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {46241#(= (_ 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; {46241#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {46241#(= (_ 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; {46241#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,079 INFO L273 TraceCheckUtils]: 37: Hoare triple {46241#(= (_ 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; {46241#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {46241#(= (_ 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; {46241#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {46241#(= (_ 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); {46257#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,082 INFO L273 TraceCheckUtils]: 40: Hoare triple {46257#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {46257#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,083 INFO L273 TraceCheckUtils]: 41: Hoare triple {46257#(= (_ 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; {46257#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {46257#(= (_ 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; {46257#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,086 INFO L273 TraceCheckUtils]: 43: Hoare triple {46257#(= (_ 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); {46270#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,086 INFO L273 TraceCheckUtils]: 44: Hoare triple {46270#(= (_ 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; {46270#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,087 INFO L273 TraceCheckUtils]: 45: Hoare triple {46270#(= (_ 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; {46270#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,087 INFO L273 TraceCheckUtils]: 46: Hoare triple {46270#(= (_ 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; {46280#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:00,088 INFO L273 TraceCheckUtils]: 47: Hoare triple {46280#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {46129#false} is VALID [2018-11-23 11:39:00,088 INFO L273 TraceCheckUtils]: 48: Hoare triple {46129#false} assume !false; {46129#false} is VALID [2018-11-23 11:39:00,089 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:00,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:00,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {46129#false} assume !false; {46129#false} is VALID [2018-11-23 11:39:00,394 INFO L273 TraceCheckUtils]: 47: Hoare triple {46290#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~4; {46129#false} is VALID [2018-11-23 11:39:00,395 INFO L273 TraceCheckUtils]: 46: Hoare triple {46294#(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; {46290#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} is VALID [2018-11-23 11:39:00,396 INFO L273 TraceCheckUtils]: 45: Hoare triple {46294#(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; {46294#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,396 INFO L273 TraceCheckUtils]: 44: Hoare triple {46294#(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; {46294#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,398 INFO L273 TraceCheckUtils]: 43: Hoare triple {46304#(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); {46294#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:00,398 INFO L273 TraceCheckUtils]: 42: Hoare triple {46304#(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; {46304#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:00,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {46304#(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; {46304#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:00,399 INFO L273 TraceCheckUtils]: 40: Hoare triple {46304#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {46304#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:00,402 INFO L273 TraceCheckUtils]: 39: Hoare triple {46317#(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); {46304#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:00,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {46317#(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; {46317#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:00,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {46317#(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; {46317#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:00,404 INFO L273 TraceCheckUtils]: 36: Hoare triple {46317#(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; {46317#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:00,404 INFO L273 TraceCheckUtils]: 35: Hoare triple {46317#(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; {46317#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:00,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {46333#(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); {46317#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:00,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {46333#(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; {46333#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:00,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {46333#(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; {46333#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:00,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {46333#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {46333#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:00,409 INFO L273 TraceCheckUtils]: 30: Hoare triple {46346#(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); {46333#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:00,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {46346#(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; {46346#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:00,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {46346#(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; {46346#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:00,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {46346#(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; {46346#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:00,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {46346#(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; {46346#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:00,413 INFO L273 TraceCheckUtils]: 25: Hoare triple {46362#(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); {46346#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:00,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {46362#(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; {46362#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:00,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {46362#(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; {46362#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:00,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {46362#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {46362#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:00,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {46375#(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); {46362#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:00,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {46375#(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; {46375#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:00,419 INFO L273 TraceCheckUtils]: 19: Hoare triple {46375#(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; {46375#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:00,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {46375#(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; {46375#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:00,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {46375#(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; {46375#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:00,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {46391#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {46375#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:00,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {46391#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 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; {46391#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:00,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {46391#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {46391#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:00,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {46391#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {46391#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:00,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {46391#(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; {46391#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:00,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {46407#(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); {46391#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:00,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {46407#(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; {46407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:00,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {46407#(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; {46407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:00,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {46407#(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; {46407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:00,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {46407#(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; {46407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:00,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {46128#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {46407#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:00,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {46128#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {46128#true} is VALID [2018-11-23 11:39:00,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {46128#true} call #t~ret7 := main(); {46128#true} is VALID [2018-11-23 11:39:00,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46128#true} {46128#true} #171#return; {46128#true} is VALID [2018-11-23 11:39:00,431 INFO L273 TraceCheckUtils]: 2: Hoare triple {46128#true} assume true; {46128#true} is VALID [2018-11-23 11:39:00,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {46128#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {46128#true} is VALID [2018-11-23 11:39:00,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {46128#true} call ULTIMATE.init(); {46128#true} is VALID [2018-11-23 11:39:00,436 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:00,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:00,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:39:00,438 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:39:00,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:00,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:39:00,571 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:00,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:39:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:39:00,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:39:00,573 INFO L87 Difference]: Start difference. First operand 333 states and 421 transitions. Second operand 22 states. [2018-11-23 11:39:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:11,643 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2018-11-23 11:39:11,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:39:11,643 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:39:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 729 transitions. [2018-11-23 11:39:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 729 transitions. [2018-11-23 11:39:11,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 729 transitions. [2018-11-23 11:39:12,740 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:12,760 INFO L225 Difference]: With dead ends: 631 [2018-11-23 11:39:12,760 INFO L226 Difference]: Without dead ends: 629 [2018-11-23 11:39:12,761 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:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-11-23 11:39:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 336. [2018-11-23 11:39:13,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:13,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 629 states. Second operand 336 states. [2018-11-23 11:39:13,242 INFO L74 IsIncluded]: Start isIncluded. First operand 629 states. Second operand 336 states. [2018-11-23 11:39:13,242 INFO L87 Difference]: Start difference. First operand 629 states. Second operand 336 states. [2018-11-23 11:39:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:13,260 INFO L93 Difference]: Finished difference Result 629 states and 718 transitions. [2018-11-23 11:39:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 718 transitions. [2018-11-23 11:39:13,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:13,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:13,260 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand 629 states. [2018-11-23 11:39:13,260 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 629 states. [2018-11-23 11:39:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:13,277 INFO L93 Difference]: Finished difference Result 629 states and 718 transitions. [2018-11-23 11:39:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 718 transitions. [2018-11-23 11:39:13,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:13,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:13,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:13,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-23 11:39:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 418 transitions. [2018-11-23 11:39:13,283 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 418 transitions. Word has length 49 [2018-11-23 11:39:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:13,284 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 418 transitions. [2018-11-23 11:39:13,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:39:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 418 transitions. [2018-11-23 11:39:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:39:13,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:13,284 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:13,284 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:13,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1298329853, now seen corresponding path program 1 times [2018-11-23 11:39:13,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:13,285 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:13,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:13,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:13,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {48905#true} call ULTIMATE.init(); {48905#true} is VALID [2018-11-23 11:39:13,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {48905#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {48905#true} is VALID [2018-11-23 11:39:13,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {48905#true} assume true; {48905#true} is VALID [2018-11-23 11:39:13,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48905#true} {48905#true} #171#return; {48905#true} is VALID [2018-11-23 11:39:13,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {48905#true} call #t~ret7 := main(); {48905#true} is VALID [2018-11-23 11:39:13,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {48905#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {48905#true} is VALID [2018-11-23 11:39:13,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {48905#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {48928#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {48928#(= (_ 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; {48928#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {48928#(= (_ 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; {48928#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {48928#(= (_ 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; {48928#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {48928#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {48928#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {48928#(= (_ 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); {48944#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {48944#(= (_ 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; {48944#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {48944#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {48944#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {48944#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {48944#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {48944#(= (_ bv1 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; {48944#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {48944#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {48960#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {48960#(= (_ 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; {48960#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {48960#(= (_ 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; {48960#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {48960#(= (_ 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; {48960#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {48960#(= (_ 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; {48960#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,563 INFO L273 TraceCheckUtils]: 21: Hoare triple {48960#(= (_ 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); {48976#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {48976#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {48976#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,564 INFO L273 TraceCheckUtils]: 23: Hoare triple {48976#(= (_ 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; {48976#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {48976#(= (_ 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; {48976#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,565 INFO L273 TraceCheckUtils]: 25: Hoare triple {48976#(= (_ 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); {48989#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,566 INFO L273 TraceCheckUtils]: 26: Hoare triple {48989#(= (_ 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; {48989#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,566 INFO L273 TraceCheckUtils]: 27: Hoare triple {48989#(= (_ 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; {48989#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,567 INFO L273 TraceCheckUtils]: 28: Hoare triple {48989#(= (_ 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; {48989#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {48989#(= (_ 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; {48989#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {48989#(= (_ 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); {49005#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,588 INFO L273 TraceCheckUtils]: 31: Hoare triple {49005#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {49005#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {49005#(= (_ 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; {49005#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {49005#(= (_ 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; {49005#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {49005#(= (_ 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); {49018#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {49018#(= (_ 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; {49018#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {49018#(= (_ 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; {49018#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,590 INFO L273 TraceCheckUtils]: 37: Hoare triple {49018#(= (_ 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; {49018#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,590 INFO L273 TraceCheckUtils]: 38: Hoare triple {49018#(= (_ 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; {49018#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,592 INFO L273 TraceCheckUtils]: 39: Hoare triple {49018#(= (_ 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); {49034#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,593 INFO L273 TraceCheckUtils]: 40: Hoare triple {49034#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {49034#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,593 INFO L273 TraceCheckUtils]: 41: Hoare triple {49034#(= (_ 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; {49034#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,593 INFO L273 TraceCheckUtils]: 42: Hoare triple {49034#(= (_ 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; {49034#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,594 INFO L273 TraceCheckUtils]: 43: Hoare triple {49034#(= (_ 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); {49047#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,594 INFO L273 TraceCheckUtils]: 44: Hoare triple {49047#(= (_ 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; {49047#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,594 INFO L273 TraceCheckUtils]: 45: Hoare triple {49047#(= (_ 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; {49047#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,595 INFO L273 TraceCheckUtils]: 46: Hoare triple {49047#(= (_ 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; {49057#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:13,595 INFO L273 TraceCheckUtils]: 47: Hoare triple {49057#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {48906#false} is VALID [2018-11-23 11:39:13,596 INFO L273 TraceCheckUtils]: 48: Hoare triple {48906#false} assume !false; {48906#false} is VALID [2018-11-23 11:39:13,598 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:13,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:13,974 INFO L273 TraceCheckUtils]: 48: Hoare triple {48906#false} assume !false; {48906#false} is VALID [2018-11-23 11:39:13,975 INFO L273 TraceCheckUtils]: 47: Hoare triple {49067#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~10; {48906#false} is VALID [2018-11-23 11:39:13,976 INFO L273 TraceCheckUtils]: 46: Hoare triple {49071#(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; {49067#(not (= main_~__VERIFIER_assert__cond~10 (_ bv0 32)))} is VALID [2018-11-23 11:39:13,976 INFO L273 TraceCheckUtils]: 45: Hoare triple {49071#(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; {49071#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,977 INFO L273 TraceCheckUtils]: 44: Hoare triple {49071#(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; {49071#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,978 INFO L273 TraceCheckUtils]: 43: Hoare triple {49081#(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); {49071#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:13,979 INFO L273 TraceCheckUtils]: 42: Hoare triple {49081#(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; {49081#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:13,979 INFO L273 TraceCheckUtils]: 41: Hoare triple {49081#(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; {49081#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:13,980 INFO L273 TraceCheckUtils]: 40: Hoare triple {49081#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {49081#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:13,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {49094#(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); {49081#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:13,982 INFO L273 TraceCheckUtils]: 38: Hoare triple {49094#(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; {49094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:13,982 INFO L273 TraceCheckUtils]: 37: Hoare triple {49094#(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; {49094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:13,983 INFO L273 TraceCheckUtils]: 36: Hoare triple {49094#(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; {49094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:13,983 INFO L273 TraceCheckUtils]: 35: Hoare triple {49094#(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; {49094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:13,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {49110#(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); {49094#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:13,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {49110#(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; {49110#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:13,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {49110#(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; {49110#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:13,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {49110#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {49110#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:13,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {49123#(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); {49110#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:13,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {49123#(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; {49123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:13,991 INFO L273 TraceCheckUtils]: 28: Hoare triple {49123#(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; {49123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:13,991 INFO L273 TraceCheckUtils]: 27: Hoare triple {49123#(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; {49123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:13,991 INFO L273 TraceCheckUtils]: 26: Hoare triple {49123#(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; {49123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:13,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {49139#(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); {49123#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:13,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {49139#(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; {49139#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:13,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {49139#(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; {49139#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:13,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {49139#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {49139#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:13,997 INFO L273 TraceCheckUtils]: 21: Hoare triple {49152#(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); {49139#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:13,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {49152#(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; {49152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:13,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {49152#(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; {49152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:13,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {49152#(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; {49152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:13,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {49152#(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; {49152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:14,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {49168#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {49152#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:14,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {49168#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 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; {49168#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:14,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {49168#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {49168#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:14,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {49168#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {49168#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:14,004 INFO L273 TraceCheckUtils]: 12: Hoare triple {49168#(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; {49168#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:14,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {49184#(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); {49168#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:14,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {49184#(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; {49184#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:14,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {49184#(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; {49184#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:14,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {49184#(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; {49184#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:14,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {49184#(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; {49184#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:14,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {48905#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {49184#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:14,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {48905#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {48905#true} is VALID [2018-11-23 11:39:14,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {48905#true} call #t~ret7 := main(); {48905#true} is VALID [2018-11-23 11:39:14,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48905#true} {48905#true} #171#return; {48905#true} is VALID [2018-11-23 11:39:14,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {48905#true} assume true; {48905#true} is VALID [2018-11-23 11:39:14,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {48905#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {48905#true} is VALID [2018-11-23 11:39:14,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {48905#true} call ULTIMATE.init(); {48905#true} is VALID [2018-11-23 11:39:14,011 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:14,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:14,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:39:14,013 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:39:14,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:14,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:39:14,150 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:14,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:39:14,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:39:14,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:39:14,151 INFO L87 Difference]: Start difference. First operand 336 states and 418 transitions. Second operand 22 states. [2018-11-23 11:39:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:23,841 INFO L93 Difference]: Finished difference Result 423 states and 487 transitions. [2018-11-23 11:39:23,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:39:23,841 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 11:39:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 487 transitions. [2018-11-23 11:39:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:39:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 487 transitions. [2018-11-23 11:39:23,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 487 transitions. [2018-11-23 11:39:24,547 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:24,558 INFO L225 Difference]: With dead ends: 423 [2018-11-23 11:39:24,558 INFO L226 Difference]: Without dead ends: 411 [2018-11-23 11:39:24,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=467, Invalid=1093, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:39:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-11-23 11:39:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 337. [2018-11-23 11:39:25,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:25,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand 337 states. [2018-11-23 11:39:25,032 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand 337 states. [2018-11-23 11:39:25,032 INFO L87 Difference]: Start difference. First operand 411 states. Second operand 337 states. [2018-11-23 11:39:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:25,042 INFO L93 Difference]: Finished difference Result 411 states and 466 transitions. [2018-11-23 11:39:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 466 transitions. [2018-11-23 11:39:25,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:25,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:25,042 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 411 states. [2018-11-23 11:39:25,042 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 411 states. [2018-11-23 11:39:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:25,051 INFO L93 Difference]: Finished difference Result 411 states and 466 transitions. [2018-11-23 11:39:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 466 transitions. [2018-11-23 11:39:25,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:25,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:25,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:25,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-23 11:39:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 410 transitions. [2018-11-23 11:39:25,057 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 410 transitions. Word has length 49 [2018-11-23 11:39:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:25,057 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 410 transitions. [2018-11-23 11:39:25,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:39:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 410 transitions. [2018-11-23 11:39:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:39:25,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:25,058 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:25,059 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:25,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:25,059 INFO L82 PathProgramCache]: Analyzing trace with hash -122455789, now seen corresponding path program 2 times [2018-11-23 11:39:25,059 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:25,059 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:25,086 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:39:25,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:39:25,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:25,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:25,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {50990#true} call ULTIMATE.init(); {50990#true} is VALID [2018-11-23 11:39:25,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {50990#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {50990#true} is VALID [2018-11-23 11:39:25,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {50990#true} assume true; {50990#true} is VALID [2018-11-23 11:39:25,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50990#true} {50990#true} #171#return; {50990#true} is VALID [2018-11-23 11:39:25,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {50990#true} call #t~ret7 := main(); {50990#true} is VALID [2018-11-23 11:39:25,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {50990#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {50990#true} is VALID [2018-11-23 11:39:25,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {50990#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {51013#(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); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,327 INFO L273 TraceCheckUtils]: 19: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {51013#(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); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,335 INFO L273 TraceCheckUtils]: 23: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {51013#(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); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,337 INFO L273 TraceCheckUtils]: 26: Hoare triple {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,339 INFO L273 TraceCheckUtils]: 27: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,339 INFO L273 TraceCheckUtils]: 28: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {51013#(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); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,341 INFO L273 TraceCheckUtils]: 30: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,365 INFO L273 TraceCheckUtils]: 33: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {51013#(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); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,400 INFO L273 TraceCheckUtils]: 35: Hoare triple {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {51013#(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); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,417 INFO L273 TraceCheckUtils]: 42: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,417 INFO L273 TraceCheckUtils]: 43: Hoare triple {51013#(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); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,419 INFO L273 TraceCheckUtils]: 44: Hoare triple {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} assume !(~main__t~0 == ~main__tagbuf_len~0); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,419 INFO L273 TraceCheckUtils]: 45: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,421 INFO L273 TraceCheckUtils]: 46: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,421 INFO L273 TraceCheckUtils]: 47: Hoare triple {51013#(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); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,423 INFO L273 TraceCheckUtils]: 48: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,425 INFO L273 TraceCheckUtils]: 50: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,425 INFO L273 TraceCheckUtils]: 51: Hoare triple {51013#(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; {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {51013#(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); {51013#(bvsge (bvadd main_~main__tagbuf_len~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-23 11:39:25,429 INFO L273 TraceCheckUtils]: 53: Hoare triple {51013#(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; {51155#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:25,431 INFO L273 TraceCheckUtils]: 54: Hoare triple {51155#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~6; {50991#false} is VALID [2018-11-23 11:39:25,431 INFO L273 TraceCheckUtils]: 55: Hoare triple {50991#false} assume !false; {50991#false} is VALID [2018-11-23 11:39:25,434 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:25,434 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:25,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:25,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:39:25,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-23 11:39:25,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:25,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:39:25,484 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:25,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:39:25,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:39:25,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:39:25,485 INFO L87 Difference]: Start difference. First operand 337 states and 410 transitions. Second operand 4 states. [2018-11-23 11:39:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:26,244 INFO L93 Difference]: Finished difference Result 337 states and 410 transitions. [2018-11-23 11:39:26,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:39:26,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-23 11:39:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:39:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 11:39:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:39:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 11:39:26,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-23 11:39:26,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:26,336 INFO L225 Difference]: With dead ends: 337 [2018-11-23 11:39:26,336 INFO L226 Difference]: Without dead ends: 334 [2018-11-23 11:39:26,336 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:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-23 11:39:27,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2018-11-23 11:39:27,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:27,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:27,041 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:27,041 INFO L87 Difference]: Start difference. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:27,048 INFO L93 Difference]: Finished difference Result 334 states and 400 transitions. [2018-11-23 11:39:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2018-11-23 11:39:27,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:27,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:27,049 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:27,049 INFO L87 Difference]: Start difference. First operand 334 states. Second operand 334 states. [2018-11-23 11:39:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:27,054 INFO L93 Difference]: Finished difference Result 334 states and 400 transitions. [2018-11-23 11:39:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2018-11-23 11:39:27,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:27,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:27,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:27,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-23 11:39:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 400 transitions. [2018-11-23 11:39:27,061 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 400 transitions. Word has length 56 [2018-11-23 11:39:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:27,061 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 400 transitions. [2018-11-23 11:39:27,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:39:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2018-11-23 11:39:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:39:27,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:27,062 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:27,062 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:27,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:27,062 INFO L82 PathProgramCache]: Analyzing trace with hash 499267958, now seen corresponding path program 2 times [2018-11-23 11:39:27,062 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:27,062 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 57 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 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:27,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:39:27,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:39:27,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:27,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:27,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {52650#true} call ULTIMATE.init(); {52650#true} is VALID [2018-11-23 11:39:27,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {52650#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {52650#true} is VALID [2018-11-23 11:39:27,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {52650#true} assume true; {52650#true} is VALID [2018-11-23 11:39:27,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52650#true} {52650#true} #171#return; {52650#true} is VALID [2018-11-23 11:39:27,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {52650#true} call #t~ret7 := main(); {52650#true} is VALID [2018-11-23 11:39:27,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {52650#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {52650#true} is VALID [2018-11-23 11:39:27,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {52650#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {52673#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:27,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {52673#(= (_ 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; {52673#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:27,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {52673#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {52673#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:27,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {52673#(= (_ bv0 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {52673#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:27,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {52673#(= (_ 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; {52686#(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:27,585 INFO L273 TraceCheckUtils]: 11: Hoare triple {52686#(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);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {52690#(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); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {52690#(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); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {52690#(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); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,593 INFO L273 TraceCheckUtils]: 29: Hoare triple {52690#(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); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,594 INFO L273 TraceCheckUtils]: 31: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,596 INFO L273 TraceCheckUtils]: 34: Hoare triple {52690#(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); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,596 INFO L273 TraceCheckUtils]: 35: Hoare triple {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,597 INFO L273 TraceCheckUtils]: 37: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {52690#(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); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,598 INFO L273 TraceCheckUtils]: 39: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,599 INFO L273 TraceCheckUtils]: 41: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,600 INFO L273 TraceCheckUtils]: 42: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,600 INFO L273 TraceCheckUtils]: 43: Hoare triple {52690#(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); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,601 INFO L273 TraceCheckUtils]: 44: Hoare triple {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,602 INFO L273 TraceCheckUtils]: 45: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,602 INFO L273 TraceCheckUtils]: 46: Hoare triple {52690#(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; {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,603 INFO L273 TraceCheckUtils]: 47: Hoare triple {52690#(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); {52690#(bvsle (_ bv0 32) main_~main__tagbuf_len~0)} is VALID [2018-11-23 11:39:27,603 INFO L273 TraceCheckUtils]: 48: Hoare triple {52690#(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; {52802#(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:27,604 INFO L273 TraceCheckUtils]: 49: Hoare triple {52802#(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; {52802#(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:27,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {52802#(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; {52809#(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:27,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {52809#(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; {52813#(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:27,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {52813#(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); {52817#(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:27,629 INFO L273 TraceCheckUtils]: 53: Hoare triple {52817#(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); {52817#(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:27,631 INFO L273 TraceCheckUtils]: 54: Hoare triple {52817#(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; {52824#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:27,631 INFO L273 TraceCheckUtils]: 55: Hoare triple {52824#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {52651#false} is VALID [2018-11-23 11:39:27,631 INFO L273 TraceCheckUtils]: 56: Hoare triple {52651#false} assume !false; {52651#false} is VALID [2018-11-23 11:39:27,636 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:27,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:27,986 INFO L273 TraceCheckUtils]: 56: Hoare triple {52651#false} assume !false; {52651#false} is VALID [2018-11-23 11:39:27,986 INFO L273 TraceCheckUtils]: 55: Hoare triple {52834#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {52651#false} is VALID [2018-11-23 11:39:27,987 INFO L273 TraceCheckUtils]: 54: Hoare triple {52838#(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; {52834#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} is VALID [2018-11-23 11:39:27,987 INFO L273 TraceCheckUtils]: 53: Hoare triple {52838#(bvsle (_ bv0 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {52838#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:27,988 INFO L273 TraceCheckUtils]: 52: Hoare triple {52845#(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); {52838#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:27,989 INFO L273 TraceCheckUtils]: 51: Hoare triple {52849#(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; {52845#(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:27,991 INFO L273 TraceCheckUtils]: 50: Hoare triple {52853#(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; {52849#(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:27,991 INFO L273 TraceCheckUtils]: 49: Hoare triple {52853#(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; {52853#(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:27,993 INFO L273 TraceCheckUtils]: 48: Hoare triple {52650#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; {52853#(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:27,993 INFO L273 TraceCheckUtils]: 47: Hoare triple {52650#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52650#true} is VALID [2018-11-23 11:39:27,994 INFO L273 TraceCheckUtils]: 46: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {52650#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {52650#true} is VALID [2018-11-23 11:39:27,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {52650#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52650#true} is VALID [2018-11-23 11:39:27,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,995 INFO L273 TraceCheckUtils]: 40: Hoare triple {52650#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {52650#true} is VALID [2018-11-23 11:39:27,995 INFO L273 TraceCheckUtils]: 39: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,995 INFO L273 TraceCheckUtils]: 38: Hoare triple {52650#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52650#true} is VALID [2018-11-23 11:39:27,995 INFO L273 TraceCheckUtils]: 37: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,995 INFO L273 TraceCheckUtils]: 36: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {52650#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {52650#true} is VALID [2018-11-23 11:39:27,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {52650#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52650#true} is VALID [2018-11-23 11:39:27,995 INFO L273 TraceCheckUtils]: 33: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,996 INFO L273 TraceCheckUtils]: 31: Hoare triple {52650#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {52650#true} is VALID [2018-11-23 11:39:27,996 INFO L273 TraceCheckUtils]: 30: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {52650#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52650#true} is VALID [2018-11-23 11:39:27,996 INFO L273 TraceCheckUtils]: 28: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,996 INFO L273 TraceCheckUtils]: 27: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {52650#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {52650#true} is VALID [2018-11-23 11:39:27,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {52650#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52650#true} is VALID [2018-11-23 11:39:27,996 INFO L273 TraceCheckUtils]: 24: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,996 INFO L273 TraceCheckUtils]: 23: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {52650#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {52650#true} is VALID [2018-11-23 11:39:27,997 INFO L273 TraceCheckUtils]: 21: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,997 INFO L273 TraceCheckUtils]: 20: Hoare triple {52650#true} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52650#true} is VALID [2018-11-23 11:39:27,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {52650#true} assume !(~main__t~0 == ~main__tagbuf_len~0); {52650#true} is VALID [2018-11-23 11:39:27,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {52650#true} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52650#true} is VALID [2018-11-23 11:39:27,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {52650#true} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {52650#true} is VALID [2018-11-23 11:39:27,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {52650#true} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {52650#true} is VALID [2018-11-23 11:39:27,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {52650#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {52650#true} is VALID [2018-11-23 11:39:27,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {52650#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {52650#true} is VALID [2018-11-23 11:39:27,998 INFO L273 TraceCheckUtils]: 7: Hoare triple {52650#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; {52650#true} is VALID [2018-11-23 11:39:27,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {52650#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {52650#true} is VALID [2018-11-23 11:39:27,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {52650#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {52650#true} is VALID [2018-11-23 11:39:27,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {52650#true} call #t~ret7 := main(); {52650#true} is VALID [2018-11-23 11:39:27,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52650#true} {52650#true} #171#return; {52650#true} is VALID [2018-11-23 11:39:27,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {52650#true} assume true; {52650#true} is VALID [2018-11-23 11:39:27,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {52650#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {52650#true} is VALID [2018-11-23 11:39:27,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {52650#true} call ULTIMATE.init(); {52650#true} is VALID [2018-11-23 11:39:28,001 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:28,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:39:28,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-11-23 11:39:28,003 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-23 11:39:28,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:28,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:39:28,100 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:28,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:39:28,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:39:28,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:39:28,101 INFO L87 Difference]: Start difference. First operand 334 states and 400 transitions. Second operand 15 states. [2018-11-23 11:39:29,691 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-11-23 11:39:29,998 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2018-11-23 11:39:30,282 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-11-23 11:39:31,583 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-11-23 11:39:32,218 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-11-23 11:39:33,176 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-23 11:39:33,609 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:34,085 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-23 11:39:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:37,973 INFO L93 Difference]: Finished difference Result 1024 states and 1240 transitions. [2018-11-23 11:39:37,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 11:39:37,974 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-23 11:39:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:39:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 161 transitions. [2018-11-23 11:39:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:39:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 161 transitions. [2018-11-23 11:39:37,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 161 transitions. [2018-11-23 11:39:38,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:38,619 INFO L225 Difference]: With dead ends: 1024 [2018-11-23 11:39:38,620 INFO L226 Difference]: Without dead ends: 1022 [2018-11-23 11:39:38,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=707, Invalid=2833, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:39:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2018-11-23 11:39:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 350. [2018-11-23 11:39:39,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:39,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1022 states. Second operand 350 states. [2018-11-23 11:39:39,599 INFO L74 IsIncluded]: Start isIncluded. First operand 1022 states. Second operand 350 states. [2018-11-23 11:39:39,599 INFO L87 Difference]: Start difference. First operand 1022 states. Second operand 350 states. [2018-11-23 11:39:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:39,643 INFO L93 Difference]: Finished difference Result 1022 states and 1223 transitions. [2018-11-23 11:39:39,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1223 transitions. [2018-11-23 11:39:39,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:39,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:39,644 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand 1022 states. [2018-11-23 11:39:39,645 INFO L87 Difference]: Start difference. First operand 350 states. Second operand 1022 states. [2018-11-23 11:39:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:39,683 INFO L93 Difference]: Finished difference Result 1022 states and 1223 transitions. [2018-11-23 11:39:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1223 transitions. [2018-11-23 11:39:39,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:39,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:39,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:39,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-11-23 11:39:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 416 transitions. [2018-11-23 11:39:39,690 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 416 transitions. Word has length 57 [2018-11-23 11:39:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:39,690 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 416 transitions. [2018-11-23 11:39:39,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:39:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 416 transitions. [2018-11-23 11:39:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:39:39,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:39,690 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 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:39,691 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:39,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash 690919302, now seen corresponding path program 1 times [2018-11-23 11:39:39,691 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:39,691 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 58 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 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:39,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:39:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:39,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:40,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {56878#true} call ULTIMATE.init(); {56878#true} is VALID [2018-11-23 11:39:40,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {56878#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {56878#true} is VALID [2018-11-23 11:39:40,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {56878#true} assume true; {56878#true} is VALID [2018-11-23 11:39:40,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56878#true} {56878#true} #171#return; {56878#true} is VALID [2018-11-23 11:39:40,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {56878#true} call #t~ret7 := main(); {56878#true} is VALID [2018-11-23 11:39:40,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {56878#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {56878#true} is VALID [2018-11-23 11:39:40,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {56878#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {56901#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {56901#(= (_ 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; {56901#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {56901#(= (_ 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; {56901#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {56901#(= (_ 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; {56901#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {56901#(= (_ bv0 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {56901#(= (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {56901#(= (_ 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); {56917#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {56917#(= (_ 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; {56917#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {56917#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {56917#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {56917#(= (_ bv1 32) main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {56917#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {56917#(= (_ bv1 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; {56917#(= (_ bv1 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {56917#(= (_ bv1 32) main_~main__t~0)} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {56933#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {56933#(= (_ 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; {56933#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,151 INFO L273 TraceCheckUtils]: 18: Hoare triple {56933#(= (_ 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; {56933#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,151 INFO L273 TraceCheckUtils]: 19: Hoare triple {56933#(= (_ 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; {56933#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {56933#(= (_ 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; {56933#(= (_ bv2 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {56933#(= (_ 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); {56949#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,154 INFO L273 TraceCheckUtils]: 22: Hoare triple {56949#(= (_ bv3 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {56949#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,155 INFO L273 TraceCheckUtils]: 23: Hoare triple {56949#(= (_ 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; {56949#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,155 INFO L273 TraceCheckUtils]: 24: Hoare triple {56949#(= (_ 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; {56949#(= (_ bv3 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,156 INFO L273 TraceCheckUtils]: 25: Hoare triple {56949#(= (_ 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); {56962#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,156 INFO L273 TraceCheckUtils]: 26: Hoare triple {56962#(= (_ 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; {56962#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,157 INFO L273 TraceCheckUtils]: 27: Hoare triple {56962#(= (_ 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; {56962#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,157 INFO L273 TraceCheckUtils]: 28: Hoare triple {56962#(= (_ 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; {56962#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {56962#(= (_ 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; {56962#(= (_ bv4 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,159 INFO L273 TraceCheckUtils]: 30: Hoare triple {56962#(= (_ 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); {56978#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,159 INFO L273 TraceCheckUtils]: 31: Hoare triple {56978#(= (_ bv5 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {56978#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,160 INFO L273 TraceCheckUtils]: 32: Hoare triple {56978#(= (_ 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; {56978#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {56978#(= (_ 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; {56978#(= (_ bv5 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,161 INFO L273 TraceCheckUtils]: 34: Hoare triple {56978#(= (_ 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); {56991#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,161 INFO L273 TraceCheckUtils]: 35: Hoare triple {56991#(= (_ 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; {56991#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,162 INFO L273 TraceCheckUtils]: 36: Hoare triple {56991#(= (_ 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; {56991#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,162 INFO L273 TraceCheckUtils]: 37: Hoare triple {56991#(= (_ 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; {56991#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,163 INFO L273 TraceCheckUtils]: 38: Hoare triple {56991#(= (_ 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; {56991#(= (_ bv6 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,165 INFO L273 TraceCheckUtils]: 39: Hoare triple {56991#(= (_ 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); {57007#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,165 INFO L273 TraceCheckUtils]: 40: Hoare triple {57007#(= (_ bv7 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {57007#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,166 INFO L273 TraceCheckUtils]: 41: Hoare triple {57007#(= (_ 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; {57007#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,166 INFO L273 TraceCheckUtils]: 42: Hoare triple {57007#(= (_ 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; {57007#(= (_ bv7 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {57007#(= (_ 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); {57020#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,167 INFO L273 TraceCheckUtils]: 44: Hoare triple {57020#(= (_ 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; {57020#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,167 INFO L273 TraceCheckUtils]: 45: Hoare triple {57020#(= (_ 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; {57020#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,168 INFO L273 TraceCheckUtils]: 46: Hoare triple {57020#(= (_ 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; {57020#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,168 INFO L273 TraceCheckUtils]: 47: Hoare triple {57020#(= (_ bv8 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; {57020#(= (_ bv8 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,169 INFO L273 TraceCheckUtils]: 48: Hoare triple {57020#(= (_ bv8 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); {57036#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,169 INFO L273 TraceCheckUtils]: 49: Hoare triple {57036#(= (_ bv9 32) main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {57036#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,170 INFO L273 TraceCheckUtils]: 50: Hoare triple {57036#(= (_ bv9 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; {57036#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,170 INFO L273 TraceCheckUtils]: 51: Hoare triple {57036#(= (_ bv9 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; {57036#(= (_ bv9 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,171 INFO L273 TraceCheckUtils]: 52: Hoare triple {57036#(= (_ bv9 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); {57049#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,171 INFO L273 TraceCheckUtils]: 53: Hoare triple {57049#(= (_ bv10 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; {57049#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,172 INFO L273 TraceCheckUtils]: 54: Hoare triple {57049#(= (_ bv10 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; {57049#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,172 INFO L273 TraceCheckUtils]: 55: Hoare triple {57049#(= (_ bv10 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {57049#(= (_ bv10 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,173 INFO L273 TraceCheckUtils]: 56: Hoare triple {57049#(= (_ bv10 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; {57062#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:40,174 INFO L273 TraceCheckUtils]: 57: Hoare triple {57062#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {56879#false} is VALID [2018-11-23 11:39:40,174 INFO L273 TraceCheckUtils]: 58: Hoare triple {56879#false} assume !false; {56879#false} is VALID [2018-11-23 11:39:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:40,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:40,774 INFO L273 TraceCheckUtils]: 58: Hoare triple {56879#false} assume !false; {56879#false} is VALID [2018-11-23 11:39:40,774 INFO L273 TraceCheckUtils]: 57: Hoare triple {57072#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~8; {56879#false} is VALID [2018-11-23 11:39:40,776 INFO L273 TraceCheckUtils]: 56: Hoare triple {57076#(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; {57072#(not (= main_~__VERIFIER_assert__cond~8 (_ bv0 32)))} is VALID [2018-11-23 11:39:40,776 INFO L273 TraceCheckUtils]: 55: Hoare triple {57076#(bvsle (_ bv0 32) main_~main__t~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_4~0); {57076#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,778 INFO L273 TraceCheckUtils]: 54: Hoare triple {57076#(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; {57076#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,778 INFO L273 TraceCheckUtils]: 53: Hoare triple {57076#(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; {57076#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,780 INFO L273 TraceCheckUtils]: 52: Hoare triple {57089#(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); {57076#(bvsle (_ bv0 32) main_~main__t~0)} is VALID [2018-11-23 11:39:40,780 INFO L273 TraceCheckUtils]: 51: Hoare triple {57089#(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; {57089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:40,782 INFO L273 TraceCheckUtils]: 50: Hoare triple {57089#(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; {57089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:40,782 INFO L273 TraceCheckUtils]: 49: Hoare triple {57089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {57089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:40,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {57102#(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); {57089#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv1 32)))} is VALID [2018-11-23 11:39:40,787 INFO L273 TraceCheckUtils]: 47: Hoare triple {57102#(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; {57102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:40,787 INFO L273 TraceCheckUtils]: 46: Hoare triple {57102#(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; {57102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:40,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {57102#(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; {57102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:40,789 INFO L273 TraceCheckUtils]: 44: Hoare triple {57102#(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; {57102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:40,791 INFO L273 TraceCheckUtils]: 43: Hoare triple {57118#(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); {57102#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:40,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {57118#(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; {57118#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:40,793 INFO L273 TraceCheckUtils]: 41: Hoare triple {57118#(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; {57118#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:40,793 INFO L273 TraceCheckUtils]: 40: Hoare triple {57118#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {57118#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:40,795 INFO L273 TraceCheckUtils]: 39: Hoare triple {57131#(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); {57118#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv3 32)))} is VALID [2018-11-23 11:39:40,795 INFO L273 TraceCheckUtils]: 38: Hoare triple {57131#(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; {57131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:40,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {57131#(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; {57131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:40,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {57131#(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; {57131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:40,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {57131#(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; {57131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:40,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {57147#(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); {57131#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv4 32)))} is VALID [2018-11-23 11:39:40,802 INFO L273 TraceCheckUtils]: 33: Hoare triple {57147#(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; {57147#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:40,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {57147#(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; {57147#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:40,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {57147#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {57147#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:40,806 INFO L273 TraceCheckUtils]: 30: Hoare triple {57160#(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); {57147#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv5 32)))} is VALID [2018-11-23 11:39:40,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {57160#(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; {57160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:40,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {57160#(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; {57160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:40,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {57160#(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; {57160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:40,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {57160#(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; {57160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:40,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {57176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_7~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {57160#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv6 32)))} is VALID [2018-11-23 11:39:40,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {57176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 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; {57176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:40,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {57176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 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; {57176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:40,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {57176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} assume !(~main__t~0 == ~main__tagbuf_len~0); {57176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:40,821 INFO L273 TraceCheckUtils]: 21: Hoare triple {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {57176#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv7 32)))} is VALID [2018-11-23 11:39:40,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 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; {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:40,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 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; {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:40,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:40,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 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; {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:40,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~bvadd32(1bv32, ~main__t~0); {57189#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv8 32)))} is VALID [2018-11-23 11:39:40,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 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; {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 32)))} is VALID [2018-11-23 11:39:40,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 32)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 32)))} is VALID [2018-11-23 11:39:40,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 32)))} assume !(0bv32 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 32)))} is VALID [2018-11-23 11:39:40,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 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; {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 32)))} is VALID [2018-11-23 11:39:40,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 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); {57205#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv9 32)))} is VALID [2018-11-23 11:39:40,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 32)))} assume !(0bv32 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 32)))} is VALID [2018-11-23 11:39:40,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 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; {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 32)))} is VALID [2018-11-23 11:39:40,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 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; {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 32)))} is VALID [2018-11-23 11:39:40,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 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; {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 32)))} is VALID [2018-11-23 11:39:40,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {56878#true} assume ~bvsge32(~main__tagbuf_len~0, 1bv32);~main__t~0 := 0bv32;~main__tagbuf_len~0 := ~bvsub32(~main__tagbuf_len~0, 1bv32); {57221#(bvsle (_ bv0 32) (bvadd main_~main__t~0 (_ bv10 32)))} is VALID [2018-11-23 11:39:40,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {56878#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {56878#true} is VALID [2018-11-23 11:39:40,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {56878#true} call #t~ret7 := main(); {56878#true} is VALID [2018-11-23 11:39:40,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {56878#true} {56878#true} #171#return; {56878#true} is VALID [2018-11-23 11:39:40,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {56878#true} assume true; {56878#true} is VALID [2018-11-23 11:39:40,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {56878#true} ~__return_main~0 := 0bv32;~__tmp_247_0~0 := 0bv32;~__return_305~0 := 0bv32;~__tmp_383_0~0 := 0bv32; {56878#true} is VALID [2018-11-23 11:39:40,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {56878#true} call ULTIMATE.init(); {56878#true} is VALID [2018-11-23 11:39:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:40,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:40,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 11:39:40,845 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-23 11:39:40,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:40,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:39:41,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:41,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:39:41,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:39:41,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:39:41,056 INFO L87 Difference]: Start difference. First operand 350 states and 416 transitions. Second operand 26 states.