/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:38:15,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:38:15,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:38:15,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:38:15,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:38:15,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:38:15,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:38:15,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:38:15,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:38:15,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:38:15,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:38:15,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:38:15,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:38:15,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:38:15,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:38:15,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:38:15,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:38:15,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:38:15,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:38:15,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:38:15,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:38:15,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:38:15,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:38:15,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:38:15,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:38:15,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:38:15,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:38:15,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:38:15,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:38:15,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:38:15,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:38:15,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:38:15,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:38:15,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:38:15,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:38:15,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:38:15,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:38:15,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:38:15,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:38:15,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:38:15,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:38:15,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:38:15,862 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:38:15,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:38:15,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:38:15,866 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:38:15,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:38:15,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:38:15,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:38:15,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:38:15,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:38:15,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:38:15,867 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:38:15,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:38:15,867 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:38:15,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:38:15,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:38:15,868 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:38:15,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:38:15,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:38:15,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:38:15,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:38:15,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:38:15,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:38:15,874 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:38:16,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:38:16,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:38:16,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:38:16,205 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:38:16,206 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:38:16,207 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2020-07-08 17:38:16,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6443e51/2f30c54566184822b90442f48a424f67/FLAG048f26b8d [2020-07-08 17:38:16,837 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:38:16,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2020-07-08 17:38:16,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6443e51/2f30c54566184822b90442f48a424f67/FLAG048f26b8d [2020-07-08 17:38:17,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a6443e51/2f30c54566184822b90442f48a424f67 [2020-07-08 17:38:17,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:38:17,198 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:38:17,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:38:17,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:38:17,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:38:17,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:38:17" (1/1) ... [2020-07-08 17:38:17,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157c064b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17, skipping insertion in model container [2020-07-08 17:38:17,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:38:17" (1/1) ... [2020-07-08 17:38:17,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:38:17,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:38:17,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:38:17,445 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:38:17,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:38:17,488 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:38:17,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17 WrapperNode [2020-07-08 17:38:17,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:38:17,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:38:17,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:38:17,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:38:17,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17" (1/1) ... [2020-07-08 17:38:17,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17" (1/1) ... [2020-07-08 17:38:17,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17" (1/1) ... [2020-07-08 17:38:17,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17" (1/1) ... [2020-07-08 17:38:17,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17" (1/1) ... [2020-07-08 17:38:17,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17" (1/1) ... [2020-07-08 17:38:17,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17" (1/1) ... [2020-07-08 17:38:17,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:38:17,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:38:17,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:38:17,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:38:17,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:38:17,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:38:17,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:38:17,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:38:17,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:38:17,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:38:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:38:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:38:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:38:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:38:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:38:18,279 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:38:18,280 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 17:38:18,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:38:18 BoogieIcfgContainer [2020-07-08 17:38:18,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:38:18,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:38:18,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:38:18,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:38:18,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:38:17" (1/3) ... [2020-07-08 17:38:18,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8104c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:38:18, skipping insertion in model container [2020-07-08 17:38:18,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:38:17" (2/3) ... [2020-07-08 17:38:18,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8104c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:38:18, skipping insertion in model container [2020-07-08 17:38:18,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:38:18" (3/3) ... [2020-07-08 17:38:18,296 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2020-07-08 17:38:18,310 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:38:18,320 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:38:18,338 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:38:18,366 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:38:18,367 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:38:18,367 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:38:18,367 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:38:18,368 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:38:18,368 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:38:18,368 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:38:18,369 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:38:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-08 17:38:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 17:38:18,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:18,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:18,415 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash -537390573, now seen corresponding path program 1 times [2020-07-08 17:38:18,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:18,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2020726732] [2020-07-08 17:38:18,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:18,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-08 17:38:18,600 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {77#true} {77#true} #144#return; {77#true} is VALID [2020-07-08 17:38:18,602 INFO L263 TraceCheckUtils]: 0: Hoare triple {77#true} call ULTIMATE.init(); {77#true} is VALID [2020-07-08 17:38:18,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-08 17:38:18,604 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {77#true} {77#true} #144#return; {77#true} is VALID [2020-07-08 17:38:18,604 INFO L263 TraceCheckUtils]: 3: Hoare triple {77#true} call #t~ret10 := main(); {77#true} is VALID [2020-07-08 17:38:18,605 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#true} havoc ~tagbuf_len~0; {77#true} is VALID [2020-07-08 17:38:18,605 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#true} havoc ~t~0; {77#true} is VALID [2020-07-08 17:38:18,605 INFO L280 TraceCheckUtils]: 6: Hoare triple {77#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {77#true} is VALID [2020-07-08 17:38:18,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {77#true} ~tagbuf_len~0 := #t~nondet0; {77#true} is VALID [2020-07-08 17:38:18,606 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#true} havoc #t~nondet0; {77#true} is VALID [2020-07-08 17:38:18,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {77#true} assume ~tagbuf_len~0 >= 1; {77#true} is VALID [2020-07-08 17:38:18,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#true} ~t~0 := 0; {77#true} is VALID [2020-07-08 17:38:18,608 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#true} #t~pre1 := ~tagbuf_len~0 - 1; {77#true} is VALID [2020-07-08 17:38:18,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {77#true} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {77#true} is VALID [2020-07-08 17:38:18,608 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#true} havoc #t~pre1; {77#true} is VALID [2020-07-08 17:38:18,613 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#true} assume false; {78#false} is VALID [2020-07-08 17:38:18,613 INFO L263 TraceCheckUtils]: 15: Hoare triple {78#false} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {78#false} is VALID [2020-07-08 17:38:18,614 INFO L280 TraceCheckUtils]: 16: Hoare triple {78#false} ~cond := #in~cond; {78#false} is VALID [2020-07-08 17:38:18,614 INFO L280 TraceCheckUtils]: 17: Hoare triple {78#false} assume 0 == ~cond; {78#false} is VALID [2020-07-08 17:38:18,614 INFO L280 TraceCheckUtils]: 18: Hoare triple {78#false} assume !false; {78#false} is VALID [2020-07-08 17:38:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:18,617 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:18,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2020726732] [2020-07-08 17:38:18,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:18,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 17:38:18,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262040033] [2020-07-08 17:38:18,631 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2020-07-08 17:38:18,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:18,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 17:38:18,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:18,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 17:38:18,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:18,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 17:38:18,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 17:38:18,702 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2020-07-08 17:38:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:18,992 INFO L93 Difference]: Finished difference Result 134 states and 203 transitions. [2020-07-08 17:38:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 17:38:18,992 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2020-07-08 17:38:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:38:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2020-07-08 17:38:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:38:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2020-07-08 17:38:19,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 203 transitions. [2020-07-08 17:38:19,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:19,370 INFO L225 Difference]: With dead ends: 134 [2020-07-08 17:38:19,370 INFO L226 Difference]: Without dead ends: 69 [2020-07-08 17:38:19,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 17:38:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-08 17:38:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-07-08 17:38:19,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:19,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2020-07-08 17:38:19,467 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2020-07-08 17:38:19,467 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2020-07-08 17:38:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:19,477 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2020-07-08 17:38:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2020-07-08 17:38:19,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:19,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:19,480 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2020-07-08 17:38:19,480 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2020-07-08 17:38:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:19,488 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2020-07-08 17:38:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2020-07-08 17:38:19,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:19,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:19,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:19,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-08 17:38:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2020-07-08 17:38:19,498 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 19 [2020-07-08 17:38:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:19,499 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2020-07-08 17:38:19,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 17:38:19,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 87 transitions. [2020-07-08 17:38:19,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2020-07-08 17:38:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 17:38:19,606 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:19,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:19,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:38:19,607 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:19,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:19,608 INFO L82 PathProgramCache]: Analyzing trace with hash 471335344, now seen corresponding path program 1 times [2020-07-08 17:38:19,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:19,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [123641323] [2020-07-08 17:38:19,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:19,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {627#true} assume true; {627#true} is VALID [2020-07-08 17:38:19,707 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {627#true} {627#true} #144#return; {627#true} is VALID [2020-07-08 17:38:19,707 INFO L263 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2020-07-08 17:38:19,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {627#true} assume true; {627#true} is VALID [2020-07-08 17:38:19,708 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {627#true} {627#true} #144#return; {627#true} is VALID [2020-07-08 17:38:19,708 INFO L263 TraceCheckUtils]: 3: Hoare triple {627#true} call #t~ret10 := main(); {627#true} is VALID [2020-07-08 17:38:19,708 INFO L280 TraceCheckUtils]: 4: Hoare triple {627#true} havoc ~tagbuf_len~0; {627#true} is VALID [2020-07-08 17:38:19,709 INFO L280 TraceCheckUtils]: 5: Hoare triple {627#true} havoc ~t~0; {627#true} is VALID [2020-07-08 17:38:19,709 INFO L280 TraceCheckUtils]: 6: Hoare triple {627#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {627#true} is VALID [2020-07-08 17:38:19,709 INFO L280 TraceCheckUtils]: 7: Hoare triple {627#true} ~tagbuf_len~0 := #t~nondet0; {627#true} is VALID [2020-07-08 17:38:19,710 INFO L280 TraceCheckUtils]: 8: Hoare triple {627#true} havoc #t~nondet0; {627#true} is VALID [2020-07-08 17:38:19,710 INFO L280 TraceCheckUtils]: 9: Hoare triple {627#true} assume ~tagbuf_len~0 >= 1; {627#true} is VALID [2020-07-08 17:38:19,711 INFO L280 TraceCheckUtils]: 10: Hoare triple {627#true} ~t~0 := 0; {631#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:19,712 INFO L280 TraceCheckUtils]: 11: Hoare triple {631#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {631#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:19,713 INFO L280 TraceCheckUtils]: 12: Hoare triple {631#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {631#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:19,714 INFO L280 TraceCheckUtils]: 13: Hoare triple {631#(<= 0 main_~t~0)} havoc #t~pre1; {631#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:19,714 INFO L280 TraceCheckUtils]: 14: Hoare triple {631#(<= 0 main_~t~0)} assume !false; {631#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:19,715 INFO L280 TraceCheckUtils]: 15: Hoare triple {631#(<= 0 main_~t~0)} assume ~t~0 == ~tagbuf_len~0; {631#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:19,716 INFO L263 TraceCheckUtils]: 16: Hoare triple {631#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {632#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:19,717 INFO L280 TraceCheckUtils]: 17: Hoare triple {632#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {633#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:19,718 INFO L280 TraceCheckUtils]: 18: Hoare triple {633#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {628#false} is VALID [2020-07-08 17:38:19,718 INFO L280 TraceCheckUtils]: 19: Hoare triple {628#false} assume !false; {628#false} is VALID [2020-07-08 17:38:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:19,721 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:19,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [123641323] [2020-07-08 17:38:19,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:19,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:38:19,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954109817] [2020-07-08 17:38:19,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 17:38:19,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:19,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:38:19,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:19,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:38:19,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:38:19,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:38:19,747 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand 5 states. [2020-07-08 17:38:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:20,292 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2020-07-08 17:38:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:38:20,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 17:38:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:38:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2020-07-08 17:38:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:38:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2020-07-08 17:38:20,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 115 transitions. [2020-07-08 17:38:20,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:20,435 INFO L225 Difference]: With dead ends: 91 [2020-07-08 17:38:20,435 INFO L226 Difference]: Without dead ends: 89 [2020-07-08 17:38:20,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:38:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-08 17:38:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2020-07-08 17:38:20,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:20,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 82 states. [2020-07-08 17:38:20,496 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 82 states. [2020-07-08 17:38:20,496 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 82 states. [2020-07-08 17:38:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:20,503 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2020-07-08 17:38:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2020-07-08 17:38:20,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:20,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:20,506 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 89 states. [2020-07-08 17:38:20,506 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 89 states. [2020-07-08 17:38:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:20,513 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2020-07-08 17:38:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2020-07-08 17:38:20,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:20,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:20,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:20,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-08 17:38:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2020-07-08 17:38:20,521 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 20 [2020-07-08 17:38:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:20,521 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2020-07-08 17:38:20,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:38:20,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 104 transitions. [2020-07-08 17:38:20,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2020-07-08 17:38:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 17:38:20,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:20,649 INFO L422 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] [2020-07-08 17:38:20,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:38:20,649 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1383579147, now seen corresponding path program 1 times [2020-07-08 17:38:20,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:20,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613066999] [2020-07-08 17:38:20,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:20,811 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-08 17:38:20,811 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1162#true} {1162#true} #144#return; {1162#true} is VALID [2020-07-08 17:38:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:20,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {1162#true} ~cond := #in~cond; {1162#true} is VALID [2020-07-08 17:38:20,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} assume !(0 == ~cond); {1162#true} is VALID [2020-07-08 17:38:20,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-08 17:38:20,837 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1162#true} {1166#(<= main_~t~0 main_~tagbuf_len~0)} #148#return; {1166#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:20,838 INFO L263 TraceCheckUtils]: 0: Hoare triple {1162#true} call ULTIMATE.init(); {1162#true} is VALID [2020-07-08 17:38:20,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-08 17:38:20,839 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1162#true} {1162#true} #144#return; {1162#true} is VALID [2020-07-08 17:38:20,842 INFO L263 TraceCheckUtils]: 3: Hoare triple {1162#true} call #t~ret10 := main(); {1162#true} is VALID [2020-07-08 17:38:20,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {1162#true} havoc ~tagbuf_len~0; {1162#true} is VALID [2020-07-08 17:38:20,843 INFO L280 TraceCheckUtils]: 5: Hoare triple {1162#true} havoc ~t~0; {1162#true} is VALID [2020-07-08 17:38:20,844 INFO L280 TraceCheckUtils]: 6: Hoare triple {1162#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1162#true} is VALID [2020-07-08 17:38:20,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {1162#true} ~tagbuf_len~0 := #t~nondet0; {1162#true} is VALID [2020-07-08 17:38:20,844 INFO L280 TraceCheckUtils]: 8: Hoare triple {1162#true} havoc #t~nondet0; {1162#true} is VALID [2020-07-08 17:38:20,845 INFO L280 TraceCheckUtils]: 9: Hoare triple {1162#true} assume ~tagbuf_len~0 >= 1; {1162#true} is VALID [2020-07-08 17:38:20,845 INFO L280 TraceCheckUtils]: 10: Hoare triple {1162#true} ~t~0 := 0; {1162#true} is VALID [2020-07-08 17:38:20,847 INFO L280 TraceCheckUtils]: 11: Hoare triple {1162#true} #t~pre1 := ~tagbuf_len~0 - 1; {1162#true} is VALID [2020-07-08 17:38:20,848 INFO L280 TraceCheckUtils]: 12: Hoare triple {1162#true} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {1162#true} is VALID [2020-07-08 17:38:20,848 INFO L280 TraceCheckUtils]: 13: Hoare triple {1162#true} havoc #t~pre1; {1162#true} is VALID [2020-07-08 17:38:20,848 INFO L280 TraceCheckUtils]: 14: Hoare triple {1162#true} assume !false; {1162#true} is VALID [2020-07-08 17:38:20,852 INFO L280 TraceCheckUtils]: 15: Hoare triple {1162#true} assume ~t~0 == ~tagbuf_len~0; {1166#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:20,853 INFO L263 TraceCheckUtils]: 16: Hoare triple {1166#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1162#true} is VALID [2020-07-08 17:38:20,853 INFO L280 TraceCheckUtils]: 17: Hoare triple {1162#true} ~cond := #in~cond; {1162#true} is VALID [2020-07-08 17:38:20,853 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#true} assume !(0 == ~cond); {1162#true} is VALID [2020-07-08 17:38:20,855 INFO L280 TraceCheckUtils]: 19: Hoare triple {1162#true} assume true; {1162#true} is VALID [2020-07-08 17:38:20,861 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1162#true} {1166#(<= main_~t~0 main_~tagbuf_len~0)} #148#return; {1166#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:20,863 INFO L263 TraceCheckUtils]: 21: Hoare triple {1166#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1171#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:20,864 INFO L280 TraceCheckUtils]: 22: Hoare triple {1171#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1172#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:20,865 INFO L280 TraceCheckUtils]: 23: Hoare triple {1172#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1163#false} is VALID [2020-07-08 17:38:20,865 INFO L280 TraceCheckUtils]: 24: Hoare triple {1163#false} assume !false; {1163#false} is VALID [2020-07-08 17:38:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:20,867 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:20,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1613066999] [2020-07-08 17:38:20,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:20,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:38:20,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383827860] [2020-07-08 17:38:20,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-08 17:38:20,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:20,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:38:20,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:20,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:38:20,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:38:20,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:38:20,902 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand 5 states. [2020-07-08 17:38:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:21,366 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2020-07-08 17:38:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:38:21,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-08 17:38:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:38:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2020-07-08 17:38:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:38:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2020-07-08 17:38:21,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2020-07-08 17:38:21,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:21,473 INFO L225 Difference]: With dead ends: 88 [2020-07-08 17:38:21,473 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 17:38:21,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:38:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 17:38:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-08 17:38:21,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:21,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-08 17:38:21,523 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-08 17:38:21,524 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-08 17:38:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:21,529 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2020-07-08 17:38:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2020-07-08 17:38:21,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:21,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:21,530 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-08 17:38:21,531 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-08 17:38:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:21,535 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2020-07-08 17:38:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2020-07-08 17:38:21,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:21,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:21,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:21,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-08 17:38:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2020-07-08 17:38:21,542 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 25 [2020-07-08 17:38:21,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:21,543 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2020-07-08 17:38:21,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:38:21,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 95 transitions. [2020-07-08 17:38:21,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2020-07-08 17:38:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 17:38:21,665 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:21,666 INFO L422 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, 1, 1] [2020-07-08 17:38:21,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:38:21,666 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:21,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash 344115466, now seen corresponding path program 1 times [2020-07-08 17:38:21,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:21,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1434256714] [2020-07-08 17:38:21,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:21,769 INFO L280 TraceCheckUtils]: 0: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-08 17:38:21,769 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1665#true} {1665#true} #144#return; {1665#true} is VALID [2020-07-08 17:38:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:21,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2020-07-08 17:38:21,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2020-07-08 17:38:21,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-08 17:38:21,786 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1671#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,787 INFO L263 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1665#true} is VALID [2020-07-08 17:38:21,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-08 17:38:21,787 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #144#return; {1665#true} is VALID [2020-07-08 17:38:21,788 INFO L263 TraceCheckUtils]: 3: Hoare triple {1665#true} call #t~ret10 := main(); {1665#true} is VALID [2020-07-08 17:38:21,788 INFO L280 TraceCheckUtils]: 4: Hoare triple {1665#true} havoc ~tagbuf_len~0; {1665#true} is VALID [2020-07-08 17:38:21,788 INFO L280 TraceCheckUtils]: 5: Hoare triple {1665#true} havoc ~t~0; {1665#true} is VALID [2020-07-08 17:38:21,788 INFO L280 TraceCheckUtils]: 6: Hoare triple {1665#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1665#true} is VALID [2020-07-08 17:38:21,789 INFO L280 TraceCheckUtils]: 7: Hoare triple {1665#true} ~tagbuf_len~0 := #t~nondet0; {1665#true} is VALID [2020-07-08 17:38:21,789 INFO L280 TraceCheckUtils]: 8: Hoare triple {1665#true} havoc #t~nondet0; {1665#true} is VALID [2020-07-08 17:38:21,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {1665#true} assume ~tagbuf_len~0 >= 1; {1669#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,802 INFO L280 TraceCheckUtils]: 10: Hoare triple {1669#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,803 INFO L280 TraceCheckUtils]: 11: Hoare triple {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,808 INFO L280 TraceCheckUtils]: 12: Hoare triple {1670#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,808 INFO L280 TraceCheckUtils]: 13: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,809 INFO L280 TraceCheckUtils]: 14: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,810 INFO L280 TraceCheckUtils]: 15: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,811 INFO L280 TraceCheckUtils]: 16: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,812 INFO L280 TraceCheckUtils]: 17: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,813 INFO L280 TraceCheckUtils]: 18: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet2; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,813 INFO L263 TraceCheckUtils]: 19: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1665#true} is VALID [2020-07-08 17:38:21,814 INFO L280 TraceCheckUtils]: 20: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2020-07-08 17:38:21,814 INFO L280 TraceCheckUtils]: 21: Hoare triple {1665#true} assume !(0 == ~cond); {1665#true} is VALID [2020-07-08 17:38:21,815 INFO L280 TraceCheckUtils]: 22: Hoare triple {1665#true} assume true; {1665#true} is VALID [2020-07-08 17:38:21,816 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1665#true} {1671#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {1671#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:21,821 INFO L263 TraceCheckUtils]: 24: Hoare triple {1671#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1676#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:21,822 INFO L280 TraceCheckUtils]: 25: Hoare triple {1676#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1677#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:21,822 INFO L280 TraceCheckUtils]: 26: Hoare triple {1677#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1666#false} is VALID [2020-07-08 17:38:21,822 INFO L280 TraceCheckUtils]: 27: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2020-07-08 17:38:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:21,825 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:21,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1434256714] [2020-07-08 17:38:21,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:21,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 17:38:21,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806029713] [2020-07-08 17:38:21,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-08 17:38:21,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:21,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 17:38:21,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:21,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 17:38:21,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 17:38:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:38:21,862 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 7 states. [2020-07-08 17:38:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:22,536 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2020-07-08 17:38:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 17:38:22,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-08 17:38:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:38:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2020-07-08 17:38:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:38:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2020-07-08 17:38:22,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2020-07-08 17:38:22,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:22,660 INFO L225 Difference]: With dead ends: 90 [2020-07-08 17:38:22,660 INFO L226 Difference]: Without dead ends: 88 [2020-07-08 17:38:22,661 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:38:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-08 17:38:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2020-07-08 17:38:22,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:22,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 84 states. [2020-07-08 17:38:22,740 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 84 states. [2020-07-08 17:38:22,740 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 84 states. [2020-07-08 17:38:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:22,747 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2020-07-08 17:38:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2020-07-08 17:38:22,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:22,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:22,757 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 88 states. [2020-07-08 17:38:22,757 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 88 states. [2020-07-08 17:38:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:22,766 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2020-07-08 17:38:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2020-07-08 17:38:22,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:22,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:22,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:22,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-08 17:38:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2020-07-08 17:38:22,775 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 28 [2020-07-08 17:38:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:22,777 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2020-07-08 17:38:22,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 17:38:22,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 102 transitions. [2020-07-08 17:38:22,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2020-07-08 17:38:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 17:38:22,904 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:22,904 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1] [2020-07-08 17:38:22,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:38:22,905 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:22,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1469174755, now seen corresponding path program 1 times [2020-07-08 17:38:22,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:22,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1253078617] [2020-07-08 17:38:22,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:23,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-08 17:38:23,103 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2208#true} {2208#true} #144#return; {2208#true} is VALID [2020-07-08 17:38:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:23,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID [2020-07-08 17:38:23,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID [2020-07-08 17:38:23,119 INFO L280 TraceCheckUtils]: 2: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-08 17:38:23,120 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #152#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:23,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID [2020-07-08 17:38:23,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID [2020-07-08 17:38:23,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-08 17:38:23,145 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #154#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,145 INFO L263 TraceCheckUtils]: 0: Hoare triple {2208#true} call ULTIMATE.init(); {2208#true} is VALID [2020-07-08 17:38:23,146 INFO L280 TraceCheckUtils]: 1: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-08 17:38:23,146 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2208#true} {2208#true} #144#return; {2208#true} is VALID [2020-07-08 17:38:23,146 INFO L263 TraceCheckUtils]: 3: Hoare triple {2208#true} call #t~ret10 := main(); {2208#true} is VALID [2020-07-08 17:38:23,147 INFO L280 TraceCheckUtils]: 4: Hoare triple {2208#true} havoc ~tagbuf_len~0; {2208#true} is VALID [2020-07-08 17:38:23,147 INFO L280 TraceCheckUtils]: 5: Hoare triple {2208#true} havoc ~t~0; {2208#true} is VALID [2020-07-08 17:38:23,150 INFO L280 TraceCheckUtils]: 6: Hoare triple {2208#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2208#true} is VALID [2020-07-08 17:38:23,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {2208#true} ~tagbuf_len~0 := #t~nondet0; {2208#true} is VALID [2020-07-08 17:38:23,151 INFO L280 TraceCheckUtils]: 8: Hoare triple {2208#true} havoc #t~nondet0; {2208#true} is VALID [2020-07-08 17:38:23,163 INFO L280 TraceCheckUtils]: 9: Hoare triple {2208#true} assume ~tagbuf_len~0 >= 1; {2212#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {2212#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {2212#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,169 INFO L280 TraceCheckUtils]: 11: Hoare triple {2212#(<= 1 main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {2212#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,170 INFO L280 TraceCheckUtils]: 12: Hoare triple {2212#(<= 1 main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,171 INFO L280 TraceCheckUtils]: 13: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} havoc #t~pre1; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,171 INFO L280 TraceCheckUtils]: 14: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !false; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,172 INFO L280 TraceCheckUtils]: 15: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,172 INFO L280 TraceCheckUtils]: 16: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,173 INFO L280 TraceCheckUtils]: 17: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,174 INFO L280 TraceCheckUtils]: 18: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} havoc #t~nondet2; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,174 INFO L263 TraceCheckUtils]: 19: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2208#true} is VALID [2020-07-08 17:38:23,174 INFO L280 TraceCheckUtils]: 20: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID [2020-07-08 17:38:23,174 INFO L280 TraceCheckUtils]: 21: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID [2020-07-08 17:38:23,175 INFO L280 TraceCheckUtils]: 22: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-08 17:38:23,175 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #152#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,176 INFO L263 TraceCheckUtils]: 24: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2208#true} is VALID [2020-07-08 17:38:23,176 INFO L280 TraceCheckUtils]: 25: Hoare triple {2208#true} ~cond := #in~cond; {2208#true} is VALID [2020-07-08 17:38:23,176 INFO L280 TraceCheckUtils]: 26: Hoare triple {2208#true} assume !(0 == ~cond); {2208#true} is VALID [2020-07-08 17:38:23,176 INFO L280 TraceCheckUtils]: 27: Hoare triple {2208#true} assume true; {2208#true} is VALID [2020-07-08 17:38:23,177 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2208#true} {2213#(<= 0 main_~tagbuf_len~0)} #154#return; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,179 INFO L280 TraceCheckUtils]: 29: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} #t~post3 := ~t~0; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,179 INFO L280 TraceCheckUtils]: 30: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,180 INFO L280 TraceCheckUtils]: 31: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} havoc #t~post3; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,181 INFO L280 TraceCheckUtils]: 32: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume !false; {2213#(<= 0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:23,182 INFO L280 TraceCheckUtils]: 33: Hoare triple {2213#(<= 0 main_~tagbuf_len~0)} assume ~t~0 == ~tagbuf_len~0; {2222#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:23,183 INFO L263 TraceCheckUtils]: 34: Hoare triple {2222#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2223#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:23,184 INFO L280 TraceCheckUtils]: 35: Hoare triple {2223#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2224#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:23,184 INFO L280 TraceCheckUtils]: 36: Hoare triple {2224#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2209#false} is VALID [2020-07-08 17:38:23,185 INFO L280 TraceCheckUtils]: 37: Hoare triple {2209#false} assume !false; {2209#false} is VALID [2020-07-08 17:38:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:23,189 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:23,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1253078617] [2020-07-08 17:38:23,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:23,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 17:38:23,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633162377] [2020-07-08 17:38:23,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 17:38:23,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:23,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 17:38:23,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:23,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 17:38:23,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:23,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 17:38:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:38:23,233 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 7 states. [2020-07-08 17:38:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:23,955 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2020-07-08 17:38:23,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 17:38:23,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-08 17:38:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:38:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2020-07-08 17:38:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:38:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2020-07-08 17:38:23,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2020-07-08 17:38:24,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:24,095 INFO L225 Difference]: With dead ends: 94 [2020-07-08 17:38:24,095 INFO L226 Difference]: Without dead ends: 85 [2020-07-08 17:38:24,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:38:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-08 17:38:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2020-07-08 17:38:24,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:24,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 81 states. [2020-07-08 17:38:24,215 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 81 states. [2020-07-08 17:38:24,215 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 81 states. [2020-07-08 17:38:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:24,221 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2020-07-08 17:38:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2020-07-08 17:38:24,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:24,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:24,223 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 85 states. [2020-07-08 17:38:24,223 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 85 states. [2020-07-08 17:38:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:24,228 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2020-07-08 17:38:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2020-07-08 17:38:24,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:24,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:24,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:24,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-08 17:38:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2020-07-08 17:38:24,237 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 38 [2020-07-08 17:38:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:24,237 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2020-07-08 17:38:24,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 17:38:24,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 96 transitions. [2020-07-08 17:38:24,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2020-07-08 17:38:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 17:38:24,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:24,378 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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, 1, 1] [2020-07-08 17:38:24,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:38:24,378 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash 859677550, now seen corresponding path program 1 times [2020-07-08 17:38:24,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:24,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1821535485] [2020-07-08 17:38:24,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:24,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-08 17:38:24,497 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2753#true} {2753#true} #144#return; {2753#true} is VALID [2020-07-08 17:38:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:24,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID [2020-07-08 17:38:24,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID [2020-07-08 17:38:24,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-08 17:38:24,510 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #152#return; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:24,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID [2020-07-08 17:38:24,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID [2020-07-08 17:38:24,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-08 17:38:24,525 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #154#return; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,525 INFO L263 TraceCheckUtils]: 0: Hoare triple {2753#true} call ULTIMATE.init(); {2753#true} is VALID [2020-07-08 17:38:24,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-08 17:38:24,526 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2753#true} {2753#true} #144#return; {2753#true} is VALID [2020-07-08 17:38:24,526 INFO L263 TraceCheckUtils]: 3: Hoare triple {2753#true} call #t~ret10 := main(); {2753#true} is VALID [2020-07-08 17:38:24,526 INFO L280 TraceCheckUtils]: 4: Hoare triple {2753#true} havoc ~tagbuf_len~0; {2753#true} is VALID [2020-07-08 17:38:24,526 INFO L280 TraceCheckUtils]: 5: Hoare triple {2753#true} havoc ~t~0; {2753#true} is VALID [2020-07-08 17:38:24,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {2753#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2753#true} is VALID [2020-07-08 17:38:24,527 INFO L280 TraceCheckUtils]: 7: Hoare triple {2753#true} ~tagbuf_len~0 := #t~nondet0; {2753#true} is VALID [2020-07-08 17:38:24,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {2753#true} havoc #t~nondet0; {2753#true} is VALID [2020-07-08 17:38:24,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {2753#true} assume ~tagbuf_len~0 >= 1; {2753#true} is VALID [2020-07-08 17:38:24,529 INFO L280 TraceCheckUtils]: 10: Hoare triple {2753#true} ~t~0 := 0; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,530 INFO L280 TraceCheckUtils]: 11: Hoare triple {2757#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,530 INFO L280 TraceCheckUtils]: 12: Hoare triple {2757#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,531 INFO L280 TraceCheckUtils]: 13: Hoare triple {2757#(<= 0 main_~t~0)} havoc #t~pre1; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,532 INFO L280 TraceCheckUtils]: 14: Hoare triple {2757#(<= 0 main_~t~0)} assume !false; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,535 INFO L280 TraceCheckUtils]: 15: Hoare triple {2757#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,537 INFO L280 TraceCheckUtils]: 16: Hoare triple {2757#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,539 INFO L280 TraceCheckUtils]: 17: Hoare triple {2757#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,540 INFO L280 TraceCheckUtils]: 18: Hoare triple {2757#(<= 0 main_~t~0)} havoc #t~nondet2; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,540 INFO L263 TraceCheckUtils]: 19: Hoare triple {2757#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2753#true} is VALID [2020-07-08 17:38:24,541 INFO L280 TraceCheckUtils]: 20: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID [2020-07-08 17:38:24,541 INFO L280 TraceCheckUtils]: 21: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID [2020-07-08 17:38:24,541 INFO L280 TraceCheckUtils]: 22: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-08 17:38:24,542 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #152#return; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,543 INFO L263 TraceCheckUtils]: 24: Hoare triple {2757#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {2753#true} is VALID [2020-07-08 17:38:24,543 INFO L280 TraceCheckUtils]: 25: Hoare triple {2753#true} ~cond := #in~cond; {2753#true} is VALID [2020-07-08 17:38:24,543 INFO L280 TraceCheckUtils]: 26: Hoare triple {2753#true} assume !(0 == ~cond); {2753#true} is VALID [2020-07-08 17:38:24,543 INFO L280 TraceCheckUtils]: 27: Hoare triple {2753#true} assume true; {2753#true} is VALID [2020-07-08 17:38:24,547 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2753#true} {2757#(<= 0 main_~t~0)} #154#return; {2757#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:24,547 INFO L280 TraceCheckUtils]: 29: Hoare triple {2757#(<= 0 main_~t~0)} #t~post3 := ~t~0; {2766#(<= 0 |main_#t~post3|)} is VALID [2020-07-08 17:38:24,548 INFO L280 TraceCheckUtils]: 30: Hoare triple {2766#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {2767#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:24,549 INFO L280 TraceCheckUtils]: 31: Hoare triple {2767#(<= 1 main_~t~0)} havoc #t~post3; {2767#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:24,550 INFO L280 TraceCheckUtils]: 32: Hoare triple {2767#(<= 1 main_~t~0)} assume !false; {2767#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:24,550 INFO L280 TraceCheckUtils]: 33: Hoare triple {2767#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {2767#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:24,551 INFO L280 TraceCheckUtils]: 34: Hoare triple {2767#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2767#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:24,551 INFO L280 TraceCheckUtils]: 35: Hoare triple {2767#(<= 1 main_~t~0)} assume !(0 != #t~nondet2); {2767#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:24,552 INFO L280 TraceCheckUtils]: 36: Hoare triple {2767#(<= 1 main_~t~0)} havoc #t~nondet2; {2767#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:24,553 INFO L263 TraceCheckUtils]: 37: Hoare triple {2767#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {2768#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:24,554 INFO L280 TraceCheckUtils]: 38: Hoare triple {2768#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2769#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:24,555 INFO L280 TraceCheckUtils]: 39: Hoare triple {2769#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2754#false} is VALID [2020-07-08 17:38:24,555 INFO L280 TraceCheckUtils]: 40: Hoare triple {2754#false} assume !false; {2754#false} is VALID [2020-07-08 17:38:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:24,557 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:24,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1821535485] [2020-07-08 17:38:24,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:24,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 17:38:24,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549549240] [2020-07-08 17:38:24,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-07-08 17:38:24,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:24,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 17:38:24,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:24,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 17:38:24,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:24,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 17:38:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:38:24,611 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 7 states. [2020-07-08 17:38:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:25,241 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2020-07-08 17:38:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 17:38:25,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-07-08 17:38:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:38:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2020-07-08 17:38:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:38:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2020-07-08 17:38:25,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2020-07-08 17:38:25,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:25,389 INFO L225 Difference]: With dead ends: 91 [2020-07-08 17:38:25,390 INFO L226 Difference]: Without dead ends: 89 [2020-07-08 17:38:25,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:38:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-08 17:38:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2020-07-08 17:38:25,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:25,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 85 states. [2020-07-08 17:38:25,489 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 85 states. [2020-07-08 17:38:25,489 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 85 states. [2020-07-08 17:38:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:25,494 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2020-07-08 17:38:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2020-07-08 17:38:25,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:25,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:25,495 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 89 states. [2020-07-08 17:38:25,496 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 89 states. [2020-07-08 17:38:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:25,500 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2020-07-08 17:38:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2020-07-08 17:38:25,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:25,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:25,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:25,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-08 17:38:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2020-07-08 17:38:25,507 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2020-07-08 17:38:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:25,507 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2020-07-08 17:38:25,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 17:38:25,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 99 transitions. [2020-07-08 17:38:25,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2020-07-08 17:38:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 17:38:25,665 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:25,665 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:25,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 17:38:25,666 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash -943144682, now seen corresponding path program 1 times [2020-07-08 17:38:25,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:25,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191253899] [2020-07-08 17:38:25,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:25,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-08 17:38:25,764 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3308#true} {3308#true} #144#return; {3308#true} is VALID [2020-07-08 17:38:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:25,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID [2020-07-08 17:38:25,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID [2020-07-08 17:38:25,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-08 17:38:25,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #156#return; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:25,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID [2020-07-08 17:38:25,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID [2020-07-08 17:38:25,781 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-08 17:38:25,782 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #158#return; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,782 INFO L263 TraceCheckUtils]: 0: Hoare triple {3308#true} call ULTIMATE.init(); {3308#true} is VALID [2020-07-08 17:38:25,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-08 17:38:25,783 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3308#true} {3308#true} #144#return; {3308#true} is VALID [2020-07-08 17:38:25,783 INFO L263 TraceCheckUtils]: 3: Hoare triple {3308#true} call #t~ret10 := main(); {3308#true} is VALID [2020-07-08 17:38:25,783 INFO L280 TraceCheckUtils]: 4: Hoare triple {3308#true} havoc ~tagbuf_len~0; {3308#true} is VALID [2020-07-08 17:38:25,783 INFO L280 TraceCheckUtils]: 5: Hoare triple {3308#true} havoc ~t~0; {3308#true} is VALID [2020-07-08 17:38:25,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {3308#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3308#true} is VALID [2020-07-08 17:38:25,784 INFO L280 TraceCheckUtils]: 7: Hoare triple {3308#true} ~tagbuf_len~0 := #t~nondet0; {3308#true} is VALID [2020-07-08 17:38:25,784 INFO L280 TraceCheckUtils]: 8: Hoare triple {3308#true} havoc #t~nondet0; {3308#true} is VALID [2020-07-08 17:38:25,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {3308#true} assume ~tagbuf_len~0 >= 1; {3308#true} is VALID [2020-07-08 17:38:25,791 INFO L280 TraceCheckUtils]: 10: Hoare triple {3308#true} ~t~0 := 0; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,792 INFO L280 TraceCheckUtils]: 11: Hoare triple {3312#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,793 INFO L280 TraceCheckUtils]: 12: Hoare triple {3312#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,794 INFO L280 TraceCheckUtils]: 13: Hoare triple {3312#(<= 0 main_~t~0)} havoc #t~pre1; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,795 INFO L280 TraceCheckUtils]: 14: Hoare triple {3312#(<= 0 main_~t~0)} assume !false; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,796 INFO L280 TraceCheckUtils]: 15: Hoare triple {3312#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,796 INFO L280 TraceCheckUtils]: 16: Hoare triple {3312#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,797 INFO L280 TraceCheckUtils]: 17: Hoare triple {3312#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,798 INFO L280 TraceCheckUtils]: 18: Hoare triple {3312#(<= 0 main_~t~0)} havoc #t~nondet2; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,798 INFO L263 TraceCheckUtils]: 19: Hoare triple {3312#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {3308#true} is VALID [2020-07-08 17:38:25,798 INFO L280 TraceCheckUtils]: 20: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID [2020-07-08 17:38:25,798 INFO L280 TraceCheckUtils]: 21: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID [2020-07-08 17:38:25,799 INFO L280 TraceCheckUtils]: 22: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-08 17:38:25,799 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #156#return; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,800 INFO L263 TraceCheckUtils]: 24: Hoare triple {3312#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {3308#true} is VALID [2020-07-08 17:38:25,800 INFO L280 TraceCheckUtils]: 25: Hoare triple {3308#true} ~cond := #in~cond; {3308#true} is VALID [2020-07-08 17:38:25,800 INFO L280 TraceCheckUtils]: 26: Hoare triple {3308#true} assume !(0 == ~cond); {3308#true} is VALID [2020-07-08 17:38:25,801 INFO L280 TraceCheckUtils]: 27: Hoare triple {3308#true} assume true; {3308#true} is VALID [2020-07-08 17:38:25,801 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3308#true} {3312#(<= 0 main_~t~0)} #158#return; {3312#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:25,802 INFO L280 TraceCheckUtils]: 29: Hoare triple {3312#(<= 0 main_~t~0)} #t~post4 := ~t~0; {3321#(<= 0 |main_#t~post4|)} is VALID [2020-07-08 17:38:25,804 INFO L280 TraceCheckUtils]: 30: Hoare triple {3321#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,804 INFO L280 TraceCheckUtils]: 31: Hoare triple {3322#(<= 1 main_~t~0)} havoc #t~post4; {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,805 INFO L280 TraceCheckUtils]: 32: Hoare triple {3322#(<= 1 main_~t~0)} assume !false; {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,806 INFO L280 TraceCheckUtils]: 33: Hoare triple {3322#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,807 INFO L280 TraceCheckUtils]: 34: Hoare triple {3322#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,808 INFO L280 TraceCheckUtils]: 35: Hoare triple {3322#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,812 INFO L280 TraceCheckUtils]: 36: Hoare triple {3322#(<= 1 main_~t~0)} havoc #t~nondet5; {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,815 INFO L280 TraceCheckUtils]: 37: Hoare triple {3322#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,815 INFO L280 TraceCheckUtils]: 38: Hoare triple {3322#(<= 1 main_~t~0)} assume !(0 != #t~nondet6); {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,816 INFO L280 TraceCheckUtils]: 39: Hoare triple {3322#(<= 1 main_~t~0)} havoc #t~nondet6; {3322#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:25,817 INFO L263 TraceCheckUtils]: 40: Hoare triple {3322#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {3323#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:25,818 INFO L280 TraceCheckUtils]: 41: Hoare triple {3323#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3324#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:25,819 INFO L280 TraceCheckUtils]: 42: Hoare triple {3324#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3309#false} is VALID [2020-07-08 17:38:25,819 INFO L280 TraceCheckUtils]: 43: Hoare triple {3309#false} assume !false; {3309#false} is VALID [2020-07-08 17:38:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:25,822 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:25,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191253899] [2020-07-08 17:38:25,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:25,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 17:38:25,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445495887] [2020-07-08 17:38:25,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-07-08 17:38:25,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:25,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 17:38:25,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:25,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 17:38:25,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 17:38:25,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:38:25,882 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 7 states. [2020-07-08 17:38:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:26,547 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2020-07-08 17:38:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 17:38:26,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-07-08 17:38:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:38:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2020-07-08 17:38:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:38:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2020-07-08 17:38:26,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 132 transitions. [2020-07-08 17:38:26,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:26,714 INFO L225 Difference]: With dead ends: 120 [2020-07-08 17:38:26,715 INFO L226 Difference]: Without dead ends: 118 [2020-07-08 17:38:26,715 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:38:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-08 17:38:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2020-07-08 17:38:26,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:26,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 109 states. [2020-07-08 17:38:26,882 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 109 states. [2020-07-08 17:38:26,882 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 109 states. [2020-07-08 17:38:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:26,889 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2020-07-08 17:38:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2020-07-08 17:38:26,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:26,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:26,890 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 118 states. [2020-07-08 17:38:26,890 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 118 states. [2020-07-08 17:38:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:26,895 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2020-07-08 17:38:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2020-07-08 17:38:26,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:26,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:26,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:26,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-07-08 17:38:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2020-07-08 17:38:26,902 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 44 [2020-07-08 17:38:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:26,902 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2020-07-08 17:38:26,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 17:38:26,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 109 states and 128 transitions. [2020-07-08 17:38:27,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2020-07-08 17:38:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-08 17:38:27,091 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:27,091 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 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] [2020-07-08 17:38:27,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 17:38:27,092 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1177695863, now seen corresponding path program 2 times [2020-07-08 17:38:27,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:27,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2092875719] [2020-07-08 17:38:27,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:27,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-08 17:38:27,247 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4027#true} {4027#true} #144#return; {4027#true} is VALID [2020-07-08 17:38:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:27,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-08 17:38:27,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-08 17:38:27,257 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-08 17:38:27,258 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:27,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-08 17:38:27,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-08 17:38:27,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-08 17:38:27,272 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:27,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-08 17:38:27,286 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-08 17:38:27,286 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-08 17:38:27,287 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4027#true} {4033#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,288 INFO L263 TraceCheckUtils]: 0: Hoare triple {4027#true} call ULTIMATE.init(); {4027#true} is VALID [2020-07-08 17:38:27,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-08 17:38:27,288 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4027#true} {4027#true} #144#return; {4027#true} is VALID [2020-07-08 17:38:27,289 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#true} call #t~ret10 := main(); {4027#true} is VALID [2020-07-08 17:38:27,289 INFO L280 TraceCheckUtils]: 4: Hoare triple {4027#true} havoc ~tagbuf_len~0; {4027#true} is VALID [2020-07-08 17:38:27,289 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#true} havoc ~t~0; {4027#true} is VALID [2020-07-08 17:38:27,291 INFO L280 TraceCheckUtils]: 6: Hoare triple {4027#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4027#true} is VALID [2020-07-08 17:38:27,291 INFO L280 TraceCheckUtils]: 7: Hoare triple {4027#true} ~tagbuf_len~0 := #t~nondet0; {4027#true} is VALID [2020-07-08 17:38:27,291 INFO L280 TraceCheckUtils]: 8: Hoare triple {4027#true} havoc #t~nondet0; {4027#true} is VALID [2020-07-08 17:38:27,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#true} assume ~tagbuf_len~0 >= 1; {4031#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,293 INFO L280 TraceCheckUtils]: 10: Hoare triple {4031#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,293 INFO L280 TraceCheckUtils]: 11: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,294 INFO L280 TraceCheckUtils]: 12: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,295 INFO L280 TraceCheckUtils]: 13: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,295 INFO L280 TraceCheckUtils]: 14: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,296 INFO L280 TraceCheckUtils]: 15: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,297 INFO L280 TraceCheckUtils]: 16: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,298 INFO L280 TraceCheckUtils]: 17: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,298 INFO L280 TraceCheckUtils]: 18: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,299 INFO L263 TraceCheckUtils]: 19: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4027#true} is VALID [2020-07-08 17:38:27,299 INFO L280 TraceCheckUtils]: 20: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-08 17:38:27,299 INFO L280 TraceCheckUtils]: 21: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-08 17:38:27,300 INFO L280 TraceCheckUtils]: 22: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-08 17:38:27,308 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,309 INFO L263 TraceCheckUtils]: 24: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4027#true} is VALID [2020-07-08 17:38:27,309 INFO L280 TraceCheckUtils]: 25: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-08 17:38:27,309 INFO L280 TraceCheckUtils]: 26: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-08 17:38:27,309 INFO L280 TraceCheckUtils]: 27: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-08 17:38:27,310 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4027#true} {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,311 INFO L280 TraceCheckUtils]: 29: Hoare triple {4032#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {4042#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,311 INFO L280 TraceCheckUtils]: 30: Hoare triple {4042#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,312 INFO L280 TraceCheckUtils]: 31: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,312 INFO L280 TraceCheckUtils]: 32: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,314 INFO L280 TraceCheckUtils]: 33: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,314 INFO L280 TraceCheckUtils]: 34: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,314 INFO L280 TraceCheckUtils]: 35: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,315 INFO L280 TraceCheckUtils]: 36: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet2; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,315 INFO L263 TraceCheckUtils]: 37: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4027#true} is VALID [2020-07-08 17:38:27,315 INFO L280 TraceCheckUtils]: 38: Hoare triple {4027#true} ~cond := #in~cond; {4027#true} is VALID [2020-07-08 17:38:27,315 INFO L280 TraceCheckUtils]: 39: Hoare triple {4027#true} assume !(0 == ~cond); {4027#true} is VALID [2020-07-08 17:38:27,316 INFO L280 TraceCheckUtils]: 40: Hoare triple {4027#true} assume true; {4027#true} is VALID [2020-07-08 17:38:27,316 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {4027#true} {4033#(<= main_~t~0 main_~tagbuf_len~0)} #152#return; {4033#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:27,317 INFO L263 TraceCheckUtils]: 42: Hoare triple {4033#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4047#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:27,318 INFO L280 TraceCheckUtils]: 43: Hoare triple {4047#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4048#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:27,318 INFO L280 TraceCheckUtils]: 44: Hoare triple {4048#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4028#false} is VALID [2020-07-08 17:38:27,318 INFO L280 TraceCheckUtils]: 45: Hoare triple {4028#false} assume !false; {4028#false} is VALID [2020-07-08 17:38:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:27,322 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:27,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2092875719] [2020-07-08 17:38:27,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:27,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 17:38:27,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368576355] [2020-07-08 17:38:27,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-08 17:38:27,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:27,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 17:38:27,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:27,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 17:38:27,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 17:38:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:38:27,368 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand 8 states. [2020-07-08 17:38:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:28,086 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2020-07-08 17:38:28,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 17:38:28,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-07-08 17:38:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:38:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2020-07-08 17:38:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:38:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2020-07-08 17:38:28,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 80 transitions. [2020-07-08 17:38:28,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:28,194 INFO L225 Difference]: With dead ends: 115 [2020-07-08 17:38:28,194 INFO L226 Difference]: Without dead ends: 113 [2020-07-08 17:38:28,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:38:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-07-08 17:38:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-07-08 17:38:28,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:28,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 113 states. [2020-07-08 17:38:28,383 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states. [2020-07-08 17:38:28,383 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states. [2020-07-08 17:38:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:28,389 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2020-07-08 17:38:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2020-07-08 17:38:28,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:28,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:28,390 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 113 states. [2020-07-08 17:38:28,391 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 113 states. [2020-07-08 17:38:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:28,396 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2020-07-08 17:38:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2020-07-08 17:38:28,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:28,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:28,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:28,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-08 17:38:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2020-07-08 17:38:28,403 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 46 [2020-07-08 17:38:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:28,403 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2020-07-08 17:38:28,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 17:38:28,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 131 transitions. [2020-07-08 17:38:28,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2020-07-08 17:38:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 17:38:28,613 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:28,613 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:28,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 17:38:28,613 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:28,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1826770767, now seen corresponding path program 1 times [2020-07-08 17:38:28,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:28,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1970417638] [2020-07-08 17:38:28,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:28,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-08 17:38:28,785 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4741#true} {4741#true} #144#return; {4741#true} is VALID [2020-07-08 17:38:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:28,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-08 17:38:28,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-08 17:38:28,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-08 17:38:28,793 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:28,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-08 17:38:28,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-08 17:38:28,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-08 17:38:28,801 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:28,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-08 17:38:28,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-08 17:38:28,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-08 17:38:28,808 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4741#true} {4747#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,808 INFO L263 TraceCheckUtils]: 0: Hoare triple {4741#true} call ULTIMATE.init(); {4741#true} is VALID [2020-07-08 17:38:28,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-08 17:38:28,809 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4741#true} {4741#true} #144#return; {4741#true} is VALID [2020-07-08 17:38:28,809 INFO L263 TraceCheckUtils]: 3: Hoare triple {4741#true} call #t~ret10 := main(); {4741#true} is VALID [2020-07-08 17:38:28,809 INFO L280 TraceCheckUtils]: 4: Hoare triple {4741#true} havoc ~tagbuf_len~0; {4741#true} is VALID [2020-07-08 17:38:28,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {4741#true} havoc ~t~0; {4741#true} is VALID [2020-07-08 17:38:28,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {4741#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4741#true} is VALID [2020-07-08 17:38:28,810 INFO L280 TraceCheckUtils]: 7: Hoare triple {4741#true} ~tagbuf_len~0 := #t~nondet0; {4741#true} is VALID [2020-07-08 17:38:28,810 INFO L280 TraceCheckUtils]: 8: Hoare triple {4741#true} havoc #t~nondet0; {4741#true} is VALID [2020-07-08 17:38:28,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {4741#true} assume ~tagbuf_len~0 >= 1; {4745#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {4745#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,814 INFO L280 TraceCheckUtils]: 12: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,815 INFO L280 TraceCheckUtils]: 13: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,815 INFO L280 TraceCheckUtils]: 14: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,816 INFO L280 TraceCheckUtils]: 15: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,817 INFO L280 TraceCheckUtils]: 16: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,817 INFO L280 TraceCheckUtils]: 17: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,818 INFO L280 TraceCheckUtils]: 18: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,818 INFO L263 TraceCheckUtils]: 19: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4741#true} is VALID [2020-07-08 17:38:28,819 INFO L280 TraceCheckUtils]: 20: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-08 17:38:28,819 INFO L280 TraceCheckUtils]: 21: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-08 17:38:28,819 INFO L280 TraceCheckUtils]: 22: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-08 17:38:28,820 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,821 INFO L263 TraceCheckUtils]: 24: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4741#true} is VALID [2020-07-08 17:38:28,821 INFO L280 TraceCheckUtils]: 25: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-08 17:38:28,821 INFO L280 TraceCheckUtils]: 26: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-08 17:38:28,821 INFO L280 TraceCheckUtils]: 27: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-08 17:38:28,822 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4741#true} {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,823 INFO L280 TraceCheckUtils]: 29: Hoare triple {4746#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {4756#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,825 INFO L280 TraceCheckUtils]: 30: Hoare triple {4756#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,825 INFO L280 TraceCheckUtils]: 31: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,826 INFO L280 TraceCheckUtils]: 32: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,826 INFO L280 TraceCheckUtils]: 33: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,827 INFO L280 TraceCheckUtils]: 34: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,828 INFO L280 TraceCheckUtils]: 35: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,829 INFO L280 TraceCheckUtils]: 36: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,830 INFO L280 TraceCheckUtils]: 37: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,831 INFO L280 TraceCheckUtils]: 38: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,832 INFO L280 TraceCheckUtils]: 39: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,832 INFO L263 TraceCheckUtils]: 40: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {4741#true} is VALID [2020-07-08 17:38:28,832 INFO L280 TraceCheckUtils]: 41: Hoare triple {4741#true} ~cond := #in~cond; {4741#true} is VALID [2020-07-08 17:38:28,833 INFO L280 TraceCheckUtils]: 42: Hoare triple {4741#true} assume !(0 == ~cond); {4741#true} is VALID [2020-07-08 17:38:28,833 INFO L280 TraceCheckUtils]: 43: Hoare triple {4741#true} assume true; {4741#true} is VALID [2020-07-08 17:38:28,834 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4741#true} {4747#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {4747#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:28,836 INFO L263 TraceCheckUtils]: 45: Hoare triple {4747#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {4761#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:28,837 INFO L280 TraceCheckUtils]: 46: Hoare triple {4761#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4762#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:28,837 INFO L280 TraceCheckUtils]: 47: Hoare triple {4762#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4742#false} is VALID [2020-07-08 17:38:28,837 INFO L280 TraceCheckUtils]: 48: Hoare triple {4742#false} assume !false; {4742#false} is VALID [2020-07-08 17:38:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:28,840 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:28,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1970417638] [2020-07-08 17:38:28,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:28,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 17:38:28,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638244256] [2020-07-08 17:38:28,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-08 17:38:28,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:28,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 17:38:28,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:28,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 17:38:28,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:28,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 17:38:28,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:38:28,893 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 8 states. [2020-07-08 17:38:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:29,744 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2020-07-08 17:38:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 17:38:29,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-08 17:38:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:38:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2020-07-08 17:38:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:38:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2020-07-08 17:38:29,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 132 transitions. [2020-07-08 17:38:29,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:29,921 INFO L225 Difference]: With dead ends: 128 [2020-07-08 17:38:29,922 INFO L226 Difference]: Without dead ends: 123 [2020-07-08 17:38:29,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:38:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-08 17:38:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2020-07-08 17:38:30,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:30,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 117 states. [2020-07-08 17:38:30,104 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 117 states. [2020-07-08 17:38:30,104 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 117 states. [2020-07-08 17:38:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:30,109 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2020-07-08 17:38:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2020-07-08 17:38:30,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:30,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:30,110 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 123 states. [2020-07-08 17:38:30,110 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 123 states. [2020-07-08 17:38:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:30,115 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2020-07-08 17:38:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2020-07-08 17:38:30,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:30,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:30,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:30,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-08 17:38:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2020-07-08 17:38:30,122 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 49 [2020-07-08 17:38:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:30,122 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2020-07-08 17:38:30,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 17:38:30,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 117 states and 134 transitions. [2020-07-08 17:38:30,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2020-07-08 17:38:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-08 17:38:30,315 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:30,315 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:30,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 17:38:30,316 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1519048418, now seen corresponding path program 1 times [2020-07-08 17:38:30,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:30,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854074920] [2020-07-08 17:38:30,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:30,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,473 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5509#true} {5509#true} #144#return; {5509#true} is VALID [2020-07-08 17:38:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:30,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-08 17:38:30,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-08 17:38:30,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,480 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #156#return; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:30,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-08 17:38:30,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-08 17:38:30,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,488 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #158#return; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:30,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-08 17:38:30,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-08 17:38:30,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,497 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #164#return; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:30,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-08 17:38:30,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-08 17:38:30,503 INFO L280 TraceCheckUtils]: 2: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,504 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #166#return; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,505 INFO L263 TraceCheckUtils]: 0: Hoare triple {5509#true} call ULTIMATE.init(); {5509#true} is VALID [2020-07-08 17:38:30,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,505 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5509#true} {5509#true} #144#return; {5509#true} is VALID [2020-07-08 17:38:30,505 INFO L263 TraceCheckUtils]: 3: Hoare triple {5509#true} call #t~ret10 := main(); {5509#true} is VALID [2020-07-08 17:38:30,506 INFO L280 TraceCheckUtils]: 4: Hoare triple {5509#true} havoc ~tagbuf_len~0; {5509#true} is VALID [2020-07-08 17:38:30,506 INFO L280 TraceCheckUtils]: 5: Hoare triple {5509#true} havoc ~t~0; {5509#true} is VALID [2020-07-08 17:38:30,506 INFO L280 TraceCheckUtils]: 6: Hoare triple {5509#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5509#true} is VALID [2020-07-08 17:38:30,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {5509#true} ~tagbuf_len~0 := #t~nondet0; {5509#true} is VALID [2020-07-08 17:38:30,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {5509#true} havoc #t~nondet0; {5509#true} is VALID [2020-07-08 17:38:30,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {5509#true} assume ~tagbuf_len~0 >= 1; {5509#true} is VALID [2020-07-08 17:38:30,508 INFO L280 TraceCheckUtils]: 10: Hoare triple {5509#true} ~t~0 := 0; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,509 INFO L280 TraceCheckUtils]: 11: Hoare triple {5513#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,509 INFO L280 TraceCheckUtils]: 12: Hoare triple {5513#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {5513#(<= 0 main_~t~0)} havoc #t~pre1; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,511 INFO L280 TraceCheckUtils]: 14: Hoare triple {5513#(<= 0 main_~t~0)} assume !false; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,511 INFO L280 TraceCheckUtils]: 15: Hoare triple {5513#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,512 INFO L280 TraceCheckUtils]: 16: Hoare triple {5513#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,512 INFO L280 TraceCheckUtils]: 17: Hoare triple {5513#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,513 INFO L280 TraceCheckUtils]: 18: Hoare triple {5513#(<= 0 main_~t~0)} havoc #t~nondet2; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,513 INFO L263 TraceCheckUtils]: 19: Hoare triple {5513#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {5509#true} is VALID [2020-07-08 17:38:30,514 INFO L280 TraceCheckUtils]: 20: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-08 17:38:30,514 INFO L280 TraceCheckUtils]: 21: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-08 17:38:30,514 INFO L280 TraceCheckUtils]: 22: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,515 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #156#return; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,515 INFO L263 TraceCheckUtils]: 24: Hoare triple {5513#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {5509#true} is VALID [2020-07-08 17:38:30,516 INFO L280 TraceCheckUtils]: 25: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-08 17:38:30,516 INFO L280 TraceCheckUtils]: 26: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-08 17:38:30,516 INFO L280 TraceCheckUtils]: 27: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,517 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {5509#true} {5513#(<= 0 main_~t~0)} #158#return; {5513#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:30,518 INFO L280 TraceCheckUtils]: 29: Hoare triple {5513#(<= 0 main_~t~0)} #t~post4 := ~t~0; {5522#(<= 0 |main_#t~post4|)} is VALID [2020-07-08 17:38:30,519 INFO L280 TraceCheckUtils]: 30: Hoare triple {5522#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,520 INFO L280 TraceCheckUtils]: 31: Hoare triple {5523#(<= 1 main_~t~0)} havoc #t~post4; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,521 INFO L280 TraceCheckUtils]: 32: Hoare triple {5523#(<= 1 main_~t~0)} assume !false; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,521 INFO L280 TraceCheckUtils]: 33: Hoare triple {5523#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,522 INFO L280 TraceCheckUtils]: 34: Hoare triple {5523#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,523 INFO L280 TraceCheckUtils]: 35: Hoare triple {5523#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,524 INFO L280 TraceCheckUtils]: 36: Hoare triple {5523#(<= 1 main_~t~0)} havoc #t~nondet5; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,525 INFO L280 TraceCheckUtils]: 37: Hoare triple {5523#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,526 INFO L280 TraceCheckUtils]: 38: Hoare triple {5523#(<= 1 main_~t~0)} assume 0 != #t~nondet6; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,526 INFO L280 TraceCheckUtils]: 39: Hoare triple {5523#(<= 1 main_~t~0)} havoc #t~nondet6; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,527 INFO L263 TraceCheckUtils]: 40: Hoare triple {5523#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {5509#true} is VALID [2020-07-08 17:38:30,527 INFO L280 TraceCheckUtils]: 41: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-08 17:38:30,527 INFO L280 TraceCheckUtils]: 42: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-08 17:38:30,527 INFO L280 TraceCheckUtils]: 43: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,529 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #164#return; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,529 INFO L263 TraceCheckUtils]: 45: Hoare triple {5523#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {5509#true} is VALID [2020-07-08 17:38:30,529 INFO L280 TraceCheckUtils]: 46: Hoare triple {5509#true} ~cond := #in~cond; {5509#true} is VALID [2020-07-08 17:38:30,529 INFO L280 TraceCheckUtils]: 47: Hoare triple {5509#true} assume !(0 == ~cond); {5509#true} is VALID [2020-07-08 17:38:30,530 INFO L280 TraceCheckUtils]: 48: Hoare triple {5509#true} assume true; {5509#true} is VALID [2020-07-08 17:38:30,531 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {5509#true} {5523#(<= 1 main_~t~0)} #166#return; {5523#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:30,532 INFO L280 TraceCheckUtils]: 50: Hoare triple {5523#(<= 1 main_~t~0)} #t~post7 := ~t~0; {5532#(<= 1 |main_#t~post7|)} is VALID [2020-07-08 17:38:30,533 INFO L280 TraceCheckUtils]: 51: Hoare triple {5532#(<= 1 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {5533#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:30,534 INFO L280 TraceCheckUtils]: 52: Hoare triple {5533#(<= 2 main_~t~0)} havoc #t~post7; {5533#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:30,535 INFO L280 TraceCheckUtils]: 53: Hoare triple {5533#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {5533#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:30,536 INFO L263 TraceCheckUtils]: 54: Hoare triple {5533#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {5534#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:30,537 INFO L280 TraceCheckUtils]: 55: Hoare triple {5534#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5535#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:30,538 INFO L280 TraceCheckUtils]: 56: Hoare triple {5535#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5510#false} is VALID [2020-07-08 17:38:30,538 INFO L280 TraceCheckUtils]: 57: Hoare triple {5510#false} assume !false; {5510#false} is VALID [2020-07-08 17:38:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:30,541 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:30,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854074920] [2020-07-08 17:38:30,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:30,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:38:30,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221758470] [2020-07-08 17:38:30,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-07-08 17:38:30,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:30,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:38:30,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:30,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:38:30,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:30,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:38:30,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:38:30,603 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 9 states. [2020-07-08 17:38:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:31,647 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2020-07-08 17:38:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 17:38:31,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-07-08 17:38:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2020-07-08 17:38:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2020-07-08 17:38:31,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 135 transitions. [2020-07-08 17:38:31,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:31,821 INFO L225 Difference]: With dead ends: 135 [2020-07-08 17:38:31,822 INFO L226 Difference]: Without dead ends: 133 [2020-07-08 17:38:31,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-08 17:38:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-08 17:38:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2020-07-08 17:38:32,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:32,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 126 states. [2020-07-08 17:38:32,022 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 126 states. [2020-07-08 17:38:32,022 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 126 states. [2020-07-08 17:38:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:32,027 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2020-07-08 17:38:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2020-07-08 17:38:32,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:32,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:32,028 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 133 states. [2020-07-08 17:38:32,028 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 133 states. [2020-07-08 17:38:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:32,033 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2020-07-08 17:38:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2020-07-08 17:38:32,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:32,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:32,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:32,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-08 17:38:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2020-07-08 17:38:32,038 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 58 [2020-07-08 17:38:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:32,039 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2020-07-08 17:38:32,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:38:32,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 143 transitions. [2020-07-08 17:38:32,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2020-07-08 17:38:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-08 17:38:32,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:32,224 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:32,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 17:38:32,224 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:32,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1733407875, now seen corresponding path program 1 times [2020-07-08 17:38:32,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:32,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1726998531] [2020-07-08 17:38:32,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:32,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,389 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6336#true} {6336#true} #144#return; {6336#true} is VALID [2020-07-08 17:38:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:32,394 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-08 17:38:32,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-08 17:38:32,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,395 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #152#return; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:32,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-08 17:38:32,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-08 17:38:32,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,408 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #154#return; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:32,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-08 17:38:32,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-08 17:38:32,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,414 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #156#return; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:32,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-08 17:38:32,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-08 17:38:32,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,423 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #158#return; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,424 INFO L263 TraceCheckUtils]: 0: Hoare triple {6336#true} call ULTIMATE.init(); {6336#true} is VALID [2020-07-08 17:38:32,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,424 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6336#true} {6336#true} #144#return; {6336#true} is VALID [2020-07-08 17:38:32,425 INFO L263 TraceCheckUtils]: 3: Hoare triple {6336#true} call #t~ret10 := main(); {6336#true} is VALID [2020-07-08 17:38:32,425 INFO L280 TraceCheckUtils]: 4: Hoare triple {6336#true} havoc ~tagbuf_len~0; {6336#true} is VALID [2020-07-08 17:38:32,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {6336#true} havoc ~t~0; {6336#true} is VALID [2020-07-08 17:38:32,425 INFO L280 TraceCheckUtils]: 6: Hoare triple {6336#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {6336#true} is VALID [2020-07-08 17:38:32,425 INFO L280 TraceCheckUtils]: 7: Hoare triple {6336#true} ~tagbuf_len~0 := #t~nondet0; {6336#true} is VALID [2020-07-08 17:38:32,426 INFO L280 TraceCheckUtils]: 8: Hoare triple {6336#true} havoc #t~nondet0; {6336#true} is VALID [2020-07-08 17:38:32,426 INFO L280 TraceCheckUtils]: 9: Hoare triple {6336#true} assume ~tagbuf_len~0 >= 1; {6336#true} is VALID [2020-07-08 17:38:32,427 INFO L280 TraceCheckUtils]: 10: Hoare triple {6336#true} ~t~0 := 0; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,428 INFO L280 TraceCheckUtils]: 11: Hoare triple {6340#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,429 INFO L280 TraceCheckUtils]: 12: Hoare triple {6340#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,429 INFO L280 TraceCheckUtils]: 13: Hoare triple {6340#(<= 0 main_~t~0)} havoc #t~pre1; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,430 INFO L280 TraceCheckUtils]: 14: Hoare triple {6340#(<= 0 main_~t~0)} assume !false; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,431 INFO L280 TraceCheckUtils]: 15: Hoare triple {6340#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,431 INFO L280 TraceCheckUtils]: 16: Hoare triple {6340#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,432 INFO L280 TraceCheckUtils]: 17: Hoare triple {6340#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,433 INFO L280 TraceCheckUtils]: 18: Hoare triple {6340#(<= 0 main_~t~0)} havoc #t~nondet2; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,433 INFO L263 TraceCheckUtils]: 19: Hoare triple {6340#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {6336#true} is VALID [2020-07-08 17:38:32,433 INFO L280 TraceCheckUtils]: 20: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-08 17:38:32,433 INFO L280 TraceCheckUtils]: 21: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-08 17:38:32,433 INFO L280 TraceCheckUtils]: 22: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,434 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #152#return; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,435 INFO L263 TraceCheckUtils]: 24: Hoare triple {6340#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {6336#true} is VALID [2020-07-08 17:38:32,435 INFO L280 TraceCheckUtils]: 25: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-08 17:38:32,435 INFO L280 TraceCheckUtils]: 26: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-08 17:38:32,435 INFO L280 TraceCheckUtils]: 27: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,436 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {6336#true} {6340#(<= 0 main_~t~0)} #154#return; {6340#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:32,437 INFO L280 TraceCheckUtils]: 29: Hoare triple {6340#(<= 0 main_~t~0)} #t~post3 := ~t~0; {6349#(<= 0 |main_#t~post3|)} is VALID [2020-07-08 17:38:32,439 INFO L280 TraceCheckUtils]: 30: Hoare triple {6349#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,439 INFO L280 TraceCheckUtils]: 31: Hoare triple {6350#(<= 1 main_~t~0)} havoc #t~post3; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,440 INFO L280 TraceCheckUtils]: 32: Hoare triple {6350#(<= 1 main_~t~0)} assume !false; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,441 INFO L280 TraceCheckUtils]: 33: Hoare triple {6350#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,461 INFO L280 TraceCheckUtils]: 34: Hoare triple {6350#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,465 INFO L280 TraceCheckUtils]: 35: Hoare triple {6350#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,465 INFO L280 TraceCheckUtils]: 36: Hoare triple {6350#(<= 1 main_~t~0)} havoc #t~nondet2; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,466 INFO L263 TraceCheckUtils]: 37: Hoare triple {6350#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {6336#true} is VALID [2020-07-08 17:38:32,466 INFO L280 TraceCheckUtils]: 38: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-08 17:38:32,466 INFO L280 TraceCheckUtils]: 39: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-08 17:38:32,467 INFO L280 TraceCheckUtils]: 40: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,467 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #156#return; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,468 INFO L263 TraceCheckUtils]: 42: Hoare triple {6350#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {6336#true} is VALID [2020-07-08 17:38:32,468 INFO L280 TraceCheckUtils]: 43: Hoare triple {6336#true} ~cond := #in~cond; {6336#true} is VALID [2020-07-08 17:38:32,468 INFO L280 TraceCheckUtils]: 44: Hoare triple {6336#true} assume !(0 == ~cond); {6336#true} is VALID [2020-07-08 17:38:32,468 INFO L280 TraceCheckUtils]: 45: Hoare triple {6336#true} assume true; {6336#true} is VALID [2020-07-08 17:38:32,469 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {6336#true} {6350#(<= 1 main_~t~0)} #158#return; {6350#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:32,470 INFO L280 TraceCheckUtils]: 47: Hoare triple {6350#(<= 1 main_~t~0)} #t~post4 := ~t~0; {6359#(<= 1 |main_#t~post4|)} is VALID [2020-07-08 17:38:32,471 INFO L280 TraceCheckUtils]: 48: Hoare triple {6359#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,472 INFO L280 TraceCheckUtils]: 49: Hoare triple {6360#(<= 2 main_~t~0)} havoc #t~post4; {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,472 INFO L280 TraceCheckUtils]: 50: Hoare triple {6360#(<= 2 main_~t~0)} assume !false; {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,473 INFO L280 TraceCheckUtils]: 51: Hoare triple {6360#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,474 INFO L280 TraceCheckUtils]: 52: Hoare triple {6360#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,475 INFO L280 TraceCheckUtils]: 53: Hoare triple {6360#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,475 INFO L280 TraceCheckUtils]: 54: Hoare triple {6360#(<= 2 main_~t~0)} havoc #t~nondet5; {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,476 INFO L280 TraceCheckUtils]: 55: Hoare triple {6360#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,477 INFO L280 TraceCheckUtils]: 56: Hoare triple {6360#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,478 INFO L280 TraceCheckUtils]: 57: Hoare triple {6360#(<= 2 main_~t~0)} havoc #t~nondet6; {6360#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:32,479 INFO L263 TraceCheckUtils]: 58: Hoare triple {6360#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {6361#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:32,479 INFO L280 TraceCheckUtils]: 59: Hoare triple {6361#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6362#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:32,480 INFO L280 TraceCheckUtils]: 60: Hoare triple {6362#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6337#false} is VALID [2020-07-08 17:38:32,481 INFO L280 TraceCheckUtils]: 61: Hoare triple {6337#false} assume !false; {6337#false} is VALID [2020-07-08 17:38:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:32,484 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:32,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1726998531] [2020-07-08 17:38:32,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:32,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:38:32,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663683980] [2020-07-08 17:38:32,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-07-08 17:38:32,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:32,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:38:32,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:32,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:38:32,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:32,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:38:32,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:38:32,555 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 9 states. [2020-07-08 17:38:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:33,618 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2020-07-08 17:38:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 17:38:33,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-07-08 17:38:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2020-07-08 17:38:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2020-07-08 17:38:33,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 132 transitions. [2020-07-08 17:38:33,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:33,785 INFO L225 Difference]: With dead ends: 158 [2020-07-08 17:38:33,786 INFO L226 Difference]: Without dead ends: 156 [2020-07-08 17:38:33,787 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-08 17:38:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-07-08 17:38:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2020-07-08 17:38:34,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:34,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 147 states. [2020-07-08 17:38:34,038 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 147 states. [2020-07-08 17:38:34,038 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 147 states. [2020-07-08 17:38:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:34,044 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2020-07-08 17:38:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2020-07-08 17:38:34,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:34,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:34,045 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 156 states. [2020-07-08 17:38:34,045 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 156 states. [2020-07-08 17:38:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:34,052 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2020-07-08 17:38:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2020-07-08 17:38:34,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:34,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:34,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:34,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-07-08 17:38:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2020-07-08 17:38:34,060 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 62 [2020-07-08 17:38:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:34,061 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2020-07-08 17:38:34,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:38:34,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 147 states and 169 transitions. [2020-07-08 17:38:34,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2020-07-08 17:38:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-08 17:38:34,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:34,308 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:34,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 17:38:34,308 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:34,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:34,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1967257859, now seen corresponding path program 1 times [2020-07-08 17:38:34,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:34,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198869256] [2020-07-08 17:38:34,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:34,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,557 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7297#true} {7297#true} #144#return; {7297#true} is VALID [2020-07-08 17:38:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:34,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:34,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,578 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,579 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:34,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,587 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,588 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:34,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,594 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,595 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:34,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,602 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7297#true} {7303#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,602 INFO L263 TraceCheckUtils]: 0: Hoare triple {7297#true} call ULTIMATE.init(); {7297#true} is VALID [2020-07-08 17:38:34,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,602 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7297#true} {7297#true} #144#return; {7297#true} is VALID [2020-07-08 17:38:34,603 INFO L263 TraceCheckUtils]: 3: Hoare triple {7297#true} call #t~ret10 := main(); {7297#true} is VALID [2020-07-08 17:38:34,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {7297#true} havoc ~tagbuf_len~0; {7297#true} is VALID [2020-07-08 17:38:34,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {7297#true} havoc ~t~0; {7297#true} is VALID [2020-07-08 17:38:34,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {7297#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7297#true} is VALID [2020-07-08 17:38:34,603 INFO L280 TraceCheckUtils]: 7: Hoare triple {7297#true} ~tagbuf_len~0 := #t~nondet0; {7297#true} is VALID [2020-07-08 17:38:34,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {7297#true} havoc #t~nondet0; {7297#true} is VALID [2020-07-08 17:38:34,604 INFO L280 TraceCheckUtils]: 9: Hoare triple {7297#true} assume ~tagbuf_len~0 >= 1; {7301#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,605 INFO L280 TraceCheckUtils]: 10: Hoare triple {7301#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,606 INFO L280 TraceCheckUtils]: 11: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,607 INFO L280 TraceCheckUtils]: 12: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,609 INFO L280 TraceCheckUtils]: 16: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,610 INFO L280 TraceCheckUtils]: 17: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,611 INFO L263 TraceCheckUtils]: 19: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {7297#true} is VALID [2020-07-08 17:38:34,611 INFO L280 TraceCheckUtils]: 20: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,611 INFO L280 TraceCheckUtils]: 21: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,611 INFO L280 TraceCheckUtils]: 22: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,612 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,612 INFO L263 TraceCheckUtils]: 24: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {7297#true} is VALID [2020-07-08 17:38:34,613 INFO L280 TraceCheckUtils]: 25: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,613 INFO L280 TraceCheckUtils]: 26: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,613 INFO L280 TraceCheckUtils]: 27: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,614 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,615 INFO L280 TraceCheckUtils]: 29: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {7312#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,616 INFO L280 TraceCheckUtils]: 30: Hoare triple {7312#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,617 INFO L280 TraceCheckUtils]: 31: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,617 INFO L280 TraceCheckUtils]: 32: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,618 INFO L280 TraceCheckUtils]: 33: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,619 INFO L280 TraceCheckUtils]: 34: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,619 INFO L280 TraceCheckUtils]: 35: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,620 INFO L280 TraceCheckUtils]: 36: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,620 INFO L280 TraceCheckUtils]: 37: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,621 INFO L280 TraceCheckUtils]: 38: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,622 INFO L280 TraceCheckUtils]: 39: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,622 INFO L263 TraceCheckUtils]: 40: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {7297#true} is VALID [2020-07-08 17:38:34,622 INFO L280 TraceCheckUtils]: 41: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,622 INFO L280 TraceCheckUtils]: 42: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,623 INFO L280 TraceCheckUtils]: 43: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,624 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,624 INFO L263 TraceCheckUtils]: 45: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {7297#true} is VALID [2020-07-08 17:38:34,624 INFO L280 TraceCheckUtils]: 46: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,624 INFO L280 TraceCheckUtils]: 47: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,625 INFO L280 TraceCheckUtils]: 48: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,625 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {7297#true} {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,626 INFO L280 TraceCheckUtils]: 50: Hoare triple {7302#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {7321#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,627 INFO L280 TraceCheckUtils]: 51: Hoare triple {7321#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,628 INFO L280 TraceCheckUtils]: 52: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,629 INFO L280 TraceCheckUtils]: 53: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,629 INFO L263 TraceCheckUtils]: 54: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {7297#true} is VALID [2020-07-08 17:38:34,629 INFO L280 TraceCheckUtils]: 55: Hoare triple {7297#true} ~cond := #in~cond; {7297#true} is VALID [2020-07-08 17:38:34,629 INFO L280 TraceCheckUtils]: 56: Hoare triple {7297#true} assume !(0 == ~cond); {7297#true} is VALID [2020-07-08 17:38:34,630 INFO L280 TraceCheckUtils]: 57: Hoare triple {7297#true} assume true; {7297#true} is VALID [2020-07-08 17:38:34,630 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {7297#true} {7303#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {7303#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:34,631 INFO L263 TraceCheckUtils]: 59: Hoare triple {7303#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {7326#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:34,632 INFO L280 TraceCheckUtils]: 60: Hoare triple {7326#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7327#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:34,633 INFO L280 TraceCheckUtils]: 61: Hoare triple {7327#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7298#false} is VALID [2020-07-08 17:38:34,633 INFO L280 TraceCheckUtils]: 62: Hoare triple {7298#false} assume !false; {7298#false} is VALID [2020-07-08 17:38:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:34,637 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:34,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198869256] [2020-07-08 17:38:34,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:34,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:38:34,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302292568] [2020-07-08 17:38:34,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-07-08 17:38:34,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:34,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:38:34,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:34,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:38:34,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:34,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:38:34,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:38:34,699 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 9 states. [2020-07-08 17:38:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:35,805 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2020-07-08 17:38:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 17:38:35,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-07-08 17:38:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2020-07-08 17:38:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2020-07-08 17:38:35,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 129 transitions. [2020-07-08 17:38:35,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:35,965 INFO L225 Difference]: With dead ends: 158 [2020-07-08 17:38:35,965 INFO L226 Difference]: Without dead ends: 156 [2020-07-08 17:38:35,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-08 17:38:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-07-08 17:38:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2020-07-08 17:38:36,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:36,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 152 states. [2020-07-08 17:38:36,215 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 152 states. [2020-07-08 17:38:36,216 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 152 states. [2020-07-08 17:38:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:36,223 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2020-07-08 17:38:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2020-07-08 17:38:36,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:36,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:36,224 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 156 states. [2020-07-08 17:38:36,225 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 156 states. [2020-07-08 17:38:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:36,230 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2020-07-08 17:38:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2020-07-08 17:38:36,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:36,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:36,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:36,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-08 17:38:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2020-07-08 17:38:36,240 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 63 [2020-07-08 17:38:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:36,241 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2020-07-08 17:38:36,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:38:36,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 152 states and 174 transitions. [2020-07-08 17:38:36,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2020-07-08 17:38:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-08 17:38:36,485 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:36,485 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:36,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 17:38:36,486 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:36,486 INFO L82 PathProgramCache]: Analyzing trace with hash -822659134, now seen corresponding path program 1 times [2020-07-08 17:38:36,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:36,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [277262825] [2020-07-08 17:38:36,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:36,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,612 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8274#true} {8274#true} #144#return; {8274#true} is VALID [2020-07-08 17:38:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:36,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-08 17:38:36,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-08 17:38:36,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,618 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #156#return; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:36,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-08 17:38:36,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-08 17:38:36,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,626 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #158#return; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:36,631 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-08 17:38:36,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-08 17:38:36,632 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,632 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #172#return; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:36,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-08 17:38:36,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-08 17:38:36,641 INFO L280 TraceCheckUtils]: 2: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,641 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #174#return; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,641 INFO L263 TraceCheckUtils]: 0: Hoare triple {8274#true} call ULTIMATE.init(); {8274#true} is VALID [2020-07-08 17:38:36,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,642 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8274#true} {8274#true} #144#return; {8274#true} is VALID [2020-07-08 17:38:36,642 INFO L263 TraceCheckUtils]: 3: Hoare triple {8274#true} call #t~ret10 := main(); {8274#true} is VALID [2020-07-08 17:38:36,642 INFO L280 TraceCheckUtils]: 4: Hoare triple {8274#true} havoc ~tagbuf_len~0; {8274#true} is VALID [2020-07-08 17:38:36,642 INFO L280 TraceCheckUtils]: 5: Hoare triple {8274#true} havoc ~t~0; {8274#true} is VALID [2020-07-08 17:38:36,642 INFO L280 TraceCheckUtils]: 6: Hoare triple {8274#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8274#true} is VALID [2020-07-08 17:38:36,642 INFO L280 TraceCheckUtils]: 7: Hoare triple {8274#true} ~tagbuf_len~0 := #t~nondet0; {8274#true} is VALID [2020-07-08 17:38:36,643 INFO L280 TraceCheckUtils]: 8: Hoare triple {8274#true} havoc #t~nondet0; {8274#true} is VALID [2020-07-08 17:38:36,643 INFO L280 TraceCheckUtils]: 9: Hoare triple {8274#true} assume ~tagbuf_len~0 >= 1; {8274#true} is VALID [2020-07-08 17:38:36,643 INFO L280 TraceCheckUtils]: 10: Hoare triple {8274#true} ~t~0 := 0; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,646 INFO L280 TraceCheckUtils]: 11: Hoare triple {8278#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,648 INFO L280 TraceCheckUtils]: 12: Hoare triple {8278#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,650 INFO L280 TraceCheckUtils]: 13: Hoare triple {8278#(<= 0 main_~t~0)} havoc #t~pre1; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,652 INFO L280 TraceCheckUtils]: 14: Hoare triple {8278#(<= 0 main_~t~0)} assume !false; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,655 INFO L280 TraceCheckUtils]: 15: Hoare triple {8278#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,655 INFO L280 TraceCheckUtils]: 16: Hoare triple {8278#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,656 INFO L280 TraceCheckUtils]: 17: Hoare triple {8278#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,657 INFO L280 TraceCheckUtils]: 18: Hoare triple {8278#(<= 0 main_~t~0)} havoc #t~nondet2; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,657 INFO L263 TraceCheckUtils]: 19: Hoare triple {8278#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {8274#true} is VALID [2020-07-08 17:38:36,657 INFO L280 TraceCheckUtils]: 20: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-08 17:38:36,658 INFO L280 TraceCheckUtils]: 21: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-08 17:38:36,658 INFO L280 TraceCheckUtils]: 22: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,659 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #156#return; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,659 INFO L263 TraceCheckUtils]: 24: Hoare triple {8278#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {8274#true} is VALID [2020-07-08 17:38:36,659 INFO L280 TraceCheckUtils]: 25: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-08 17:38:36,659 INFO L280 TraceCheckUtils]: 26: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-08 17:38:36,659 INFO L280 TraceCheckUtils]: 27: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,660 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {8274#true} {8278#(<= 0 main_~t~0)} #158#return; {8278#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:36,661 INFO L280 TraceCheckUtils]: 29: Hoare triple {8278#(<= 0 main_~t~0)} #t~post4 := ~t~0; {8287#(<= 0 |main_#t~post4|)} is VALID [2020-07-08 17:38:36,662 INFO L280 TraceCheckUtils]: 30: Hoare triple {8287#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,663 INFO L280 TraceCheckUtils]: 31: Hoare triple {8288#(<= 1 main_~t~0)} havoc #t~post4; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,663 INFO L280 TraceCheckUtils]: 32: Hoare triple {8288#(<= 1 main_~t~0)} assume !false; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,664 INFO L280 TraceCheckUtils]: 33: Hoare triple {8288#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,665 INFO L280 TraceCheckUtils]: 34: Hoare triple {8288#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,666 INFO L280 TraceCheckUtils]: 35: Hoare triple {8288#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,666 INFO L280 TraceCheckUtils]: 36: Hoare triple {8288#(<= 1 main_~t~0)} havoc #t~nondet5; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,667 INFO L280 TraceCheckUtils]: 37: Hoare triple {8288#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,670 INFO L280 TraceCheckUtils]: 38: Hoare triple {8288#(<= 1 main_~t~0)} assume !(0 != #t~nondet6); {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,673 INFO L280 TraceCheckUtils]: 39: Hoare triple {8288#(<= 1 main_~t~0)} havoc #t~nondet6; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,673 INFO L263 TraceCheckUtils]: 40: Hoare triple {8288#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {8274#true} is VALID [2020-07-08 17:38:36,673 INFO L280 TraceCheckUtils]: 41: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-08 17:38:36,673 INFO L280 TraceCheckUtils]: 42: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-08 17:38:36,673 INFO L280 TraceCheckUtils]: 43: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,674 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #172#return; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,674 INFO L263 TraceCheckUtils]: 45: Hoare triple {8288#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {8274#true} is VALID [2020-07-08 17:38:36,674 INFO L280 TraceCheckUtils]: 46: Hoare triple {8274#true} ~cond := #in~cond; {8274#true} is VALID [2020-07-08 17:38:36,674 INFO L280 TraceCheckUtils]: 47: Hoare triple {8274#true} assume !(0 == ~cond); {8274#true} is VALID [2020-07-08 17:38:36,674 INFO L280 TraceCheckUtils]: 48: Hoare triple {8274#true} assume true; {8274#true} is VALID [2020-07-08 17:38:36,675 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {8274#true} {8288#(<= 1 main_~t~0)} #174#return; {8288#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:36,676 INFO L280 TraceCheckUtils]: 50: Hoare triple {8288#(<= 1 main_~t~0)} #t~post9 := ~t~0; {8297#(<= 1 |main_#t~post9|)} is VALID [2020-07-08 17:38:36,677 INFO L280 TraceCheckUtils]: 51: Hoare triple {8297#(<= 1 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,678 INFO L280 TraceCheckUtils]: 52: Hoare triple {8298#(<= 2 main_~t~0)} havoc #t~post9; {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,678 INFO L280 TraceCheckUtils]: 53: Hoare triple {8298#(<= 2 main_~t~0)} assume !false; {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,679 INFO L280 TraceCheckUtils]: 54: Hoare triple {8298#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,679 INFO L280 TraceCheckUtils]: 55: Hoare triple {8298#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,679 INFO L280 TraceCheckUtils]: 56: Hoare triple {8298#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,680 INFO L280 TraceCheckUtils]: 57: Hoare triple {8298#(<= 2 main_~t~0)} havoc #t~nondet5; {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,680 INFO L280 TraceCheckUtils]: 58: Hoare triple {8298#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,681 INFO L280 TraceCheckUtils]: 59: Hoare triple {8298#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,681 INFO L280 TraceCheckUtils]: 60: Hoare triple {8298#(<= 2 main_~t~0)} havoc #t~nondet6; {8298#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:36,682 INFO L263 TraceCheckUtils]: 61: Hoare triple {8298#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {8299#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:36,682 INFO L280 TraceCheckUtils]: 62: Hoare triple {8299#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8300#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:36,683 INFO L280 TraceCheckUtils]: 63: Hoare triple {8300#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8275#false} is VALID [2020-07-08 17:38:36,683 INFO L280 TraceCheckUtils]: 64: Hoare triple {8275#false} assume !false; {8275#false} is VALID [2020-07-08 17:38:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:36,686 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:36,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [277262825] [2020-07-08 17:38:36,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:36,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:38:36,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967843346] [2020-07-08 17:38:36,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-08 17:38:36,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:36,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:38:36,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:36,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:38:36,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:38:36,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:38:36,757 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 9 states. [2020-07-08 17:38:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:37,979 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2020-07-08 17:38:37,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 17:38:37,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-07-08 17:38:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2020-07-08 17:38:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2020-07-08 17:38:37,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 160 transitions. [2020-07-08 17:38:38,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:38,192 INFO L225 Difference]: With dead ends: 187 [2020-07-08 17:38:38,192 INFO L226 Difference]: Without dead ends: 185 [2020-07-08 17:38:38,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-08 17:38:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-08 17:38:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2020-07-08 17:38:38,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:38,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 177 states. [2020-07-08 17:38:38,515 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 177 states. [2020-07-08 17:38:38,515 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 177 states. [2020-07-08 17:38:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:38,523 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2020-07-08 17:38:38,523 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2020-07-08 17:38:38,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:38,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:38,525 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 185 states. [2020-07-08 17:38:38,525 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 185 states. [2020-07-08 17:38:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:38,532 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2020-07-08 17:38:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 214 transitions. [2020-07-08 17:38:38,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:38,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:38,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:38,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-08 17:38:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2020-07-08 17:38:38,540 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 65 [2020-07-08 17:38:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:38,540 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2020-07-08 17:38:38,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:38:38,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 177 states and 205 transitions. [2020-07-08 17:38:38,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2020-07-08 17:38:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-08 17:38:38,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:38,825 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:38,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 17:38:38,825 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:38,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:38,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1510377470, now seen corresponding path program 1 times [2020-07-08 17:38:38,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:38,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219629572] [2020-07-08 17:38:38,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:39,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,039 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9411#true} {9411#true} #144#return; {9411#true} is VALID [2020-07-08 17:38:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:39,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,044 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:39,050 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,050 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,051 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:39,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,073 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,073 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,074 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:39,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,082 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:39,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,093 INFO L280 TraceCheckUtils]: 2: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,094 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9411#true} {9417#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,094 INFO L263 TraceCheckUtils]: 0: Hoare triple {9411#true} call ULTIMATE.init(); {9411#true} is VALID [2020-07-08 17:38:39,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,095 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9411#true} {9411#true} #144#return; {9411#true} is VALID [2020-07-08 17:38:39,095 INFO L263 TraceCheckUtils]: 3: Hoare triple {9411#true} call #t~ret10 := main(); {9411#true} is VALID [2020-07-08 17:38:39,095 INFO L280 TraceCheckUtils]: 4: Hoare triple {9411#true} havoc ~tagbuf_len~0; {9411#true} is VALID [2020-07-08 17:38:39,095 INFO L280 TraceCheckUtils]: 5: Hoare triple {9411#true} havoc ~t~0; {9411#true} is VALID [2020-07-08 17:38:39,096 INFO L280 TraceCheckUtils]: 6: Hoare triple {9411#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9411#true} is VALID [2020-07-08 17:38:39,096 INFO L280 TraceCheckUtils]: 7: Hoare triple {9411#true} ~tagbuf_len~0 := #t~nondet0; {9411#true} is VALID [2020-07-08 17:38:39,096 INFO L280 TraceCheckUtils]: 8: Hoare triple {9411#true} havoc #t~nondet0; {9411#true} is VALID [2020-07-08 17:38:39,098 INFO L280 TraceCheckUtils]: 9: Hoare triple {9411#true} assume ~tagbuf_len~0 >= 1; {9415#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,099 INFO L280 TraceCheckUtils]: 10: Hoare triple {9415#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,100 INFO L280 TraceCheckUtils]: 11: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,101 INFO L280 TraceCheckUtils]: 12: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,101 INFO L280 TraceCheckUtils]: 13: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,102 INFO L280 TraceCheckUtils]: 14: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,103 INFO L280 TraceCheckUtils]: 15: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,104 INFO L280 TraceCheckUtils]: 16: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,105 INFO L280 TraceCheckUtils]: 17: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,105 INFO L280 TraceCheckUtils]: 18: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,106 INFO L263 TraceCheckUtils]: 19: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {9411#true} is VALID [2020-07-08 17:38:39,106 INFO L280 TraceCheckUtils]: 20: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,106 INFO L280 TraceCheckUtils]: 21: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,106 INFO L280 TraceCheckUtils]: 22: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,107 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,107 INFO L263 TraceCheckUtils]: 24: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {9411#true} is VALID [2020-07-08 17:38:39,108 INFO L280 TraceCheckUtils]: 25: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,108 INFO L280 TraceCheckUtils]: 26: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,108 INFO L280 TraceCheckUtils]: 27: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,109 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,110 INFO L280 TraceCheckUtils]: 29: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {9426#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,111 INFO L280 TraceCheckUtils]: 30: Hoare triple {9426#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,111 INFO L280 TraceCheckUtils]: 31: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,112 INFO L280 TraceCheckUtils]: 32: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,113 INFO L280 TraceCheckUtils]: 33: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,114 INFO L280 TraceCheckUtils]: 34: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,115 INFO L280 TraceCheckUtils]: 35: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,115 INFO L280 TraceCheckUtils]: 36: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,116 INFO L263 TraceCheckUtils]: 37: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {9411#true} is VALID [2020-07-08 17:38:39,116 INFO L280 TraceCheckUtils]: 38: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,116 INFO L280 TraceCheckUtils]: 39: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,117 INFO L280 TraceCheckUtils]: 40: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,118 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,118 INFO L263 TraceCheckUtils]: 42: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {9411#true} is VALID [2020-07-08 17:38:39,118 INFO L280 TraceCheckUtils]: 43: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,118 INFO L280 TraceCheckUtils]: 44: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,119 INFO L280 TraceCheckUtils]: 45: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,121 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {9411#true} {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,122 INFO L280 TraceCheckUtils]: 47: Hoare triple {9416#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {9435#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,123 INFO L280 TraceCheckUtils]: 48: Hoare triple {9435#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,124 INFO L280 TraceCheckUtils]: 49: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,125 INFO L280 TraceCheckUtils]: 50: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,125 INFO L280 TraceCheckUtils]: 51: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,126 INFO L280 TraceCheckUtils]: 52: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,126 INFO L280 TraceCheckUtils]: 53: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,127 INFO L280 TraceCheckUtils]: 54: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,127 INFO L280 TraceCheckUtils]: 55: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,128 INFO L280 TraceCheckUtils]: 56: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,129 INFO L280 TraceCheckUtils]: 57: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,129 INFO L263 TraceCheckUtils]: 58: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {9411#true} is VALID [2020-07-08 17:38:39,129 INFO L280 TraceCheckUtils]: 59: Hoare triple {9411#true} ~cond := #in~cond; {9411#true} is VALID [2020-07-08 17:38:39,129 INFO L280 TraceCheckUtils]: 60: Hoare triple {9411#true} assume !(0 == ~cond); {9411#true} is VALID [2020-07-08 17:38:39,130 INFO L280 TraceCheckUtils]: 61: Hoare triple {9411#true} assume true; {9411#true} is VALID [2020-07-08 17:38:39,130 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {9411#true} {9417#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {9417#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:39,132 INFO L263 TraceCheckUtils]: 63: Hoare triple {9417#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {9440#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:39,133 INFO L280 TraceCheckUtils]: 64: Hoare triple {9440#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {9441#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:39,134 INFO L280 TraceCheckUtils]: 65: Hoare triple {9441#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {9412#false} is VALID [2020-07-08 17:38:39,134 INFO L280 TraceCheckUtils]: 66: Hoare triple {9412#false} assume !false; {9412#false} is VALID [2020-07-08 17:38:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:39,139 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:39,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219629572] [2020-07-08 17:38:39,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:39,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:38:39,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331048303] [2020-07-08 17:38:39,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-08 17:38:39,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:39,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:38:39,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:39,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:38:39,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:38:39,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:38:39,210 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand 9 states. [2020-07-08 17:38:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:40,432 INFO L93 Difference]: Finished difference Result 192 states and 221 transitions. [2020-07-08 17:38:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 17:38:40,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-07-08 17:38:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-08 17:38:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-08 17:38:40,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2020-07-08 17:38:40,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:40,625 INFO L225 Difference]: With dead ends: 192 [2020-07-08 17:38:40,626 INFO L226 Difference]: Without dead ends: 187 [2020-07-08 17:38:40,630 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-08 17:38:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-07-08 17:38:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2020-07-08 17:38:41,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:41,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 181 states. [2020-07-08 17:38:41,031 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 181 states. [2020-07-08 17:38:41,031 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 181 states. [2020-07-08 17:38:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:41,041 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2020-07-08 17:38:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2020-07-08 17:38:41,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:41,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:41,043 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 187 states. [2020-07-08 17:38:41,044 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 187 states. [2020-07-08 17:38:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:41,052 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2020-07-08 17:38:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2020-07-08 17:38:41,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:41,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:41,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:41,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-07-08 17:38:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2020-07-08 17:38:41,062 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 67 [2020-07-08 17:38:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:41,063 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2020-07-08 17:38:41,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:38:41,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 181 states and 208 transitions. [2020-07-08 17:38:41,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2020-07-08 17:38:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-07-08 17:38:41,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:41,445 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:41,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 17:38:41,445 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:41,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:41,446 INFO L82 PathProgramCache]: Analyzing trace with hash 869213219, now seen corresponding path program 2 times [2020-07-08 17:38:41,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:41,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [232419788] [2020-07-08 17:38:41,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:41,662 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,662 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10576#true} {10576#true} #144#return; {10576#true} is VALID [2020-07-08 17:38:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:41,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,672 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:41,678 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,680 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:41,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,691 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:41,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,701 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:41,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,711 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10576#true} {10582#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,711 INFO L263 TraceCheckUtils]: 0: Hoare triple {10576#true} call ULTIMATE.init(); {10576#true} is VALID [2020-07-08 17:38:41,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,712 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10576#true} {10576#true} #144#return; {10576#true} is VALID [2020-07-08 17:38:41,712 INFO L263 TraceCheckUtils]: 3: Hoare triple {10576#true} call #t~ret10 := main(); {10576#true} is VALID [2020-07-08 17:38:41,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {10576#true} havoc ~tagbuf_len~0; {10576#true} is VALID [2020-07-08 17:38:41,713 INFO L280 TraceCheckUtils]: 5: Hoare triple {10576#true} havoc ~t~0; {10576#true} is VALID [2020-07-08 17:38:41,713 INFO L280 TraceCheckUtils]: 6: Hoare triple {10576#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {10576#true} is VALID [2020-07-08 17:38:41,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {10576#true} ~tagbuf_len~0 := #t~nondet0; {10576#true} is VALID [2020-07-08 17:38:41,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {10576#true} havoc #t~nondet0; {10576#true} is VALID [2020-07-08 17:38:41,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {10576#true} assume ~tagbuf_len~0 >= 1; {10580#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,716 INFO L280 TraceCheckUtils]: 10: Hoare triple {10580#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,718 INFO L280 TraceCheckUtils]: 12: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,719 INFO L280 TraceCheckUtils]: 13: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,721 INFO L280 TraceCheckUtils]: 14: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,722 INFO L280 TraceCheckUtils]: 15: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,723 INFO L280 TraceCheckUtils]: 16: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,723 INFO L280 TraceCheckUtils]: 17: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,724 INFO L280 TraceCheckUtils]: 18: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,725 INFO L263 TraceCheckUtils]: 19: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {10576#true} is VALID [2020-07-08 17:38:41,725 INFO L280 TraceCheckUtils]: 20: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,725 INFO L280 TraceCheckUtils]: 21: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,726 INFO L280 TraceCheckUtils]: 22: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,727 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,727 INFO L263 TraceCheckUtils]: 24: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {10576#true} is VALID [2020-07-08 17:38:41,728 INFO L280 TraceCheckUtils]: 25: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,728 INFO L280 TraceCheckUtils]: 26: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,728 INFO L280 TraceCheckUtils]: 27: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,730 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,731 INFO L280 TraceCheckUtils]: 29: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {10591#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,732 INFO L280 TraceCheckUtils]: 30: Hoare triple {10591#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,733 INFO L280 TraceCheckUtils]: 31: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,736 INFO L280 TraceCheckUtils]: 32: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,737 INFO L280 TraceCheckUtils]: 33: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,739 INFO L280 TraceCheckUtils]: 34: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,740 INFO L280 TraceCheckUtils]: 35: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,740 INFO L280 TraceCheckUtils]: 36: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,741 INFO L280 TraceCheckUtils]: 37: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,743 INFO L280 TraceCheckUtils]: 38: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,743 INFO L280 TraceCheckUtils]: 39: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,744 INFO L263 TraceCheckUtils]: 40: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {10576#true} is VALID [2020-07-08 17:38:41,744 INFO L280 TraceCheckUtils]: 41: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,744 INFO L280 TraceCheckUtils]: 42: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,745 INFO L280 TraceCheckUtils]: 43: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,746 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,746 INFO L263 TraceCheckUtils]: 45: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {10576#true} is VALID [2020-07-08 17:38:41,747 INFO L280 TraceCheckUtils]: 46: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,747 INFO L280 TraceCheckUtils]: 47: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,747 INFO L280 TraceCheckUtils]: 48: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,748 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {10576#true} {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,750 INFO L280 TraceCheckUtils]: 50: Hoare triple {10581#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {10600#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,751 INFO L280 TraceCheckUtils]: 51: Hoare triple {10600#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,752 INFO L280 TraceCheckUtils]: 52: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,753 INFO L280 TraceCheckUtils]: 53: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,754 INFO L280 TraceCheckUtils]: 54: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,755 INFO L280 TraceCheckUtils]: 55: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,756 INFO L280 TraceCheckUtils]: 56: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,756 INFO L280 TraceCheckUtils]: 57: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,757 INFO L280 TraceCheckUtils]: 58: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,758 INFO L280 TraceCheckUtils]: 59: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,759 INFO L280 TraceCheckUtils]: 60: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,759 INFO L263 TraceCheckUtils]: 61: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {10576#true} is VALID [2020-07-08 17:38:41,760 INFO L280 TraceCheckUtils]: 62: Hoare triple {10576#true} ~cond := #in~cond; {10576#true} is VALID [2020-07-08 17:38:41,760 INFO L280 TraceCheckUtils]: 63: Hoare triple {10576#true} assume !(0 == ~cond); {10576#true} is VALID [2020-07-08 17:38:41,760 INFO L280 TraceCheckUtils]: 64: Hoare triple {10576#true} assume true; {10576#true} is VALID [2020-07-08 17:38:41,762 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {10576#true} {10582#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {10582#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:41,763 INFO L263 TraceCheckUtils]: 66: Hoare triple {10582#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {10605#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:41,764 INFO L280 TraceCheckUtils]: 67: Hoare triple {10605#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {10606#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:41,765 INFO L280 TraceCheckUtils]: 68: Hoare triple {10606#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {10577#false} is VALID [2020-07-08 17:38:41,766 INFO L280 TraceCheckUtils]: 69: Hoare triple {10577#false} assume !false; {10577#false} is VALID [2020-07-08 17:38:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:41,774 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:41,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [232419788] [2020-07-08 17:38:41,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:41,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:38:41,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841690876] [2020-07-08 17:38:41,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2020-07-08 17:38:41,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:41,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:38:41,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:41,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:38:41,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:41,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:38:41,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:38:41,866 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand 9 states. [2020-07-08 17:38:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:43,251 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions. [2020-07-08 17:38:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 17:38:43,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2020-07-08 17:38:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2020-07-08 17:38:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:38:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2020-07-08 17:38:43,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 133 transitions. [2020-07-08 17:38:43,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:43,444 INFO L225 Difference]: With dead ends: 193 [2020-07-08 17:38:43,444 INFO L226 Difference]: Without dead ends: 188 [2020-07-08 17:38:43,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-08 17:38:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-07-08 17:38:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2020-07-08 17:38:43,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:43,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 184 states. [2020-07-08 17:38:43,746 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 184 states. [2020-07-08 17:38:43,746 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 184 states. [2020-07-08 17:38:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:43,752 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions. [2020-07-08 17:38:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2020-07-08 17:38:43,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:43,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:43,754 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 188 states. [2020-07-08 17:38:43,754 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 188 states. [2020-07-08 17:38:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:43,760 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions. [2020-07-08 17:38:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2020-07-08 17:38:43,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:43,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:43,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:43,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-08 17:38:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2020-07-08 17:38:43,767 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 70 [2020-07-08 17:38:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:43,768 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2020-07-08 17:38:43,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:38:43,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 184 states and 209 transitions. [2020-07-08 17:38:44,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2020-07-08 17:38:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-08 17:38:44,073 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:44,073 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 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, 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] [2020-07-08 17:38:44,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 17:38:44,074 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:44,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:44,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1269119089, now seen corresponding path program 1 times [2020-07-08 17:38:44,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:44,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105115473] [2020-07-08 17:38:44,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:44,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,225 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11751#true} {11751#true} #144#return; {11751#true} is VALID [2020-07-08 17:38:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:44,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,232 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #152#return; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:44,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,238 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #154#return; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:44,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,244 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #156#return; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:44,249 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,250 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,251 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #158#return; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:44,256 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,256 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,257 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #164#return; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:44,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,264 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #166#return; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,265 INFO L263 TraceCheckUtils]: 0: Hoare triple {11751#true} call ULTIMATE.init(); {11751#true} is VALID [2020-07-08 17:38:44,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,266 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11751#true} {11751#true} #144#return; {11751#true} is VALID [2020-07-08 17:38:44,266 INFO L263 TraceCheckUtils]: 3: Hoare triple {11751#true} call #t~ret10 := main(); {11751#true} is VALID [2020-07-08 17:38:44,266 INFO L280 TraceCheckUtils]: 4: Hoare triple {11751#true} havoc ~tagbuf_len~0; {11751#true} is VALID [2020-07-08 17:38:44,266 INFO L280 TraceCheckUtils]: 5: Hoare triple {11751#true} havoc ~t~0; {11751#true} is VALID [2020-07-08 17:38:44,267 INFO L280 TraceCheckUtils]: 6: Hoare triple {11751#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {11751#true} is VALID [2020-07-08 17:38:44,267 INFO L280 TraceCheckUtils]: 7: Hoare triple {11751#true} ~tagbuf_len~0 := #t~nondet0; {11751#true} is VALID [2020-07-08 17:38:44,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {11751#true} havoc #t~nondet0; {11751#true} is VALID [2020-07-08 17:38:44,268 INFO L280 TraceCheckUtils]: 9: Hoare triple {11751#true} assume ~tagbuf_len~0 >= 1; {11751#true} is VALID [2020-07-08 17:38:44,268 INFO L280 TraceCheckUtils]: 10: Hoare triple {11751#true} ~t~0 := 0; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,269 INFO L280 TraceCheckUtils]: 11: Hoare triple {11755#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,270 INFO L280 TraceCheckUtils]: 12: Hoare triple {11755#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,271 INFO L280 TraceCheckUtils]: 13: Hoare triple {11755#(<= 0 main_~t~0)} havoc #t~pre1; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,271 INFO L280 TraceCheckUtils]: 14: Hoare triple {11755#(<= 0 main_~t~0)} assume !false; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,272 INFO L280 TraceCheckUtils]: 15: Hoare triple {11755#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,273 INFO L280 TraceCheckUtils]: 16: Hoare triple {11755#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,274 INFO L280 TraceCheckUtils]: 17: Hoare triple {11755#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,274 INFO L280 TraceCheckUtils]: 18: Hoare triple {11755#(<= 0 main_~t~0)} havoc #t~nondet2; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,275 INFO L263 TraceCheckUtils]: 19: Hoare triple {11755#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11751#true} is VALID [2020-07-08 17:38:44,275 INFO L280 TraceCheckUtils]: 20: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,275 INFO L280 TraceCheckUtils]: 21: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,275 INFO L280 TraceCheckUtils]: 22: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,276 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #152#return; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,277 INFO L263 TraceCheckUtils]: 24: Hoare triple {11755#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {11751#true} is VALID [2020-07-08 17:38:44,277 INFO L280 TraceCheckUtils]: 25: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,277 INFO L280 TraceCheckUtils]: 26: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,277 INFO L280 TraceCheckUtils]: 27: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,278 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {11751#true} {11755#(<= 0 main_~t~0)} #154#return; {11755#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:44,279 INFO L280 TraceCheckUtils]: 29: Hoare triple {11755#(<= 0 main_~t~0)} #t~post3 := ~t~0; {11764#(<= 0 |main_#t~post3|)} is VALID [2020-07-08 17:38:44,280 INFO L280 TraceCheckUtils]: 30: Hoare triple {11764#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,281 INFO L280 TraceCheckUtils]: 31: Hoare triple {11765#(<= 1 main_~t~0)} havoc #t~post3; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,281 INFO L280 TraceCheckUtils]: 32: Hoare triple {11765#(<= 1 main_~t~0)} assume !false; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,282 INFO L280 TraceCheckUtils]: 33: Hoare triple {11765#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,282 INFO L280 TraceCheckUtils]: 34: Hoare triple {11765#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,283 INFO L280 TraceCheckUtils]: 35: Hoare triple {11765#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,284 INFO L280 TraceCheckUtils]: 36: Hoare triple {11765#(<= 1 main_~t~0)} havoc #t~nondet2; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,284 INFO L263 TraceCheckUtils]: 37: Hoare triple {11765#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11751#true} is VALID [2020-07-08 17:38:44,284 INFO L280 TraceCheckUtils]: 38: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,284 INFO L280 TraceCheckUtils]: 39: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,284 INFO L280 TraceCheckUtils]: 40: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,285 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #156#return; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,286 INFO L263 TraceCheckUtils]: 42: Hoare triple {11765#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {11751#true} is VALID [2020-07-08 17:38:44,286 INFO L280 TraceCheckUtils]: 43: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,286 INFO L280 TraceCheckUtils]: 44: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,286 INFO L280 TraceCheckUtils]: 45: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,287 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {11751#true} {11765#(<= 1 main_~t~0)} #158#return; {11765#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:44,288 INFO L280 TraceCheckUtils]: 47: Hoare triple {11765#(<= 1 main_~t~0)} #t~post4 := ~t~0; {11774#(<= 1 |main_#t~post4|)} is VALID [2020-07-08 17:38:44,289 INFO L280 TraceCheckUtils]: 48: Hoare triple {11774#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,289 INFO L280 TraceCheckUtils]: 49: Hoare triple {11775#(<= 2 main_~t~0)} havoc #t~post4; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,290 INFO L280 TraceCheckUtils]: 50: Hoare triple {11775#(<= 2 main_~t~0)} assume !false; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,290 INFO L280 TraceCheckUtils]: 51: Hoare triple {11775#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,291 INFO L280 TraceCheckUtils]: 52: Hoare triple {11775#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,292 INFO L280 TraceCheckUtils]: 53: Hoare triple {11775#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,293 INFO L280 TraceCheckUtils]: 54: Hoare triple {11775#(<= 2 main_~t~0)} havoc #t~nondet5; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,294 INFO L280 TraceCheckUtils]: 55: Hoare triple {11775#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,294 INFO L280 TraceCheckUtils]: 56: Hoare triple {11775#(<= 2 main_~t~0)} assume 0 != #t~nondet6; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,295 INFO L280 TraceCheckUtils]: 57: Hoare triple {11775#(<= 2 main_~t~0)} havoc #t~nondet6; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,295 INFO L263 TraceCheckUtils]: 58: Hoare triple {11775#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11751#true} is VALID [2020-07-08 17:38:44,295 INFO L280 TraceCheckUtils]: 59: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,296 INFO L280 TraceCheckUtils]: 60: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,296 INFO L280 TraceCheckUtils]: 61: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,297 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #164#return; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,297 INFO L263 TraceCheckUtils]: 63: Hoare triple {11775#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {11751#true} is VALID [2020-07-08 17:38:44,297 INFO L280 TraceCheckUtils]: 64: Hoare triple {11751#true} ~cond := #in~cond; {11751#true} is VALID [2020-07-08 17:38:44,297 INFO L280 TraceCheckUtils]: 65: Hoare triple {11751#true} assume !(0 == ~cond); {11751#true} is VALID [2020-07-08 17:38:44,298 INFO L280 TraceCheckUtils]: 66: Hoare triple {11751#true} assume true; {11751#true} is VALID [2020-07-08 17:38:44,299 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {11751#true} {11775#(<= 2 main_~t~0)} #166#return; {11775#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:44,300 INFO L280 TraceCheckUtils]: 68: Hoare triple {11775#(<= 2 main_~t~0)} #t~post7 := ~t~0; {11784#(<= 2 |main_#t~post7|)} is VALID [2020-07-08 17:38:44,301 INFO L280 TraceCheckUtils]: 69: Hoare triple {11784#(<= 2 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {11785#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:44,302 INFO L280 TraceCheckUtils]: 70: Hoare triple {11785#(<= 3 main_~t~0)} havoc #t~post7; {11785#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:44,302 INFO L280 TraceCheckUtils]: 71: Hoare triple {11785#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {11785#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:44,304 INFO L263 TraceCheckUtils]: 72: Hoare triple {11785#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {11786#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:44,305 INFO L280 TraceCheckUtils]: 73: Hoare triple {11786#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {11787#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:44,305 INFO L280 TraceCheckUtils]: 74: Hoare triple {11787#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {11752#false} is VALID [2020-07-08 17:38:44,306 INFO L280 TraceCheckUtils]: 75: Hoare triple {11752#false} assume !false; {11752#false} is VALID [2020-07-08 17:38:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:44,311 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:44,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105115473] [2020-07-08 17:38:44,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:44,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 17:38:44,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571959706] [2020-07-08 17:38:44,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2020-07-08 17:38:44,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:44,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 17:38:44,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:44,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 17:38:44,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:44,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 17:38:44,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-08 17:38:44,384 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand 11 states. [2020-07-08 17:38:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:46,072 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2020-07-08 17:38:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 17:38:46,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2020-07-08 17:38:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:38:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2020-07-08 17:38:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:38:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2020-07-08 17:38:46,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 135 transitions. [2020-07-08 17:38:46,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:46,247 INFO L225 Difference]: With dead ends: 202 [2020-07-08 17:38:46,247 INFO L226 Difference]: Without dead ends: 200 [2020-07-08 17:38:46,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-08 17:38:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-07-08 17:38:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2020-07-08 17:38:46,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:46,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 193 states. [2020-07-08 17:38:46,580 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 193 states. [2020-07-08 17:38:46,581 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 193 states. [2020-07-08 17:38:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:46,587 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2020-07-08 17:38:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2020-07-08 17:38:46,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:46,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:46,588 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 200 states. [2020-07-08 17:38:46,588 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 200 states. [2020-07-08 17:38:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:46,594 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2020-07-08 17:38:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2020-07-08 17:38:46,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:46,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:46,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:46,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-07-08 17:38:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2020-07-08 17:38:46,608 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 76 [2020-07-08 17:38:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:46,608 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2020-07-08 17:38:46,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 17:38:46,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 193 states and 218 transitions. [2020-07-08 17:38:46,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2020-07-08 17:38:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-08 17:38:46,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:46,935 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 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, 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] [2020-07-08 17:38:46,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-08 17:38:46,938 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:46,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1147260786, now seen corresponding path program 1 times [2020-07-08 17:38:46,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:46,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482965947] [2020-07-08 17:38:46,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:47,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,126 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12994#true} {12994#true} #144#return; {12994#true} is VALID [2020-07-08 17:38:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:47,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,134 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #156#return; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:47,142 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,143 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #158#return; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:47,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,150 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #172#return; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:47,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,157 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #174#return; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:47,167 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,168 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,168 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,169 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #164#return; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:47,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,178 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #166#return; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {12994#true} call ULTIMATE.init(); {12994#true} is VALID [2020-07-08 17:38:47,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,179 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12994#true} {12994#true} #144#return; {12994#true} is VALID [2020-07-08 17:38:47,179 INFO L263 TraceCheckUtils]: 3: Hoare triple {12994#true} call #t~ret10 := main(); {12994#true} is VALID [2020-07-08 17:38:47,179 INFO L280 TraceCheckUtils]: 4: Hoare triple {12994#true} havoc ~tagbuf_len~0; {12994#true} is VALID [2020-07-08 17:38:47,180 INFO L280 TraceCheckUtils]: 5: Hoare triple {12994#true} havoc ~t~0; {12994#true} is VALID [2020-07-08 17:38:47,180 INFO L280 TraceCheckUtils]: 6: Hoare triple {12994#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12994#true} is VALID [2020-07-08 17:38:47,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {12994#true} ~tagbuf_len~0 := #t~nondet0; {12994#true} is VALID [2020-07-08 17:38:47,181 INFO L280 TraceCheckUtils]: 8: Hoare triple {12994#true} havoc #t~nondet0; {12994#true} is VALID [2020-07-08 17:38:47,181 INFO L280 TraceCheckUtils]: 9: Hoare triple {12994#true} assume ~tagbuf_len~0 >= 1; {12994#true} is VALID [2020-07-08 17:38:47,182 INFO L280 TraceCheckUtils]: 10: Hoare triple {12994#true} ~t~0 := 0; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,183 INFO L280 TraceCheckUtils]: 11: Hoare triple {12998#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,184 INFO L280 TraceCheckUtils]: 12: Hoare triple {12998#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,185 INFO L280 TraceCheckUtils]: 13: Hoare triple {12998#(<= 0 main_~t~0)} havoc #t~pre1; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,186 INFO L280 TraceCheckUtils]: 14: Hoare triple {12998#(<= 0 main_~t~0)} assume !false; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {12998#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,187 INFO L280 TraceCheckUtils]: 16: Hoare triple {12998#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,188 INFO L280 TraceCheckUtils]: 17: Hoare triple {12998#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,189 INFO L280 TraceCheckUtils]: 18: Hoare triple {12998#(<= 0 main_~t~0)} havoc #t~nondet2; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,190 INFO L263 TraceCheckUtils]: 19: Hoare triple {12998#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {12994#true} is VALID [2020-07-08 17:38:47,190 INFO L280 TraceCheckUtils]: 20: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,190 INFO L280 TraceCheckUtils]: 21: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,192 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #156#return; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,192 INFO L263 TraceCheckUtils]: 24: Hoare triple {12998#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {12994#true} is VALID [2020-07-08 17:38:47,193 INFO L280 TraceCheckUtils]: 25: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,193 INFO L280 TraceCheckUtils]: 26: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,193 INFO L280 TraceCheckUtils]: 27: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,194 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {12994#true} {12998#(<= 0 main_~t~0)} #158#return; {12998#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:47,195 INFO L280 TraceCheckUtils]: 29: Hoare triple {12998#(<= 0 main_~t~0)} #t~post4 := ~t~0; {13007#(<= 0 |main_#t~post4|)} is VALID [2020-07-08 17:38:47,196 INFO L280 TraceCheckUtils]: 30: Hoare triple {13007#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,196 INFO L280 TraceCheckUtils]: 31: Hoare triple {13008#(<= 1 main_~t~0)} havoc #t~post4; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,197 INFO L280 TraceCheckUtils]: 32: Hoare triple {13008#(<= 1 main_~t~0)} assume !false; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,198 INFO L280 TraceCheckUtils]: 33: Hoare triple {13008#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,199 INFO L280 TraceCheckUtils]: 34: Hoare triple {13008#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,200 INFO L280 TraceCheckUtils]: 35: Hoare triple {13008#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,201 INFO L280 TraceCheckUtils]: 36: Hoare triple {13008#(<= 1 main_~t~0)} havoc #t~nondet5; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,202 INFO L280 TraceCheckUtils]: 37: Hoare triple {13008#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,203 INFO L280 TraceCheckUtils]: 38: Hoare triple {13008#(<= 1 main_~t~0)} assume !(0 != #t~nondet6); {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,204 INFO L280 TraceCheckUtils]: 39: Hoare triple {13008#(<= 1 main_~t~0)} havoc #t~nondet6; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,205 INFO L263 TraceCheckUtils]: 40: Hoare triple {13008#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {12994#true} is VALID [2020-07-08 17:38:47,205 INFO L280 TraceCheckUtils]: 41: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,205 INFO L280 TraceCheckUtils]: 42: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,206 INFO L280 TraceCheckUtils]: 43: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,207 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #172#return; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,207 INFO L263 TraceCheckUtils]: 45: Hoare triple {13008#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {12994#true} is VALID [2020-07-08 17:38:47,207 INFO L280 TraceCheckUtils]: 46: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,208 INFO L280 TraceCheckUtils]: 47: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,208 INFO L280 TraceCheckUtils]: 48: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,209 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {12994#true} {13008#(<= 1 main_~t~0)} #174#return; {13008#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:47,210 INFO L280 TraceCheckUtils]: 50: Hoare triple {13008#(<= 1 main_~t~0)} #t~post9 := ~t~0; {13017#(<= 1 |main_#t~post9|)} is VALID [2020-07-08 17:38:47,212 INFO L280 TraceCheckUtils]: 51: Hoare triple {13017#(<= 1 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,213 INFO L280 TraceCheckUtils]: 52: Hoare triple {13018#(<= 2 main_~t~0)} havoc #t~post9; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,214 INFO L280 TraceCheckUtils]: 53: Hoare triple {13018#(<= 2 main_~t~0)} assume !false; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,215 INFO L280 TraceCheckUtils]: 54: Hoare triple {13018#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,216 INFO L280 TraceCheckUtils]: 55: Hoare triple {13018#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,217 INFO L280 TraceCheckUtils]: 56: Hoare triple {13018#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,217 INFO L280 TraceCheckUtils]: 57: Hoare triple {13018#(<= 2 main_~t~0)} havoc #t~nondet5; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,218 INFO L280 TraceCheckUtils]: 58: Hoare triple {13018#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,219 INFO L280 TraceCheckUtils]: 59: Hoare triple {13018#(<= 2 main_~t~0)} assume 0 != #t~nondet6; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,220 INFO L280 TraceCheckUtils]: 60: Hoare triple {13018#(<= 2 main_~t~0)} havoc #t~nondet6; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,221 INFO L263 TraceCheckUtils]: 61: Hoare triple {13018#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {12994#true} is VALID [2020-07-08 17:38:47,221 INFO L280 TraceCheckUtils]: 62: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,222 INFO L280 TraceCheckUtils]: 63: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,222 INFO L280 TraceCheckUtils]: 64: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,223 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #164#return; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,224 INFO L263 TraceCheckUtils]: 66: Hoare triple {13018#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {12994#true} is VALID [2020-07-08 17:38:47,224 INFO L280 TraceCheckUtils]: 67: Hoare triple {12994#true} ~cond := #in~cond; {12994#true} is VALID [2020-07-08 17:38:47,224 INFO L280 TraceCheckUtils]: 68: Hoare triple {12994#true} assume !(0 == ~cond); {12994#true} is VALID [2020-07-08 17:38:47,224 INFO L280 TraceCheckUtils]: 69: Hoare triple {12994#true} assume true; {12994#true} is VALID [2020-07-08 17:38:47,225 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {12994#true} {13018#(<= 2 main_~t~0)} #166#return; {13018#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:47,226 INFO L280 TraceCheckUtils]: 71: Hoare triple {13018#(<= 2 main_~t~0)} #t~post7 := ~t~0; {13027#(<= 2 |main_#t~post7|)} is VALID [2020-07-08 17:38:47,228 INFO L280 TraceCheckUtils]: 72: Hoare triple {13027#(<= 2 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {13028#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:47,229 INFO L280 TraceCheckUtils]: 73: Hoare triple {13028#(<= 3 main_~t~0)} havoc #t~post7; {13028#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:47,230 INFO L280 TraceCheckUtils]: 74: Hoare triple {13028#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {13028#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:47,231 INFO L263 TraceCheckUtils]: 75: Hoare triple {13028#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {13029#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:47,232 INFO L280 TraceCheckUtils]: 76: Hoare triple {13029#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {13030#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:47,233 INFO L280 TraceCheckUtils]: 77: Hoare triple {13030#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {12995#false} is VALID [2020-07-08 17:38:47,233 INFO L280 TraceCheckUtils]: 78: Hoare triple {12995#false} assume !false; {12995#false} is VALID [2020-07-08 17:38:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:47,240 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:47,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482965947] [2020-07-08 17:38:47,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:47,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 17:38:47,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576992326] [2020-07-08 17:38:47,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-07-08 17:38:47,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:47,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 17:38:47,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:47,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 17:38:47,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:47,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 17:38:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-08 17:38:47,345 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand 11 states. [2020-07-08 17:38:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:49,037 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2020-07-08 17:38:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 17:38:49,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-07-08 17:38:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:38:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2020-07-08 17:38:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:38:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2020-07-08 17:38:49,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 168 transitions. [2020-07-08 17:38:49,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:49,274 INFO L225 Difference]: With dead ends: 234 [2020-07-08 17:38:49,274 INFO L226 Difference]: Without dead ends: 232 [2020-07-08 17:38:49,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-07-08 17:38:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-07-08 17:38:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2020-07-08 17:38:49,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:49,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand 223 states. [2020-07-08 17:38:49,674 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 223 states. [2020-07-08 17:38:49,674 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 223 states. [2020-07-08 17:38:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:49,687 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions. [2020-07-08 17:38:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions. [2020-07-08 17:38:49,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:49,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:49,689 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 232 states. [2020-07-08 17:38:49,689 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 232 states. [2020-07-08 17:38:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:49,707 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions. [2020-07-08 17:38:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions. [2020-07-08 17:38:49,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:49,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:49,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:49,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-07-08 17:38:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2020-07-08 17:38:49,719 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 79 [2020-07-08 17:38:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:49,720 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2020-07-08 17:38:49,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 17:38:49,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 255 transitions. [2020-07-08 17:38:50,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2020-07-08 17:38:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-08 17:38:50,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:50,090 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 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, 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] [2020-07-08 17:38:50,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-08 17:38:50,091 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash 341113206, now seen corresponding path program 2 times [2020-07-08 17:38:50,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:50,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1230200705] [2020-07-08 17:38:50,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:50,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,246 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14427#true} {14427#true} #144#return; {14427#true} is VALID [2020-07-08 17:38:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:50,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,252 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #156#return; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:50,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,258 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,260 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #158#return; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:50,268 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,269 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,269 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,271 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #164#return; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:50,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,276 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,278 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #166#return; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:50,282 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,284 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #172#return; {14451#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:50,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,289 INFO L280 TraceCheckUtils]: 2: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,289 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #174#return; {14451#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:50,290 INFO L263 TraceCheckUtils]: 0: Hoare triple {14427#true} call ULTIMATE.init(); {14427#true} is VALID [2020-07-08 17:38:50,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,290 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14427#true} {14427#true} #144#return; {14427#true} is VALID [2020-07-08 17:38:50,290 INFO L263 TraceCheckUtils]: 3: Hoare triple {14427#true} call #t~ret10 := main(); {14427#true} is VALID [2020-07-08 17:38:50,291 INFO L280 TraceCheckUtils]: 4: Hoare triple {14427#true} havoc ~tagbuf_len~0; {14427#true} is VALID [2020-07-08 17:38:50,291 INFO L280 TraceCheckUtils]: 5: Hoare triple {14427#true} havoc ~t~0; {14427#true} is VALID [2020-07-08 17:38:50,291 INFO L280 TraceCheckUtils]: 6: Hoare triple {14427#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14427#true} is VALID [2020-07-08 17:38:50,291 INFO L280 TraceCheckUtils]: 7: Hoare triple {14427#true} ~tagbuf_len~0 := #t~nondet0; {14427#true} is VALID [2020-07-08 17:38:50,291 INFO L280 TraceCheckUtils]: 8: Hoare triple {14427#true} havoc #t~nondet0; {14427#true} is VALID [2020-07-08 17:38:50,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {14427#true} assume ~tagbuf_len~0 >= 1; {14427#true} is VALID [2020-07-08 17:38:50,292 INFO L280 TraceCheckUtils]: 10: Hoare triple {14427#true} ~t~0 := 0; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,293 INFO L280 TraceCheckUtils]: 11: Hoare triple {14431#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,293 INFO L280 TraceCheckUtils]: 12: Hoare triple {14431#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,294 INFO L280 TraceCheckUtils]: 13: Hoare triple {14431#(<= 0 main_~t~0)} havoc #t~pre1; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,294 INFO L280 TraceCheckUtils]: 14: Hoare triple {14431#(<= 0 main_~t~0)} assume !false; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,295 INFO L280 TraceCheckUtils]: 15: Hoare triple {14431#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,296 INFO L280 TraceCheckUtils]: 16: Hoare triple {14431#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,296 INFO L280 TraceCheckUtils]: 17: Hoare triple {14431#(<= 0 main_~t~0)} assume 0 != #t~nondet2; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,297 INFO L280 TraceCheckUtils]: 18: Hoare triple {14431#(<= 0 main_~t~0)} havoc #t~nondet2; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,297 INFO L263 TraceCheckUtils]: 19: Hoare triple {14431#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14427#true} is VALID [2020-07-08 17:38:50,297 INFO L280 TraceCheckUtils]: 20: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,297 INFO L280 TraceCheckUtils]: 21: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,297 INFO L280 TraceCheckUtils]: 22: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,298 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #156#return; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,298 INFO L263 TraceCheckUtils]: 24: Hoare triple {14431#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {14427#true} is VALID [2020-07-08 17:38:50,299 INFO L280 TraceCheckUtils]: 25: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,299 INFO L280 TraceCheckUtils]: 26: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,299 INFO L280 TraceCheckUtils]: 27: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,300 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {14427#true} {14431#(<= 0 main_~t~0)} #158#return; {14431#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:50,300 INFO L280 TraceCheckUtils]: 29: Hoare triple {14431#(<= 0 main_~t~0)} #t~post4 := ~t~0; {14440#(<= 0 |main_#t~post4|)} is VALID [2020-07-08 17:38:50,301 INFO L280 TraceCheckUtils]: 30: Hoare triple {14440#(<= 0 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,302 INFO L280 TraceCheckUtils]: 31: Hoare triple {14441#(<= 1 main_~t~0)} havoc #t~post4; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,303 INFO L280 TraceCheckUtils]: 32: Hoare triple {14441#(<= 1 main_~t~0)} assume !false; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,304 INFO L280 TraceCheckUtils]: 33: Hoare triple {14441#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,305 INFO L280 TraceCheckUtils]: 34: Hoare triple {14441#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,305 INFO L280 TraceCheckUtils]: 35: Hoare triple {14441#(<= 1 main_~t~0)} assume 0 != #t~nondet5; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,306 INFO L280 TraceCheckUtils]: 36: Hoare triple {14441#(<= 1 main_~t~0)} havoc #t~nondet5; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,306 INFO L280 TraceCheckUtils]: 37: Hoare triple {14441#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,307 INFO L280 TraceCheckUtils]: 38: Hoare triple {14441#(<= 1 main_~t~0)} assume 0 != #t~nondet6; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,307 INFO L280 TraceCheckUtils]: 39: Hoare triple {14441#(<= 1 main_~t~0)} havoc #t~nondet6; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,308 INFO L263 TraceCheckUtils]: 40: Hoare triple {14441#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14427#true} is VALID [2020-07-08 17:38:50,308 INFO L280 TraceCheckUtils]: 41: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,308 INFO L280 TraceCheckUtils]: 42: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,308 INFO L280 TraceCheckUtils]: 43: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,309 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #164#return; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,309 INFO L263 TraceCheckUtils]: 45: Hoare triple {14441#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {14427#true} is VALID [2020-07-08 17:38:50,309 INFO L280 TraceCheckUtils]: 46: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,309 INFO L280 TraceCheckUtils]: 47: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,310 INFO L280 TraceCheckUtils]: 48: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,310 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {14427#true} {14441#(<= 1 main_~t~0)} #166#return; {14441#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:50,311 INFO L280 TraceCheckUtils]: 50: Hoare triple {14441#(<= 1 main_~t~0)} #t~post7 := ~t~0; {14450#(<= 1 |main_#t~post7|)} is VALID [2020-07-08 17:38:50,312 INFO L280 TraceCheckUtils]: 51: Hoare triple {14450#(<= 1 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {14451#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:50,312 INFO L280 TraceCheckUtils]: 52: Hoare triple {14451#(<= 2 main_~t~0)} havoc #t~post7; {14451#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:50,313 INFO L280 TraceCheckUtils]: 53: Hoare triple {14451#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14451#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:50,313 INFO L263 TraceCheckUtils]: 54: Hoare triple {14451#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14427#true} is VALID [2020-07-08 17:38:50,313 INFO L280 TraceCheckUtils]: 55: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,313 INFO L280 TraceCheckUtils]: 56: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,314 INFO L280 TraceCheckUtils]: 57: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,314 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #172#return; {14451#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:50,314 INFO L263 TraceCheckUtils]: 59: Hoare triple {14451#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {14427#true} is VALID [2020-07-08 17:38:50,315 INFO L280 TraceCheckUtils]: 60: Hoare triple {14427#true} ~cond := #in~cond; {14427#true} is VALID [2020-07-08 17:38:50,315 INFO L280 TraceCheckUtils]: 61: Hoare triple {14427#true} assume !(0 == ~cond); {14427#true} is VALID [2020-07-08 17:38:50,315 INFO L280 TraceCheckUtils]: 62: Hoare triple {14427#true} assume true; {14427#true} is VALID [2020-07-08 17:38:50,316 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {14427#true} {14451#(<= 2 main_~t~0)} #174#return; {14451#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:50,316 INFO L280 TraceCheckUtils]: 64: Hoare triple {14451#(<= 2 main_~t~0)} #t~post9 := ~t~0; {14460#(<= 2 |main_#t~post9|)} is VALID [2020-07-08 17:38:50,317 INFO L280 TraceCheckUtils]: 65: Hoare triple {14460#(<= 2 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,318 INFO L280 TraceCheckUtils]: 66: Hoare triple {14461#(<= 3 main_~t~0)} havoc #t~post9; {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,318 INFO L280 TraceCheckUtils]: 67: Hoare triple {14461#(<= 3 main_~t~0)} assume !false; {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,319 INFO L280 TraceCheckUtils]: 68: Hoare triple {14461#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,319 INFO L280 TraceCheckUtils]: 69: Hoare triple {14461#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,320 INFO L280 TraceCheckUtils]: 70: Hoare triple {14461#(<= 3 main_~t~0)} assume 0 != #t~nondet5; {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,320 INFO L280 TraceCheckUtils]: 71: Hoare triple {14461#(<= 3 main_~t~0)} havoc #t~nondet5; {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,321 INFO L280 TraceCheckUtils]: 72: Hoare triple {14461#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,321 INFO L280 TraceCheckUtils]: 73: Hoare triple {14461#(<= 3 main_~t~0)} assume !(0 != #t~nondet6); {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,322 INFO L280 TraceCheckUtils]: 74: Hoare triple {14461#(<= 3 main_~t~0)} havoc #t~nondet6; {14461#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:50,323 INFO L263 TraceCheckUtils]: 75: Hoare triple {14461#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {14462#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:50,324 INFO L280 TraceCheckUtils]: 76: Hoare triple {14462#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {14463#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:50,324 INFO L280 TraceCheckUtils]: 77: Hoare triple {14463#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {14428#false} is VALID [2020-07-08 17:38:50,325 INFO L280 TraceCheckUtils]: 78: Hoare triple {14428#false} assume !false; {14428#false} is VALID [2020-07-08 17:38:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:50,331 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:50,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1230200705] [2020-07-08 17:38:50,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:50,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 17:38:50,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331401758] [2020-07-08 17:38:50,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-07-08 17:38:50,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:50,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 17:38:50,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:50,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 17:38:50,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:50,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 17:38:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-08 17:38:50,415 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 11 states. [2020-07-08 17:38:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:52,336 INFO L93 Difference]: Finished difference Result 264 states and 305 transitions. [2020-07-08 17:38:52,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 17:38:52,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-07-08 17:38:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:38:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2020-07-08 17:38:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:38:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 168 transitions. [2020-07-08 17:38:52,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 168 transitions. [2020-07-08 17:38:52,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:52,561 INFO L225 Difference]: With dead ends: 264 [2020-07-08 17:38:52,562 INFO L226 Difference]: Without dead ends: 262 [2020-07-08 17:38:52,563 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-07-08 17:38:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-07-08 17:38:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 223. [2020-07-08 17:38:52,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:52,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 223 states. [2020-07-08 17:38:52,936 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 223 states. [2020-07-08 17:38:52,936 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 223 states. [2020-07-08 17:38:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:52,947 INFO L93 Difference]: Finished difference Result 262 states and 303 transitions. [2020-07-08 17:38:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions. [2020-07-08 17:38:52,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:52,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:52,949 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 262 states. [2020-07-08 17:38:52,949 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 262 states. [2020-07-08 17:38:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:52,961 INFO L93 Difference]: Finished difference Result 262 states and 303 transitions. [2020-07-08 17:38:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions. [2020-07-08 17:38:52,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:52,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:52,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:52,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-07-08 17:38:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2020-07-08 17:38:52,973 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 79 [2020-07-08 17:38:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:52,973 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2020-07-08 17:38:52,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 17:38:52,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 223 states and 255 transitions. [2020-07-08 17:38:53,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2020-07-08 17:38:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-08 17:38:53,370 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:53,370 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 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, 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, 1, 1] [2020-07-08 17:38:53,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-08 17:38:53,370 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:53,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1759613834, now seen corresponding path program 1 times [2020-07-08 17:38:53,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:53,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [558505735] [2020-07-08 17:38:53,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:53,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,604 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15980#true} {15980#true} #144#return; {15980#true} is VALID [2020-07-08 17:38:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:53,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,612 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:53,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,619 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:53,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,624 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:53,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,630 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,630 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:53,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,639 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:53,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,649 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:53,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,653 INFO L280 TraceCheckUtils]: 2: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,654 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {15980#true} {15986#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,654 INFO L263 TraceCheckUtils]: 0: Hoare triple {15980#true} call ULTIMATE.init(); {15980#true} is VALID [2020-07-08 17:38:53,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,655 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15980#true} {15980#true} #144#return; {15980#true} is VALID [2020-07-08 17:38:53,655 INFO L263 TraceCheckUtils]: 3: Hoare triple {15980#true} call #t~ret10 := main(); {15980#true} is VALID [2020-07-08 17:38:53,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {15980#true} havoc ~tagbuf_len~0; {15980#true} is VALID [2020-07-08 17:38:53,655 INFO L280 TraceCheckUtils]: 5: Hoare triple {15980#true} havoc ~t~0; {15980#true} is VALID [2020-07-08 17:38:53,655 INFO L280 TraceCheckUtils]: 6: Hoare triple {15980#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {15980#true} is VALID [2020-07-08 17:38:53,655 INFO L280 TraceCheckUtils]: 7: Hoare triple {15980#true} ~tagbuf_len~0 := #t~nondet0; {15980#true} is VALID [2020-07-08 17:38:53,655 INFO L280 TraceCheckUtils]: 8: Hoare triple {15980#true} havoc #t~nondet0; {15980#true} is VALID [2020-07-08 17:38:53,656 INFO L280 TraceCheckUtils]: 9: Hoare triple {15980#true} assume ~tagbuf_len~0 >= 1; {15984#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,656 INFO L280 TraceCheckUtils]: 10: Hoare triple {15984#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,657 INFO L280 TraceCheckUtils]: 11: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,657 INFO L280 TraceCheckUtils]: 12: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,658 INFO L280 TraceCheckUtils]: 13: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,658 INFO L280 TraceCheckUtils]: 14: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,659 INFO L280 TraceCheckUtils]: 15: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,660 INFO L280 TraceCheckUtils]: 16: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,660 INFO L280 TraceCheckUtils]: 17: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,661 INFO L280 TraceCheckUtils]: 18: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,661 INFO L263 TraceCheckUtils]: 19: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID [2020-07-08 17:38:53,661 INFO L280 TraceCheckUtils]: 20: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,661 INFO L280 TraceCheckUtils]: 21: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,661 INFO L280 TraceCheckUtils]: 22: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,662 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,662 INFO L263 TraceCheckUtils]: 24: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {15980#true} is VALID [2020-07-08 17:38:53,662 INFO L280 TraceCheckUtils]: 25: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,662 INFO L280 TraceCheckUtils]: 26: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,662 INFO L280 TraceCheckUtils]: 27: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,669 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,670 INFO L280 TraceCheckUtils]: 29: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {15995#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,672 INFO L280 TraceCheckUtils]: 30: Hoare triple {15995#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,672 INFO L280 TraceCheckUtils]: 31: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,673 INFO L280 TraceCheckUtils]: 32: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,674 INFO L280 TraceCheckUtils]: 33: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,674 INFO L280 TraceCheckUtils]: 34: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,675 INFO L280 TraceCheckUtils]: 35: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,675 INFO L280 TraceCheckUtils]: 36: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,676 INFO L263 TraceCheckUtils]: 37: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID [2020-07-08 17:38:53,676 INFO L280 TraceCheckUtils]: 38: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,676 INFO L280 TraceCheckUtils]: 39: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,676 INFO L280 TraceCheckUtils]: 40: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,677 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,677 INFO L263 TraceCheckUtils]: 42: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {15980#true} is VALID [2020-07-08 17:38:53,678 INFO L280 TraceCheckUtils]: 43: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,678 INFO L280 TraceCheckUtils]: 44: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,678 INFO L280 TraceCheckUtils]: 45: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,679 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,680 INFO L280 TraceCheckUtils]: 47: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {16004#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,681 INFO L280 TraceCheckUtils]: 48: Hoare triple {16004#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,682 INFO L280 TraceCheckUtils]: 49: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,683 INFO L280 TraceCheckUtils]: 50: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,684 INFO L280 TraceCheckUtils]: 51: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,689 INFO L280 TraceCheckUtils]: 52: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,690 INFO L280 TraceCheckUtils]: 53: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,691 INFO L280 TraceCheckUtils]: 54: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,692 INFO L280 TraceCheckUtils]: 55: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,693 INFO L280 TraceCheckUtils]: 56: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,693 INFO L280 TraceCheckUtils]: 57: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,693 INFO L263 TraceCheckUtils]: 58: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID [2020-07-08 17:38:53,694 INFO L280 TraceCheckUtils]: 59: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,694 INFO L280 TraceCheckUtils]: 60: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,694 INFO L280 TraceCheckUtils]: 61: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,695 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,695 INFO L263 TraceCheckUtils]: 63: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {15980#true} is VALID [2020-07-08 17:38:53,695 INFO L280 TraceCheckUtils]: 64: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,695 INFO L280 TraceCheckUtils]: 65: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,695 INFO L280 TraceCheckUtils]: 66: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,696 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {15980#true} {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,697 INFO L280 TraceCheckUtils]: 68: Hoare triple {15985#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {16013#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,698 INFO L280 TraceCheckUtils]: 69: Hoare triple {16013#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,699 INFO L280 TraceCheckUtils]: 70: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,700 INFO L280 TraceCheckUtils]: 71: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,700 INFO L263 TraceCheckUtils]: 72: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {15980#true} is VALID [2020-07-08 17:38:53,700 INFO L280 TraceCheckUtils]: 73: Hoare triple {15980#true} ~cond := #in~cond; {15980#true} is VALID [2020-07-08 17:38:53,700 INFO L280 TraceCheckUtils]: 74: Hoare triple {15980#true} assume !(0 == ~cond); {15980#true} is VALID [2020-07-08 17:38:53,701 INFO L280 TraceCheckUtils]: 75: Hoare triple {15980#true} assume true; {15980#true} is VALID [2020-07-08 17:38:53,701 INFO L275 TraceCheckUtils]: 76: Hoare quadruple {15980#true} {15986#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {15986#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:38:53,703 INFO L263 TraceCheckUtils]: 77: Hoare triple {15986#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {16018#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:53,703 INFO L280 TraceCheckUtils]: 78: Hoare triple {16018#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {16019#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:53,704 INFO L280 TraceCheckUtils]: 79: Hoare triple {16019#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {15981#false} is VALID [2020-07-08 17:38:53,704 INFO L280 TraceCheckUtils]: 80: Hoare triple {15981#false} assume !false; {15981#false} is VALID [2020-07-08 17:38:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:53,710 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:53,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [558505735] [2020-07-08 17:38:53,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:53,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 17:38:53,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719122579] [2020-07-08 17:38:53,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2020-07-08 17:38:53,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:53,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 17:38:53,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:53,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 17:38:53,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:53,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 17:38:53,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:38:53,789 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 10 states. [2020-07-08 17:38:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:55,421 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions. [2020-07-08 17:38:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 17:38:55,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2020-07-08 17:38:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:38:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2020-07-08 17:38:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:38:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2020-07-08 17:38:55,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 109 transitions. [2020-07-08 17:38:55,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:55,596 INFO L225 Difference]: With dead ends: 236 [2020-07-08 17:38:55,596 INFO L226 Difference]: Without dead ends: 234 [2020-07-08 17:38:55,597 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-07-08 17:38:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-07-08 17:38:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2020-07-08 17:38:56,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:56,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 228 states. [2020-07-08 17:38:56,134 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 228 states. [2020-07-08 17:38:56,134 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 228 states. [2020-07-08 17:38:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:56,144 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions. [2020-07-08 17:38:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 266 transitions. [2020-07-08 17:38:56,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:56,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:56,147 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 234 states. [2020-07-08 17:38:56,147 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 234 states. [2020-07-08 17:38:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:56,158 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions. [2020-07-08 17:38:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 266 transitions. [2020-07-08 17:38:56,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:56,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:56,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:56,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-07-08 17:38:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 260 transitions. [2020-07-08 17:38:56,170 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 260 transitions. Word has length 81 [2020-07-08 17:38:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:56,171 INFO L479 AbstractCegarLoop]: Abstraction has 228 states and 260 transitions. [2020-07-08 17:38:56,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 17:38:56,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 228 states and 260 transitions. [2020-07-08 17:38:56,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 260 transitions. [2020-07-08 17:38:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-08 17:38:56,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:56,690 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:56,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-08 17:38:56,690 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash -343631243, now seen corresponding path program 1 times [2020-07-08 17:38:56,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:56,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [921237813] [2020-07-08 17:38:56,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:56,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,847 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17434#true} {17434#true} #144#return; {17434#true} is VALID [2020-07-08 17:38:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:56,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,854 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #152#return; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:56,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,861 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #154#return; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:56,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,866 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,868 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #156#return; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:56,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,873 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,874 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #158#return; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:56,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,879 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #172#return; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:38:56,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,884 INFO L280 TraceCheckUtils]: 2: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,885 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #174#return; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,886 INFO L263 TraceCheckUtils]: 0: Hoare triple {17434#true} call ULTIMATE.init(); {17434#true} is VALID [2020-07-08 17:38:56,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,886 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17434#true} {17434#true} #144#return; {17434#true} is VALID [2020-07-08 17:38:56,886 INFO L263 TraceCheckUtils]: 3: Hoare triple {17434#true} call #t~ret10 := main(); {17434#true} is VALID [2020-07-08 17:38:56,886 INFO L280 TraceCheckUtils]: 4: Hoare triple {17434#true} havoc ~tagbuf_len~0; {17434#true} is VALID [2020-07-08 17:38:56,887 INFO L280 TraceCheckUtils]: 5: Hoare triple {17434#true} havoc ~t~0; {17434#true} is VALID [2020-07-08 17:38:56,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {17434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {17434#true} is VALID [2020-07-08 17:38:56,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {17434#true} ~tagbuf_len~0 := #t~nondet0; {17434#true} is VALID [2020-07-08 17:38:56,887 INFO L280 TraceCheckUtils]: 8: Hoare triple {17434#true} havoc #t~nondet0; {17434#true} is VALID [2020-07-08 17:38:56,887 INFO L280 TraceCheckUtils]: 9: Hoare triple {17434#true} assume ~tagbuf_len~0 >= 1; {17434#true} is VALID [2020-07-08 17:38:56,888 INFO L280 TraceCheckUtils]: 10: Hoare triple {17434#true} ~t~0 := 0; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,888 INFO L280 TraceCheckUtils]: 11: Hoare triple {17438#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,889 INFO L280 TraceCheckUtils]: 12: Hoare triple {17438#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,890 INFO L280 TraceCheckUtils]: 13: Hoare triple {17438#(<= 0 main_~t~0)} havoc #t~pre1; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,890 INFO L280 TraceCheckUtils]: 14: Hoare triple {17438#(<= 0 main_~t~0)} assume !false; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,891 INFO L280 TraceCheckUtils]: 15: Hoare triple {17438#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,891 INFO L280 TraceCheckUtils]: 16: Hoare triple {17438#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,892 INFO L280 TraceCheckUtils]: 17: Hoare triple {17438#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,894 INFO L280 TraceCheckUtils]: 18: Hoare triple {17438#(<= 0 main_~t~0)} havoc #t~nondet2; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,894 INFO L263 TraceCheckUtils]: 19: Hoare triple {17438#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17434#true} is VALID [2020-07-08 17:38:56,894 INFO L280 TraceCheckUtils]: 20: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,895 INFO L280 TraceCheckUtils]: 21: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,895 INFO L280 TraceCheckUtils]: 22: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,897 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #152#return; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,897 INFO L263 TraceCheckUtils]: 24: Hoare triple {17438#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {17434#true} is VALID [2020-07-08 17:38:56,897 INFO L280 TraceCheckUtils]: 25: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,898 INFO L280 TraceCheckUtils]: 26: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,898 INFO L280 TraceCheckUtils]: 27: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,899 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {17434#true} {17438#(<= 0 main_~t~0)} #154#return; {17438#(<= 0 main_~t~0)} is VALID [2020-07-08 17:38:56,900 INFO L280 TraceCheckUtils]: 29: Hoare triple {17438#(<= 0 main_~t~0)} #t~post3 := ~t~0; {17447#(<= 0 |main_#t~post3|)} is VALID [2020-07-08 17:38:56,901 INFO L280 TraceCheckUtils]: 30: Hoare triple {17447#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,902 INFO L280 TraceCheckUtils]: 31: Hoare triple {17448#(<= 1 main_~t~0)} havoc #t~post3; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,902 INFO L280 TraceCheckUtils]: 32: Hoare triple {17448#(<= 1 main_~t~0)} assume !false; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,903 INFO L280 TraceCheckUtils]: 33: Hoare triple {17448#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,903 INFO L280 TraceCheckUtils]: 34: Hoare triple {17448#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,904 INFO L280 TraceCheckUtils]: 35: Hoare triple {17448#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,905 INFO L280 TraceCheckUtils]: 36: Hoare triple {17448#(<= 1 main_~t~0)} havoc #t~nondet2; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,905 INFO L263 TraceCheckUtils]: 37: Hoare triple {17448#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17434#true} is VALID [2020-07-08 17:38:56,906 INFO L280 TraceCheckUtils]: 38: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,906 INFO L280 TraceCheckUtils]: 39: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,906 INFO L280 TraceCheckUtils]: 40: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,907 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #156#return; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,907 INFO L263 TraceCheckUtils]: 42: Hoare triple {17448#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {17434#true} is VALID [2020-07-08 17:38:56,908 INFO L280 TraceCheckUtils]: 43: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,908 INFO L280 TraceCheckUtils]: 44: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,908 INFO L280 TraceCheckUtils]: 45: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,909 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {17434#true} {17448#(<= 1 main_~t~0)} #158#return; {17448#(<= 1 main_~t~0)} is VALID [2020-07-08 17:38:56,910 INFO L280 TraceCheckUtils]: 47: Hoare triple {17448#(<= 1 main_~t~0)} #t~post4 := ~t~0; {17457#(<= 1 |main_#t~post4|)} is VALID [2020-07-08 17:38:56,911 INFO L280 TraceCheckUtils]: 48: Hoare triple {17457#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,912 INFO L280 TraceCheckUtils]: 49: Hoare triple {17458#(<= 2 main_~t~0)} havoc #t~post4; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,913 INFO L280 TraceCheckUtils]: 50: Hoare triple {17458#(<= 2 main_~t~0)} assume !false; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,913 INFO L280 TraceCheckUtils]: 51: Hoare triple {17458#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,914 INFO L280 TraceCheckUtils]: 52: Hoare triple {17458#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,915 INFO L280 TraceCheckUtils]: 53: Hoare triple {17458#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,915 INFO L280 TraceCheckUtils]: 54: Hoare triple {17458#(<= 2 main_~t~0)} havoc #t~nondet5; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,916 INFO L280 TraceCheckUtils]: 55: Hoare triple {17458#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,916 INFO L280 TraceCheckUtils]: 56: Hoare triple {17458#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,917 INFO L280 TraceCheckUtils]: 57: Hoare triple {17458#(<= 2 main_~t~0)} havoc #t~nondet6; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,917 INFO L263 TraceCheckUtils]: 58: Hoare triple {17458#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17434#true} is VALID [2020-07-08 17:38:56,917 INFO L280 TraceCheckUtils]: 59: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,917 INFO L280 TraceCheckUtils]: 60: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,918 INFO L280 TraceCheckUtils]: 61: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,918 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #172#return; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,919 INFO L263 TraceCheckUtils]: 63: Hoare triple {17458#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {17434#true} is VALID [2020-07-08 17:38:56,919 INFO L280 TraceCheckUtils]: 64: Hoare triple {17434#true} ~cond := #in~cond; {17434#true} is VALID [2020-07-08 17:38:56,919 INFO L280 TraceCheckUtils]: 65: Hoare triple {17434#true} assume !(0 == ~cond); {17434#true} is VALID [2020-07-08 17:38:56,919 INFO L280 TraceCheckUtils]: 66: Hoare triple {17434#true} assume true; {17434#true} is VALID [2020-07-08 17:38:56,920 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {17434#true} {17458#(<= 2 main_~t~0)} #174#return; {17458#(<= 2 main_~t~0)} is VALID [2020-07-08 17:38:56,921 INFO L280 TraceCheckUtils]: 68: Hoare triple {17458#(<= 2 main_~t~0)} #t~post9 := ~t~0; {17467#(<= 2 |main_#t~post9|)} is VALID [2020-07-08 17:38:56,922 INFO L280 TraceCheckUtils]: 69: Hoare triple {17467#(<= 2 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,923 INFO L280 TraceCheckUtils]: 70: Hoare triple {17468#(<= 3 main_~t~0)} havoc #t~post9; {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,924 INFO L280 TraceCheckUtils]: 71: Hoare triple {17468#(<= 3 main_~t~0)} assume !false; {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,925 INFO L280 TraceCheckUtils]: 72: Hoare triple {17468#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,926 INFO L280 TraceCheckUtils]: 73: Hoare triple {17468#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,928 INFO L280 TraceCheckUtils]: 74: Hoare triple {17468#(<= 3 main_~t~0)} assume 0 != #t~nondet5; {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,928 INFO L280 TraceCheckUtils]: 75: Hoare triple {17468#(<= 3 main_~t~0)} havoc #t~nondet5; {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,929 INFO L280 TraceCheckUtils]: 76: Hoare triple {17468#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,929 INFO L280 TraceCheckUtils]: 77: Hoare triple {17468#(<= 3 main_~t~0)} assume !(0 != #t~nondet6); {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,930 INFO L280 TraceCheckUtils]: 78: Hoare triple {17468#(<= 3 main_~t~0)} havoc #t~nondet6; {17468#(<= 3 main_~t~0)} is VALID [2020-07-08 17:38:56,931 INFO L263 TraceCheckUtils]: 79: Hoare triple {17468#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {17469#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:38:56,932 INFO L280 TraceCheckUtils]: 80: Hoare triple {17469#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {17470#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:38:56,933 INFO L280 TraceCheckUtils]: 81: Hoare triple {17470#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {17435#false} is VALID [2020-07-08 17:38:56,933 INFO L280 TraceCheckUtils]: 82: Hoare triple {17435#false} assume !false; {17435#false} is VALID [2020-07-08 17:38:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:38:56,940 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:38:56,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [921237813] [2020-07-08 17:38:56,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:38:56,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 17:38:56,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055014089] [2020-07-08 17:38:56,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2020-07-08 17:38:56,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:38:56,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 17:38:57,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:57,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 17:38:57,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:38:57,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 17:38:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-08 17:38:57,023 INFO L87 Difference]: Start difference. First operand 228 states and 260 transitions. Second operand 11 states. [2020-07-08 17:38:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:58,806 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2020-07-08 17:38:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 17:38:58,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2020-07-08 17:38:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:38:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:38:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2020-07-08 17:38:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:38:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2020-07-08 17:38:58,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 160 transitions. [2020-07-08 17:38:59,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:59,019 INFO L225 Difference]: With dead ends: 263 [2020-07-08 17:38:59,019 INFO L226 Difference]: Without dead ends: 261 [2020-07-08 17:38:59,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-08 17:38:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-07-08 17:38:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253. [2020-07-08 17:38:59,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:38:59,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand 253 states. [2020-07-08 17:38:59,468 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand 253 states. [2020-07-08 17:38:59,468 INFO L87 Difference]: Start difference. First operand 261 states. Second operand 253 states. [2020-07-08 17:38:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:59,476 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2020-07-08 17:38:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2020-07-08 17:38:59,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:59,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:59,479 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 261 states. [2020-07-08 17:38:59,479 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 261 states. [2020-07-08 17:38:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:38:59,488 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2020-07-08 17:38:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2020-07-08 17:38:59,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:38:59,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:38:59,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:38:59,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:38:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-07-08 17:38:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 291 transitions. [2020-07-08 17:38:59,496 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 291 transitions. Word has length 83 [2020-07-08 17:38:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:38:59,497 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 291 transitions. [2020-07-08 17:38:59,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 17:38:59,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 253 states and 291 transitions. [2020-07-08 17:38:59,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:38:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 291 transitions. [2020-07-08 17:38:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-07-08 17:38:59,932 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:38:59,933 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:38:59,933 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-08 17:38:59,933 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:38:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:38:59,934 INFO L82 PathProgramCache]: Analyzing trace with hash -857748777, now seen corresponding path program 3 times [2020-07-08 17:38:59,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:38:59,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1509901702] [2020-07-08 17:38:59,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:38:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:00,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,199 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19041#true} {19041#true} #144#return; {19041#true} is VALID [2020-07-08 17:39:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:00,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,207 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:00,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,215 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:00,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,222 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:00,228 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,229 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,230 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:00,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,238 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:00,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,245 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,247 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:00,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,254 INFO L280 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,255 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19047#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,255 INFO L263 TraceCheckUtils]: 0: Hoare triple {19041#true} call ULTIMATE.init(); {19041#true} is VALID [2020-07-08 17:39:00,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,256 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19041#true} {19041#true} #144#return; {19041#true} is VALID [2020-07-08 17:39:00,256 INFO L263 TraceCheckUtils]: 3: Hoare triple {19041#true} call #t~ret10 := main(); {19041#true} is VALID [2020-07-08 17:39:00,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {19041#true} havoc ~tagbuf_len~0; {19041#true} is VALID [2020-07-08 17:39:00,257 INFO L280 TraceCheckUtils]: 5: Hoare triple {19041#true} havoc ~t~0; {19041#true} is VALID [2020-07-08 17:39:00,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {19041#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19041#true} is VALID [2020-07-08 17:39:00,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {19041#true} ~tagbuf_len~0 := #t~nondet0; {19041#true} is VALID [2020-07-08 17:39:00,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {19041#true} havoc #t~nondet0; {19041#true} is VALID [2020-07-08 17:39:00,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {19041#true} assume ~tagbuf_len~0 >= 1; {19045#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {19045#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,262 INFO L280 TraceCheckUtils]: 11: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,263 INFO L280 TraceCheckUtils]: 12: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,264 INFO L280 TraceCheckUtils]: 13: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,265 INFO L280 TraceCheckUtils]: 14: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,267 INFO L280 TraceCheckUtils]: 15: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,268 INFO L280 TraceCheckUtils]: 16: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,269 INFO L280 TraceCheckUtils]: 17: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,270 INFO L280 TraceCheckUtils]: 18: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,271 INFO L263 TraceCheckUtils]: 19: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID [2020-07-08 17:39:00,271 INFO L280 TraceCheckUtils]: 20: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,271 INFO L280 TraceCheckUtils]: 21: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,271 INFO L280 TraceCheckUtils]: 22: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,273 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,273 INFO L263 TraceCheckUtils]: 24: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19041#true} is VALID [2020-07-08 17:39:00,273 INFO L280 TraceCheckUtils]: 25: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,273 INFO L280 TraceCheckUtils]: 26: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,274 INFO L280 TraceCheckUtils]: 27: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,275 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,276 INFO L280 TraceCheckUtils]: 29: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {19056#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,277 INFO L280 TraceCheckUtils]: 30: Hoare triple {19056#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,278 INFO L280 TraceCheckUtils]: 31: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,278 INFO L280 TraceCheckUtils]: 32: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,279 INFO L280 TraceCheckUtils]: 33: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,280 INFO L280 TraceCheckUtils]: 34: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,281 INFO L280 TraceCheckUtils]: 35: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,282 INFO L280 TraceCheckUtils]: 36: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,282 INFO L280 TraceCheckUtils]: 37: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,283 INFO L280 TraceCheckUtils]: 38: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,284 INFO L280 TraceCheckUtils]: 39: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,284 INFO L263 TraceCheckUtils]: 40: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID [2020-07-08 17:39:00,285 INFO L280 TraceCheckUtils]: 41: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,285 INFO L280 TraceCheckUtils]: 42: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,285 INFO L280 TraceCheckUtils]: 43: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,286 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,286 INFO L263 TraceCheckUtils]: 45: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19041#true} is VALID [2020-07-08 17:39:00,287 INFO L280 TraceCheckUtils]: 46: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,287 INFO L280 TraceCheckUtils]: 47: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,287 INFO L280 TraceCheckUtils]: 48: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,288 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,289 INFO L280 TraceCheckUtils]: 50: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {19065#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,290 INFO L280 TraceCheckUtils]: 51: Hoare triple {19065#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,291 INFO L280 TraceCheckUtils]: 52: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,292 INFO L280 TraceCheckUtils]: 53: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,293 INFO L280 TraceCheckUtils]: 54: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,294 INFO L280 TraceCheckUtils]: 55: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,295 INFO L280 TraceCheckUtils]: 56: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,296 INFO L280 TraceCheckUtils]: 57: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,297 INFO L280 TraceCheckUtils]: 58: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,297 INFO L280 TraceCheckUtils]: 59: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,298 INFO L280 TraceCheckUtils]: 60: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,299 INFO L263 TraceCheckUtils]: 61: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID [2020-07-08 17:39:00,299 INFO L280 TraceCheckUtils]: 62: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,299 INFO L280 TraceCheckUtils]: 63: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,299 INFO L280 TraceCheckUtils]: 64: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,300 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,301 INFO L263 TraceCheckUtils]: 66: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19041#true} is VALID [2020-07-08 17:39:00,301 INFO L280 TraceCheckUtils]: 67: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,301 INFO L280 TraceCheckUtils]: 68: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,301 INFO L280 TraceCheckUtils]: 69: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,302 INFO L275 TraceCheckUtils]: 70: Hoare quadruple {19041#true} {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,303 INFO L280 TraceCheckUtils]: 71: Hoare triple {19046#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {19074#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,304 INFO L280 TraceCheckUtils]: 72: Hoare triple {19074#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,305 INFO L280 TraceCheckUtils]: 73: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,306 INFO L280 TraceCheckUtils]: 74: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,307 INFO L263 TraceCheckUtils]: 75: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {19041#true} is VALID [2020-07-08 17:39:00,307 INFO L280 TraceCheckUtils]: 76: Hoare triple {19041#true} ~cond := #in~cond; {19041#true} is VALID [2020-07-08 17:39:00,308 INFO L280 TraceCheckUtils]: 77: Hoare triple {19041#true} assume !(0 == ~cond); {19041#true} is VALID [2020-07-08 17:39:00,308 INFO L280 TraceCheckUtils]: 78: Hoare triple {19041#true} assume true; {19041#true} is VALID [2020-07-08 17:39:00,309 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {19041#true} {19047#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {19047#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:00,311 INFO L263 TraceCheckUtils]: 80: Hoare triple {19047#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {19079#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:00,312 INFO L280 TraceCheckUtils]: 81: Hoare triple {19079#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {19080#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:00,313 INFO L280 TraceCheckUtils]: 82: Hoare triple {19080#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {19042#false} is VALID [2020-07-08 17:39:00,314 INFO L280 TraceCheckUtils]: 83: Hoare triple {19042#false} assume !false; {19042#false} is VALID [2020-07-08 17:39:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:39:00,327 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:00,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1509901702] [2020-07-08 17:39:00,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:00,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 17:39:00,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321079811] [2020-07-08 17:39:00,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2020-07-08 17:39:00,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:00,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 17:39:00,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:00,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 17:39:00,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 17:39:00,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:39:00,450 INFO L87 Difference]: Start difference. First operand 253 states and 291 transitions. Second operand 10 states. [2020-07-08 17:39:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:01,970 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2020-07-08 17:39:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 17:39:01,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2020-07-08 17:39:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:39:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2020-07-08 17:39:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:39:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2020-07-08 17:39:01,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 135 transitions. [2020-07-08 17:39:02,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:02,151 INFO L225 Difference]: With dead ends: 262 [2020-07-08 17:39:02,151 INFO L226 Difference]: Without dead ends: 152 [2020-07-08 17:39:02,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-07-08 17:39:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-08 17:39:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2020-07-08 17:39:02,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:02,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 150 states. [2020-07-08 17:39:02,393 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 150 states. [2020-07-08 17:39:02,393 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 150 states. [2020-07-08 17:39:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:02,396 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2020-07-08 17:39:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2020-07-08 17:39:02,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:02,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:02,397 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 152 states. [2020-07-08 17:39:02,397 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 152 states. [2020-07-08 17:39:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:02,400 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2020-07-08 17:39:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2020-07-08 17:39:02,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:02,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:02,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:02,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-07-08 17:39:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2020-07-08 17:39:02,403 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 84 [2020-07-08 17:39:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:02,404 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2020-07-08 17:39:02,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 17:39:02,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 150 states and 170 transitions. [2020-07-08 17:39:02,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2020-07-08 17:39:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-07-08 17:39:02,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:02,676 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:02,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-08 17:39:02,677 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:02,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:02,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1405253968, now seen corresponding path program 2 times [2020-07-08 17:39:02,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:02,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [63745382] [2020-07-08 17:39:02,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:02,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,907 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20227#true} {20227#true} #144#return; {20227#true} is VALID [2020-07-08 17:39:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:02,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,912 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:02,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,921 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:02,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,929 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:02,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,935 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,936 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:02,943 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,944 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:02,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,951 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:02,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,960 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {20227#true} {20233#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,961 INFO L263 TraceCheckUtils]: 0: Hoare triple {20227#true} call ULTIMATE.init(); {20227#true} is VALID [2020-07-08 17:39:02,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,962 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20227#true} {20227#true} #144#return; {20227#true} is VALID [2020-07-08 17:39:02,962 INFO L263 TraceCheckUtils]: 3: Hoare triple {20227#true} call #t~ret10 := main(); {20227#true} is VALID [2020-07-08 17:39:02,962 INFO L280 TraceCheckUtils]: 4: Hoare triple {20227#true} havoc ~tagbuf_len~0; {20227#true} is VALID [2020-07-08 17:39:02,963 INFO L280 TraceCheckUtils]: 5: Hoare triple {20227#true} havoc ~t~0; {20227#true} is VALID [2020-07-08 17:39:02,963 INFO L280 TraceCheckUtils]: 6: Hoare triple {20227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {20227#true} is VALID [2020-07-08 17:39:02,963 INFO L280 TraceCheckUtils]: 7: Hoare triple {20227#true} ~tagbuf_len~0 := #t~nondet0; {20227#true} is VALID [2020-07-08 17:39:02,964 INFO L280 TraceCheckUtils]: 8: Hoare triple {20227#true} havoc #t~nondet0; {20227#true} is VALID [2020-07-08 17:39:02,966 INFO L280 TraceCheckUtils]: 9: Hoare triple {20227#true} assume ~tagbuf_len~0 >= 1; {20231#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,967 INFO L280 TraceCheckUtils]: 10: Hoare triple {20231#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,968 INFO L280 TraceCheckUtils]: 11: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,969 INFO L280 TraceCheckUtils]: 12: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,970 INFO L280 TraceCheckUtils]: 13: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,971 INFO L280 TraceCheckUtils]: 14: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,972 INFO L280 TraceCheckUtils]: 15: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,974 INFO L280 TraceCheckUtils]: 16: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,975 INFO L280 TraceCheckUtils]: 17: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,976 INFO L280 TraceCheckUtils]: 18: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,976 INFO L263 TraceCheckUtils]: 19: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID [2020-07-08 17:39:02,976 INFO L280 TraceCheckUtils]: 20: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,977 INFO L280 TraceCheckUtils]: 21: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,977 INFO L280 TraceCheckUtils]: 22: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,978 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,979 INFO L263 TraceCheckUtils]: 24: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20227#true} is VALID [2020-07-08 17:39:02,979 INFO L280 TraceCheckUtils]: 25: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,979 INFO L280 TraceCheckUtils]: 26: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,980 INFO L280 TraceCheckUtils]: 27: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,981 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,982 INFO L280 TraceCheckUtils]: 29: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {20242#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,984 INFO L280 TraceCheckUtils]: 30: Hoare triple {20242#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,985 INFO L280 TraceCheckUtils]: 31: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,986 INFO L280 TraceCheckUtils]: 32: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,987 INFO L280 TraceCheckUtils]: 33: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,988 INFO L280 TraceCheckUtils]: 34: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,989 INFO L280 TraceCheckUtils]: 35: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,989 INFO L280 TraceCheckUtils]: 36: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,990 INFO L263 TraceCheckUtils]: 37: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID [2020-07-08 17:39:02,990 INFO L280 TraceCheckUtils]: 38: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,990 INFO L280 TraceCheckUtils]: 39: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,991 INFO L280 TraceCheckUtils]: 40: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,992 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,992 INFO L263 TraceCheckUtils]: 42: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20227#true} is VALID [2020-07-08 17:39:02,993 INFO L280 TraceCheckUtils]: 43: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:02,993 INFO L280 TraceCheckUtils]: 44: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:02,993 INFO L280 TraceCheckUtils]: 45: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:02,995 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,996 INFO L280 TraceCheckUtils]: 47: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {20251#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,997 INFO L280 TraceCheckUtils]: 48: Hoare triple {20251#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:02,999 INFO L280 TraceCheckUtils]: 49: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,000 INFO L280 TraceCheckUtils]: 50: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,001 INFO L280 TraceCheckUtils]: 51: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,002 INFO L280 TraceCheckUtils]: 52: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,002 INFO L280 TraceCheckUtils]: 53: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,004 INFO L280 TraceCheckUtils]: 54: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,004 INFO L280 TraceCheckUtils]: 55: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,006 INFO L280 TraceCheckUtils]: 56: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,006 INFO L280 TraceCheckUtils]: 57: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,007 INFO L263 TraceCheckUtils]: 58: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID [2020-07-08 17:39:03,007 INFO L280 TraceCheckUtils]: 59: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:03,007 INFO L280 TraceCheckUtils]: 60: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:03,008 INFO L280 TraceCheckUtils]: 61: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:03,009 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,009 INFO L263 TraceCheckUtils]: 63: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20227#true} is VALID [2020-07-08 17:39:03,009 INFO L280 TraceCheckUtils]: 64: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:03,010 INFO L280 TraceCheckUtils]: 65: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:03,010 INFO L280 TraceCheckUtils]: 66: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:03,011 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {20227#true} {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,012 INFO L280 TraceCheckUtils]: 68: Hoare triple {20232#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {20260#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,013 INFO L280 TraceCheckUtils]: 69: Hoare triple {20260#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,014 INFO L280 TraceCheckUtils]: 70: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,014 INFO L280 TraceCheckUtils]: 71: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,015 INFO L280 TraceCheckUtils]: 72: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,015 INFO L280 TraceCheckUtils]: 73: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,016 INFO L280 TraceCheckUtils]: 74: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet5; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,017 INFO L280 TraceCheckUtils]: 75: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet5; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,017 INFO L280 TraceCheckUtils]: 76: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,018 INFO L280 TraceCheckUtils]: 77: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,019 INFO L280 TraceCheckUtils]: 78: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~nondet6; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,019 INFO L263 TraceCheckUtils]: 79: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {20227#true} is VALID [2020-07-08 17:39:03,020 INFO L280 TraceCheckUtils]: 80: Hoare triple {20227#true} ~cond := #in~cond; {20227#true} is VALID [2020-07-08 17:39:03,020 INFO L280 TraceCheckUtils]: 81: Hoare triple {20227#true} assume !(0 == ~cond); {20227#true} is VALID [2020-07-08 17:39:03,020 INFO L280 TraceCheckUtils]: 82: Hoare triple {20227#true} assume true; {20227#true} is VALID [2020-07-08 17:39:03,021 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {20227#true} {20233#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {20233#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:03,022 INFO L263 TraceCheckUtils]: 84: Hoare triple {20233#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {20265#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:03,024 INFO L280 TraceCheckUtils]: 85: Hoare triple {20265#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {20266#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:03,024 INFO L280 TraceCheckUtils]: 86: Hoare triple {20266#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {20228#false} is VALID [2020-07-08 17:39:03,025 INFO L280 TraceCheckUtils]: 87: Hoare triple {20228#false} assume !false; {20228#false} is VALID [2020-07-08 17:39:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:39:03,040 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:03,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [63745382] [2020-07-08 17:39:03,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:03,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 17:39:03,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243890191] [2020-07-08 17:39:03,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2020-07-08 17:39:03,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:03,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 17:39:03,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:03,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 17:39:03,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:03,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 17:39:03,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:39:03,140 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 10 states. [2020-07-08 17:39:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:04,346 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2020-07-08 17:39:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 17:39:04,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2020-07-08 17:39:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:39:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 113 transitions. [2020-07-08 17:39:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:39:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 113 transitions. [2020-07-08 17:39:04,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 113 transitions. [2020-07-08 17:39:04,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:04,513 INFO L225 Difference]: With dead ends: 160 [2020-07-08 17:39:04,514 INFO L226 Difference]: Without dead ends: 155 [2020-07-08 17:39:04,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-07-08 17:39:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-07-08 17:39:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2020-07-08 17:39:04,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:04,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 153 states. [2020-07-08 17:39:04,763 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 153 states. [2020-07-08 17:39:04,764 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 153 states. [2020-07-08 17:39:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:04,766 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2020-07-08 17:39:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2020-07-08 17:39:04,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:04,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:04,767 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 155 states. [2020-07-08 17:39:04,767 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 155 states. [2020-07-08 17:39:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:04,771 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2020-07-08 17:39:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2020-07-08 17:39:04,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:04,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:04,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:04,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-08 17:39:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2020-07-08 17:39:04,776 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 88 [2020-07-08 17:39:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:04,776 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2020-07-08 17:39:04,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 17:39:04,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 171 transitions. [2020-07-08 17:39:05,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-07-08 17:39:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-07-08 17:39:05,070 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:05,071 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1] [2020-07-08 17:39:05,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-08 17:39:05,071 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:05,071 INFO L82 PathProgramCache]: Analyzing trace with hash 813915649, now seen corresponding path program 1 times [2020-07-08 17:39:05,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:05,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1418416841] [2020-07-08 17:39:05,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,265 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21221#true} {21221#true} #144#return; {21221#true} is VALID [2020-07-08 17:39:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,272 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #152#return; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,278 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #154#return; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,285 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #156#return; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,291 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,291 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,293 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #158#return; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,300 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,301 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,302 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #172#return; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,308 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,309 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #174#return; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,315 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #164#return; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:05,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,321 INFO L280 TraceCheckUtils]: 2: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,322 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #166#return; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,322 INFO L263 TraceCheckUtils]: 0: Hoare triple {21221#true} call ULTIMATE.init(); {21221#true} is VALID [2020-07-08 17:39:05,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,323 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21221#true} {21221#true} #144#return; {21221#true} is VALID [2020-07-08 17:39:05,323 INFO L263 TraceCheckUtils]: 3: Hoare triple {21221#true} call #t~ret10 := main(); {21221#true} is VALID [2020-07-08 17:39:05,323 INFO L280 TraceCheckUtils]: 4: Hoare triple {21221#true} havoc ~tagbuf_len~0; {21221#true} is VALID [2020-07-08 17:39:05,323 INFO L280 TraceCheckUtils]: 5: Hoare triple {21221#true} havoc ~t~0; {21221#true} is VALID [2020-07-08 17:39:05,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {21221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {21221#true} is VALID [2020-07-08 17:39:05,324 INFO L280 TraceCheckUtils]: 7: Hoare triple {21221#true} ~tagbuf_len~0 := #t~nondet0; {21221#true} is VALID [2020-07-08 17:39:05,324 INFO L280 TraceCheckUtils]: 8: Hoare triple {21221#true} havoc #t~nondet0; {21221#true} is VALID [2020-07-08 17:39:05,324 INFO L280 TraceCheckUtils]: 9: Hoare triple {21221#true} assume ~tagbuf_len~0 >= 1; {21221#true} is VALID [2020-07-08 17:39:05,325 INFO L280 TraceCheckUtils]: 10: Hoare triple {21221#true} ~t~0 := 0; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,326 INFO L280 TraceCheckUtils]: 11: Hoare triple {21225#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,327 INFO L280 TraceCheckUtils]: 12: Hoare triple {21225#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {21225#(<= 0 main_~t~0)} havoc #t~pre1; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,329 INFO L280 TraceCheckUtils]: 14: Hoare triple {21225#(<= 0 main_~t~0)} assume !false; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,329 INFO L280 TraceCheckUtils]: 15: Hoare triple {21225#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,330 INFO L280 TraceCheckUtils]: 16: Hoare triple {21225#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,331 INFO L280 TraceCheckUtils]: 17: Hoare triple {21225#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,331 INFO L280 TraceCheckUtils]: 18: Hoare triple {21225#(<= 0 main_~t~0)} havoc #t~nondet2; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,332 INFO L263 TraceCheckUtils]: 19: Hoare triple {21225#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID [2020-07-08 17:39:05,332 INFO L280 TraceCheckUtils]: 20: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,332 INFO L280 TraceCheckUtils]: 21: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,332 INFO L280 TraceCheckUtils]: 22: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,333 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #152#return; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,334 INFO L263 TraceCheckUtils]: 24: Hoare triple {21225#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID [2020-07-08 17:39:05,334 INFO L280 TraceCheckUtils]: 25: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,334 INFO L280 TraceCheckUtils]: 26: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,335 INFO L280 TraceCheckUtils]: 27: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,336 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {21221#true} {21225#(<= 0 main_~t~0)} #154#return; {21225#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:05,337 INFO L280 TraceCheckUtils]: 29: Hoare triple {21225#(<= 0 main_~t~0)} #t~post3 := ~t~0; {21234#(<= 0 |main_#t~post3|)} is VALID [2020-07-08 17:39:05,338 INFO L280 TraceCheckUtils]: 30: Hoare triple {21234#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,338 INFO L280 TraceCheckUtils]: 31: Hoare triple {21235#(<= 1 main_~t~0)} havoc #t~post3; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,339 INFO L280 TraceCheckUtils]: 32: Hoare triple {21235#(<= 1 main_~t~0)} assume !false; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,340 INFO L280 TraceCheckUtils]: 33: Hoare triple {21235#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,341 INFO L280 TraceCheckUtils]: 34: Hoare triple {21235#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,341 INFO L280 TraceCheckUtils]: 35: Hoare triple {21235#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,342 INFO L280 TraceCheckUtils]: 36: Hoare triple {21235#(<= 1 main_~t~0)} havoc #t~nondet2; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,342 INFO L263 TraceCheckUtils]: 37: Hoare triple {21235#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID [2020-07-08 17:39:05,342 INFO L280 TraceCheckUtils]: 38: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,342 INFO L280 TraceCheckUtils]: 39: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,343 INFO L280 TraceCheckUtils]: 40: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,343 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #156#return; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,344 INFO L263 TraceCheckUtils]: 42: Hoare triple {21235#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID [2020-07-08 17:39:05,344 INFO L280 TraceCheckUtils]: 43: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,344 INFO L280 TraceCheckUtils]: 44: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,344 INFO L280 TraceCheckUtils]: 45: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,345 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {21221#true} {21235#(<= 1 main_~t~0)} #158#return; {21235#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:05,346 INFO L280 TraceCheckUtils]: 47: Hoare triple {21235#(<= 1 main_~t~0)} #t~post4 := ~t~0; {21244#(<= 1 |main_#t~post4|)} is VALID [2020-07-08 17:39:05,347 INFO L280 TraceCheckUtils]: 48: Hoare triple {21244#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,348 INFO L280 TraceCheckUtils]: 49: Hoare triple {21245#(<= 2 main_~t~0)} havoc #t~post4; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,349 INFO L280 TraceCheckUtils]: 50: Hoare triple {21245#(<= 2 main_~t~0)} assume !false; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,350 INFO L280 TraceCheckUtils]: 51: Hoare triple {21245#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,350 INFO L280 TraceCheckUtils]: 52: Hoare triple {21245#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,351 INFO L280 TraceCheckUtils]: 53: Hoare triple {21245#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,352 INFO L280 TraceCheckUtils]: 54: Hoare triple {21245#(<= 2 main_~t~0)} havoc #t~nondet5; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,352 INFO L280 TraceCheckUtils]: 55: Hoare triple {21245#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,353 INFO L280 TraceCheckUtils]: 56: Hoare triple {21245#(<= 2 main_~t~0)} assume !(0 != #t~nondet6); {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,354 INFO L280 TraceCheckUtils]: 57: Hoare triple {21245#(<= 2 main_~t~0)} havoc #t~nondet6; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,354 INFO L263 TraceCheckUtils]: 58: Hoare triple {21245#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID [2020-07-08 17:39:05,354 INFO L280 TraceCheckUtils]: 59: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,355 INFO L280 TraceCheckUtils]: 60: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,355 INFO L280 TraceCheckUtils]: 61: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,356 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #172#return; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,356 INFO L263 TraceCheckUtils]: 63: Hoare triple {21245#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID [2020-07-08 17:39:05,356 INFO L280 TraceCheckUtils]: 64: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,357 INFO L280 TraceCheckUtils]: 65: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,357 INFO L280 TraceCheckUtils]: 66: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,358 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {21221#true} {21245#(<= 2 main_~t~0)} #174#return; {21245#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:05,358 INFO L280 TraceCheckUtils]: 68: Hoare triple {21245#(<= 2 main_~t~0)} #t~post9 := ~t~0; {21254#(<= 2 |main_#t~post9|)} is VALID [2020-07-08 17:39:05,360 INFO L280 TraceCheckUtils]: 69: Hoare triple {21254#(<= 2 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,361 INFO L280 TraceCheckUtils]: 70: Hoare triple {21255#(<= 3 main_~t~0)} havoc #t~post9; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,362 INFO L280 TraceCheckUtils]: 71: Hoare triple {21255#(<= 3 main_~t~0)} assume !false; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,363 INFO L280 TraceCheckUtils]: 72: Hoare triple {21255#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,363 INFO L280 TraceCheckUtils]: 73: Hoare triple {21255#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,364 INFO L280 TraceCheckUtils]: 74: Hoare triple {21255#(<= 3 main_~t~0)} assume 0 != #t~nondet5; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,365 INFO L280 TraceCheckUtils]: 75: Hoare triple {21255#(<= 3 main_~t~0)} havoc #t~nondet5; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,365 INFO L280 TraceCheckUtils]: 76: Hoare triple {21255#(<= 3 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,366 INFO L280 TraceCheckUtils]: 77: Hoare triple {21255#(<= 3 main_~t~0)} assume 0 != #t~nondet6; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,367 INFO L280 TraceCheckUtils]: 78: Hoare triple {21255#(<= 3 main_~t~0)} havoc #t~nondet6; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,367 INFO L263 TraceCheckUtils]: 79: Hoare triple {21255#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21221#true} is VALID [2020-07-08 17:39:05,367 INFO L280 TraceCheckUtils]: 80: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,367 INFO L280 TraceCheckUtils]: 81: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,368 INFO L280 TraceCheckUtils]: 82: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,368 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #164#return; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,369 INFO L263 TraceCheckUtils]: 84: Hoare triple {21255#(<= 3 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {21221#true} is VALID [2020-07-08 17:39:05,369 INFO L280 TraceCheckUtils]: 85: Hoare triple {21221#true} ~cond := #in~cond; {21221#true} is VALID [2020-07-08 17:39:05,369 INFO L280 TraceCheckUtils]: 86: Hoare triple {21221#true} assume !(0 == ~cond); {21221#true} is VALID [2020-07-08 17:39:05,369 INFO L280 TraceCheckUtils]: 87: Hoare triple {21221#true} assume true; {21221#true} is VALID [2020-07-08 17:39:05,370 INFO L275 TraceCheckUtils]: 88: Hoare quadruple {21221#true} {21255#(<= 3 main_~t~0)} #166#return; {21255#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:05,371 INFO L280 TraceCheckUtils]: 89: Hoare triple {21255#(<= 3 main_~t~0)} #t~post7 := ~t~0; {21264#(<= 3 |main_#t~post7|)} is VALID [2020-07-08 17:39:05,372 INFO L280 TraceCheckUtils]: 90: Hoare triple {21264#(<= 3 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {21265#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:05,373 INFO L280 TraceCheckUtils]: 91: Hoare triple {21265#(<= 4 main_~t~0)} havoc #t~post7; {21265#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:05,374 INFO L280 TraceCheckUtils]: 92: Hoare triple {21265#(<= 4 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {21265#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:05,375 INFO L263 TraceCheckUtils]: 93: Hoare triple {21265#(<= 4 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {21266#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:05,376 INFO L280 TraceCheckUtils]: 94: Hoare triple {21266#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {21267#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:05,377 INFO L280 TraceCheckUtils]: 95: Hoare triple {21267#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {21222#false} is VALID [2020-07-08 17:39:05,377 INFO L280 TraceCheckUtils]: 96: Hoare triple {21222#false} assume !false; {21222#false} is VALID [2020-07-08 17:39:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:39:05,385 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:05,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1418416841] [2020-07-08 17:39:05,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:05,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-08 17:39:05,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443041401] [2020-07-08 17:39:05,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-07-08 17:39:05,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:05,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 17:39:05,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:05,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 17:39:05,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:05,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 17:39:05,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-08 17:39:05,481 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 13 states. [2020-07-08 17:39:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:07,423 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2020-07-08 17:39:07,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 17:39:07,423 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-07-08 17:39:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:39:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2020-07-08 17:39:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:39:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2020-07-08 17:39:07,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 159 transitions. [2020-07-08 17:39:07,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:07,641 INFO L225 Difference]: With dead ends: 194 [2020-07-08 17:39:07,641 INFO L226 Difference]: Without dead ends: 192 [2020-07-08 17:39:07,642 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-07-08 17:39:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-07-08 17:39:07,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183. [2020-07-08 17:39:07,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:07,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 183 states. [2020-07-08 17:39:07,926 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 183 states. [2020-07-08 17:39:07,927 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 183 states. [2020-07-08 17:39:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:07,931 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2020-07-08 17:39:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 219 transitions. [2020-07-08 17:39:07,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:07,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:07,932 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 192 states. [2020-07-08 17:39:07,932 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 192 states. [2020-07-08 17:39:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:07,937 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2020-07-08 17:39:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 219 transitions. [2020-07-08 17:39:07,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:07,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:07,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:07,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-08 17:39:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2020-07-08 17:39:07,942 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 97 [2020-07-08 17:39:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:07,943 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2020-07-08 17:39:07,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 17:39:07,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 183 states and 208 transitions. [2020-07-08 17:39:08,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2020-07-08 17:39:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-07-08 17:39:08,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:08,280 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1] [2020-07-08 17:39:08,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-08 17:39:08,281 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:08,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:08,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1992677655, now seen corresponding path program 2 times [2020-07-08 17:39:08,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:08,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750673710] [2020-07-08 17:39:08,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,451 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22428#true} {22428#true} #144#return; {22428#true} is VALID [2020-07-08 17:39:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,461 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #152#return; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,465 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,466 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #154#return; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,474 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #156#return; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,480 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #158#return; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,491 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #164#return; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,497 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #166#return; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,502 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,503 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,504 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #172#return; {22462#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:08,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,510 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #174#return; {22462#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:08,510 INFO L263 TraceCheckUtils]: 0: Hoare triple {22428#true} call ULTIMATE.init(); {22428#true} is VALID [2020-07-08 17:39:08,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,510 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22428#true} {22428#true} #144#return; {22428#true} is VALID [2020-07-08 17:39:08,511 INFO L263 TraceCheckUtils]: 3: Hoare triple {22428#true} call #t~ret10 := main(); {22428#true} is VALID [2020-07-08 17:39:08,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {22428#true} havoc ~tagbuf_len~0; {22428#true} is VALID [2020-07-08 17:39:08,511 INFO L280 TraceCheckUtils]: 5: Hoare triple {22428#true} havoc ~t~0; {22428#true} is VALID [2020-07-08 17:39:08,511 INFO L280 TraceCheckUtils]: 6: Hoare triple {22428#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {22428#true} is VALID [2020-07-08 17:39:08,511 INFO L280 TraceCheckUtils]: 7: Hoare triple {22428#true} ~tagbuf_len~0 := #t~nondet0; {22428#true} is VALID [2020-07-08 17:39:08,512 INFO L280 TraceCheckUtils]: 8: Hoare triple {22428#true} havoc #t~nondet0; {22428#true} is VALID [2020-07-08 17:39:08,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {22428#true} assume ~tagbuf_len~0 >= 1; {22428#true} is VALID [2020-07-08 17:39:08,513 INFO L280 TraceCheckUtils]: 10: Hoare triple {22428#true} ~t~0 := 0; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,513 INFO L280 TraceCheckUtils]: 11: Hoare triple {22432#(<= 0 main_~t~0)} #t~pre1 := ~tagbuf_len~0 - 1; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,514 INFO L280 TraceCheckUtils]: 12: Hoare triple {22432#(<= 0 main_~t~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,515 INFO L280 TraceCheckUtils]: 13: Hoare triple {22432#(<= 0 main_~t~0)} havoc #t~pre1; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,515 INFO L280 TraceCheckUtils]: 14: Hoare triple {22432#(<= 0 main_~t~0)} assume !false; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,516 INFO L280 TraceCheckUtils]: 15: Hoare triple {22432#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,516 INFO L280 TraceCheckUtils]: 16: Hoare triple {22432#(<= 0 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,517 INFO L280 TraceCheckUtils]: 17: Hoare triple {22432#(<= 0 main_~t~0)} assume !(0 != #t~nondet2); {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,518 INFO L280 TraceCheckUtils]: 18: Hoare triple {22432#(<= 0 main_~t~0)} havoc #t~nondet2; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,518 INFO L263 TraceCheckUtils]: 19: Hoare triple {22432#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID [2020-07-08 17:39:08,518 INFO L280 TraceCheckUtils]: 20: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,519 INFO L280 TraceCheckUtils]: 21: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,519 INFO L280 TraceCheckUtils]: 22: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,519 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #152#return; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,520 INFO L263 TraceCheckUtils]: 24: Hoare triple {22432#(<= 0 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID [2020-07-08 17:39:08,520 INFO L280 TraceCheckUtils]: 25: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,520 INFO L280 TraceCheckUtils]: 26: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,520 INFO L280 TraceCheckUtils]: 27: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,521 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {22428#true} {22432#(<= 0 main_~t~0)} #154#return; {22432#(<= 0 main_~t~0)} is VALID [2020-07-08 17:39:08,522 INFO L280 TraceCheckUtils]: 29: Hoare triple {22432#(<= 0 main_~t~0)} #t~post3 := ~t~0; {22441#(<= 0 |main_#t~post3|)} is VALID [2020-07-08 17:39:08,523 INFO L280 TraceCheckUtils]: 30: Hoare triple {22441#(<= 0 |main_#t~post3|)} ~t~0 := 1 + #t~post3; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,524 INFO L280 TraceCheckUtils]: 31: Hoare triple {22442#(<= 1 main_~t~0)} havoc #t~post3; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,524 INFO L280 TraceCheckUtils]: 32: Hoare triple {22442#(<= 1 main_~t~0)} assume !false; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,525 INFO L280 TraceCheckUtils]: 33: Hoare triple {22442#(<= 1 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,525 INFO L280 TraceCheckUtils]: 34: Hoare triple {22442#(<= 1 main_~t~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,526 INFO L280 TraceCheckUtils]: 35: Hoare triple {22442#(<= 1 main_~t~0)} assume 0 != #t~nondet2; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,527 INFO L280 TraceCheckUtils]: 36: Hoare triple {22442#(<= 1 main_~t~0)} havoc #t~nondet2; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,527 INFO L263 TraceCheckUtils]: 37: Hoare triple {22442#(<= 1 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID [2020-07-08 17:39:08,527 INFO L280 TraceCheckUtils]: 38: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,528 INFO L280 TraceCheckUtils]: 39: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,528 INFO L280 TraceCheckUtils]: 40: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,529 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #156#return; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,529 INFO L263 TraceCheckUtils]: 42: Hoare triple {22442#(<= 1 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID [2020-07-08 17:39:08,529 INFO L280 TraceCheckUtils]: 43: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,529 INFO L280 TraceCheckUtils]: 44: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,529 INFO L280 TraceCheckUtils]: 45: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,530 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {22428#true} {22442#(<= 1 main_~t~0)} #158#return; {22442#(<= 1 main_~t~0)} is VALID [2020-07-08 17:39:08,531 INFO L280 TraceCheckUtils]: 47: Hoare triple {22442#(<= 1 main_~t~0)} #t~post4 := ~t~0; {22451#(<= 1 |main_#t~post4|)} is VALID [2020-07-08 17:39:08,532 INFO L280 TraceCheckUtils]: 48: Hoare triple {22451#(<= 1 |main_#t~post4|)} ~t~0 := 1 + #t~post4; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,533 INFO L280 TraceCheckUtils]: 49: Hoare triple {22452#(<= 2 main_~t~0)} havoc #t~post4; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,533 INFO L280 TraceCheckUtils]: 50: Hoare triple {22452#(<= 2 main_~t~0)} assume !false; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,534 INFO L280 TraceCheckUtils]: 51: Hoare triple {22452#(<= 2 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,535 INFO L280 TraceCheckUtils]: 52: Hoare triple {22452#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,535 INFO L280 TraceCheckUtils]: 53: Hoare triple {22452#(<= 2 main_~t~0)} assume 0 != #t~nondet5; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,536 INFO L280 TraceCheckUtils]: 54: Hoare triple {22452#(<= 2 main_~t~0)} havoc #t~nondet5; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,537 INFO L280 TraceCheckUtils]: 55: Hoare triple {22452#(<= 2 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,537 INFO L280 TraceCheckUtils]: 56: Hoare triple {22452#(<= 2 main_~t~0)} assume 0 != #t~nondet6; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,538 INFO L280 TraceCheckUtils]: 57: Hoare triple {22452#(<= 2 main_~t~0)} havoc #t~nondet6; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,538 INFO L263 TraceCheckUtils]: 58: Hoare triple {22452#(<= 2 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID [2020-07-08 17:39:08,538 INFO L280 TraceCheckUtils]: 59: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,539 INFO L280 TraceCheckUtils]: 60: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,539 INFO L280 TraceCheckUtils]: 61: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,541 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #164#return; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,541 INFO L263 TraceCheckUtils]: 63: Hoare triple {22452#(<= 2 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID [2020-07-08 17:39:08,541 INFO L280 TraceCheckUtils]: 64: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,542 INFO L280 TraceCheckUtils]: 65: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,542 INFO L280 TraceCheckUtils]: 66: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,543 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {22428#true} {22452#(<= 2 main_~t~0)} #166#return; {22452#(<= 2 main_~t~0)} is VALID [2020-07-08 17:39:08,544 INFO L280 TraceCheckUtils]: 68: Hoare triple {22452#(<= 2 main_~t~0)} #t~post7 := ~t~0; {22461#(<= 2 |main_#t~post7|)} is VALID [2020-07-08 17:39:08,545 INFO L280 TraceCheckUtils]: 69: Hoare triple {22461#(<= 2 |main_#t~post7|)} ~t~0 := 1 + #t~post7; {22462#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:08,546 INFO L280 TraceCheckUtils]: 70: Hoare triple {22462#(<= 3 main_~t~0)} havoc #t~post7; {22462#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:08,546 INFO L280 TraceCheckUtils]: 71: Hoare triple {22462#(<= 3 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22462#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:08,547 INFO L263 TraceCheckUtils]: 72: Hoare triple {22462#(<= 3 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22428#true} is VALID [2020-07-08 17:39:08,547 INFO L280 TraceCheckUtils]: 73: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,547 INFO L280 TraceCheckUtils]: 74: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,547 INFO L280 TraceCheckUtils]: 75: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,548 INFO L275 TraceCheckUtils]: 76: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #172#return; {22462#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:08,549 INFO L263 TraceCheckUtils]: 77: Hoare triple {22462#(<= 3 main_~t~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {22428#true} is VALID [2020-07-08 17:39:08,549 INFO L280 TraceCheckUtils]: 78: Hoare triple {22428#true} ~cond := #in~cond; {22428#true} is VALID [2020-07-08 17:39:08,549 INFO L280 TraceCheckUtils]: 79: Hoare triple {22428#true} assume !(0 == ~cond); {22428#true} is VALID [2020-07-08 17:39:08,549 INFO L280 TraceCheckUtils]: 80: Hoare triple {22428#true} assume true; {22428#true} is VALID [2020-07-08 17:39:08,550 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {22428#true} {22462#(<= 3 main_~t~0)} #174#return; {22462#(<= 3 main_~t~0)} is VALID [2020-07-08 17:39:08,551 INFO L280 TraceCheckUtils]: 82: Hoare triple {22462#(<= 3 main_~t~0)} #t~post9 := ~t~0; {22471#(<= 3 |main_#t~post9|)} is VALID [2020-07-08 17:39:08,552 INFO L280 TraceCheckUtils]: 83: Hoare triple {22471#(<= 3 |main_#t~post9|)} ~t~0 := 1 + #t~post9; {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,552 INFO L280 TraceCheckUtils]: 84: Hoare triple {22472#(<= 4 main_~t~0)} havoc #t~post9; {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,553 INFO L280 TraceCheckUtils]: 85: Hoare triple {22472#(<= 4 main_~t~0)} assume !false; {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,554 INFO L280 TraceCheckUtils]: 86: Hoare triple {22472#(<= 4 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0); {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,554 INFO L280 TraceCheckUtils]: 87: Hoare triple {22472#(<= 4 main_~t~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,555 INFO L280 TraceCheckUtils]: 88: Hoare triple {22472#(<= 4 main_~t~0)} assume 0 != #t~nondet5; {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,556 INFO L280 TraceCheckUtils]: 89: Hoare triple {22472#(<= 4 main_~t~0)} havoc #t~nondet5; {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,557 INFO L280 TraceCheckUtils]: 90: Hoare triple {22472#(<= 4 main_~t~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,557 INFO L280 TraceCheckUtils]: 91: Hoare triple {22472#(<= 4 main_~t~0)} assume !(0 != #t~nondet6); {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,558 INFO L280 TraceCheckUtils]: 92: Hoare triple {22472#(<= 4 main_~t~0)} havoc #t~nondet6; {22472#(<= 4 main_~t~0)} is VALID [2020-07-08 17:39:08,559 INFO L263 TraceCheckUtils]: 93: Hoare triple {22472#(<= 4 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {22473#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:08,560 INFO L280 TraceCheckUtils]: 94: Hoare triple {22473#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {22474#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:08,561 INFO L280 TraceCheckUtils]: 95: Hoare triple {22474#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {22429#false} is VALID [2020-07-08 17:39:08,561 INFO L280 TraceCheckUtils]: 96: Hoare triple {22429#false} assume !false; {22429#false} is VALID [2020-07-08 17:39:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:39:08,569 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:08,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750673710] [2020-07-08 17:39:08,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:08,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-08 17:39:08,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282542776] [2020-07-08 17:39:08,572 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-07-08 17:39:08,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:08,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 17:39:08,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:08,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 17:39:08,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:08,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 17:39:08,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-08 17:39:08,661 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 13 states. [2020-07-08 17:39:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:10,391 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2020-07-08 17:39:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 17:39:10,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-07-08 17:39:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:39:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2020-07-08 17:39:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:39:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2020-07-08 17:39:10,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 159 transitions. [2020-07-08 17:39:10,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:10,592 INFO L225 Difference]: With dead ends: 198 [2020-07-08 17:39:10,592 INFO L226 Difference]: Without dead ends: 196 [2020-07-08 17:39:10,593 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-07-08 17:39:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-07-08 17:39:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2020-07-08 17:39:10,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:10,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 157 states. [2020-07-08 17:39:10,892 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 157 states. [2020-07-08 17:39:10,892 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 157 states. [2020-07-08 17:39:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:10,897 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2020-07-08 17:39:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2020-07-08 17:39:10,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:10,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:10,898 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 196 states. [2020-07-08 17:39:10,899 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 196 states. [2020-07-08 17:39:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:10,903 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2020-07-08 17:39:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 222 transitions. [2020-07-08 17:39:10,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:10,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:10,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:10,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-07-08 17:39:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2020-07-08 17:39:10,908 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 97 [2020-07-08 17:39:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:10,908 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2020-07-08 17:39:10,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 17:39:10,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 157 states and 174 transitions. [2020-07-08 17:39:11,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2020-07-08 17:39:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-07-08 17:39:11,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:11,194 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1] [2020-07-08 17:39:11,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-08 17:39:11,195 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash 762056004, now seen corresponding path program 3 times [2020-07-08 17:39:11,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:11,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599438852] [2020-07-08 17:39:11,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,477 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23599#true} {23599#true} #144#return; {23599#true} is VALID [2020-07-08 17:39:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,482 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,483 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,489 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,495 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,502 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,510 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,519 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,526 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,540 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,542 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:11,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,552 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23599#true} {23605#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,553 INFO L263 TraceCheckUtils]: 0: Hoare triple {23599#true} call ULTIMATE.init(); {23599#true} is VALID [2020-07-08 17:39:11,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,553 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23599#true} {23599#true} #144#return; {23599#true} is VALID [2020-07-08 17:39:11,553 INFO L263 TraceCheckUtils]: 3: Hoare triple {23599#true} call #t~ret10 := main(); {23599#true} is VALID [2020-07-08 17:39:11,554 INFO L280 TraceCheckUtils]: 4: Hoare triple {23599#true} havoc ~tagbuf_len~0; {23599#true} is VALID [2020-07-08 17:39:11,554 INFO L280 TraceCheckUtils]: 5: Hoare triple {23599#true} havoc ~t~0; {23599#true} is VALID [2020-07-08 17:39:11,554 INFO L280 TraceCheckUtils]: 6: Hoare triple {23599#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {23599#true} is VALID [2020-07-08 17:39:11,554 INFO L280 TraceCheckUtils]: 7: Hoare triple {23599#true} ~tagbuf_len~0 := #t~nondet0; {23599#true} is VALID [2020-07-08 17:39:11,554 INFO L280 TraceCheckUtils]: 8: Hoare triple {23599#true} havoc #t~nondet0; {23599#true} is VALID [2020-07-08 17:39:11,555 INFO L280 TraceCheckUtils]: 9: Hoare triple {23599#true} assume ~tagbuf_len~0 >= 1; {23603#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {23603#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,558 INFO L280 TraceCheckUtils]: 11: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~pre1 := ~tagbuf_len~0 - 1; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,559 INFO L280 TraceCheckUtils]: 12: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} ~tagbuf_len~0 := ~tagbuf_len~0 - 1; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,560 INFO L280 TraceCheckUtils]: 13: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~pre1; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,560 INFO L280 TraceCheckUtils]: 14: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,561 INFO L280 TraceCheckUtils]: 15: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,562 INFO L280 TraceCheckUtils]: 16: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,562 INFO L280 TraceCheckUtils]: 17: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,563 INFO L280 TraceCheckUtils]: 18: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,563 INFO L263 TraceCheckUtils]: 19: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-08 17:39:11,563 INFO L280 TraceCheckUtils]: 20: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,564 INFO L280 TraceCheckUtils]: 21: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,564 INFO L280 TraceCheckUtils]: 22: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,565 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #152#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,565 INFO L263 TraceCheckUtils]: 24: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID [2020-07-08 17:39:11,565 INFO L280 TraceCheckUtils]: 25: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,566 INFO L280 TraceCheckUtils]: 26: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,566 INFO L280 TraceCheckUtils]: 27: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,567 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #154#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,568 INFO L280 TraceCheckUtils]: 29: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0; {23614#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,569 INFO L280 TraceCheckUtils]: 30: Hoare triple {23614#(<= (+ |main_#t~post3| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post3; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,570 INFO L280 TraceCheckUtils]: 31: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post3; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,570 INFO L280 TraceCheckUtils]: 32: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,571 INFO L280 TraceCheckUtils]: 33: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,572 INFO L280 TraceCheckUtils]: 34: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,574 INFO L280 TraceCheckUtils]: 35: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet2; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,575 INFO L280 TraceCheckUtils]: 36: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet2; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,575 INFO L263 TraceCheckUtils]: 37: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-08 17:39:11,575 INFO L280 TraceCheckUtils]: 38: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,576 INFO L280 TraceCheckUtils]: 39: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,576 INFO L280 TraceCheckUtils]: 40: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,577 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #156#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,578 INFO L263 TraceCheckUtils]: 42: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID [2020-07-08 17:39:11,578 INFO L280 TraceCheckUtils]: 43: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,578 INFO L280 TraceCheckUtils]: 44: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,579 INFO L280 TraceCheckUtils]: 45: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,580 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #158#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,581 INFO L280 TraceCheckUtils]: 47: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post4 := ~t~0; {23623#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,583 INFO L280 TraceCheckUtils]: 48: Hoare triple {23623#(<= (+ |main_#t~post4| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post4; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,584 INFO L280 TraceCheckUtils]: 49: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post4; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,585 INFO L280 TraceCheckUtils]: 50: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,586 INFO L280 TraceCheckUtils]: 51: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,586 INFO L280 TraceCheckUtils]: 52: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,587 INFO L280 TraceCheckUtils]: 53: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,588 INFO L280 TraceCheckUtils]: 54: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,588 INFO L280 TraceCheckUtils]: 55: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,589 INFO L280 TraceCheckUtils]: 56: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet6); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,590 INFO L280 TraceCheckUtils]: 57: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,590 INFO L263 TraceCheckUtils]: 58: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-08 17:39:11,590 INFO L280 TraceCheckUtils]: 59: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,591 INFO L280 TraceCheckUtils]: 60: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,591 INFO L280 TraceCheckUtils]: 61: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,593 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #172#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,593 INFO L263 TraceCheckUtils]: 63: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID [2020-07-08 17:39:11,594 INFO L280 TraceCheckUtils]: 64: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,594 INFO L280 TraceCheckUtils]: 65: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,594 INFO L280 TraceCheckUtils]: 66: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,595 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #174#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,596 INFO L280 TraceCheckUtils]: 68: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post9 := ~t~0; {23632#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,597 INFO L280 TraceCheckUtils]: 69: Hoare triple {23632#(<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post9; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,598 INFO L280 TraceCheckUtils]: 70: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post9; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,599 INFO L280 TraceCheckUtils]: 71: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,600 INFO L280 TraceCheckUtils]: 72: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,602 INFO L280 TraceCheckUtils]: 73: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,603 INFO L280 TraceCheckUtils]: 74: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,604 INFO L280 TraceCheckUtils]: 75: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet5; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,605 INFO L280 TraceCheckUtils]: 76: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,605 INFO L280 TraceCheckUtils]: 77: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume 0 != #t~nondet6; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,606 INFO L280 TraceCheckUtils]: 78: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} havoc #t~nondet6; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,607 INFO L263 TraceCheckUtils]: 79: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-08 17:39:11,607 INFO L280 TraceCheckUtils]: 80: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,608 INFO L280 TraceCheckUtils]: 81: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,608 INFO L280 TraceCheckUtils]: 82: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,609 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #164#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,610 INFO L263 TraceCheckUtils]: 84: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23599#true} is VALID [2020-07-08 17:39:11,610 INFO L280 TraceCheckUtils]: 85: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,610 INFO L280 TraceCheckUtils]: 86: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,610 INFO L280 TraceCheckUtils]: 87: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,612 INFO L275 TraceCheckUtils]: 88: Hoare quadruple {23599#true} {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #166#return; {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,614 INFO L280 TraceCheckUtils]: 89: Hoare triple {23604#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post7 := ~t~0; {23641#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,615 INFO L280 TraceCheckUtils]: 90: Hoare triple {23641#(<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)} ~t~0 := 1 + #t~post7; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,616 INFO L280 TraceCheckUtils]: 91: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} havoc #t~post7; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,617 INFO L280 TraceCheckUtils]: 92: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,617 INFO L263 TraceCheckUtils]: 93: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {23599#true} is VALID [2020-07-08 17:39:11,618 INFO L280 TraceCheckUtils]: 94: Hoare triple {23599#true} ~cond := #in~cond; {23599#true} is VALID [2020-07-08 17:39:11,618 INFO L280 TraceCheckUtils]: 95: Hoare triple {23599#true} assume !(0 == ~cond); {23599#true} is VALID [2020-07-08 17:39:11,618 INFO L280 TraceCheckUtils]: 96: Hoare triple {23599#true} assume true; {23599#true} is VALID [2020-07-08 17:39:11,621 INFO L275 TraceCheckUtils]: 97: Hoare quadruple {23599#true} {23605#(<= main_~t~0 main_~tagbuf_len~0)} #172#return; {23605#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-08 17:39:11,623 INFO L263 TraceCheckUtils]: 98: Hoare triple {23605#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {23646#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:11,624 INFO L280 TraceCheckUtils]: 99: Hoare triple {23646#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {23647#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:11,625 INFO L280 TraceCheckUtils]: 100: Hoare triple {23647#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {23600#false} is VALID [2020-07-08 17:39:11,626 INFO L280 TraceCheckUtils]: 101: Hoare triple {23600#false} assume !false; {23600#false} is VALID [2020-07-08 17:39:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:39:11,641 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:11,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599438852] [2020-07-08 17:39:11,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:11,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 17:39:11,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209611941] [2020-07-08 17:39:11,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2020-07-08 17:39:11,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:11,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 17:39:11,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:11,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 17:39:11,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:11,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 17:39:11,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-08 17:39:11,742 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 11 states. [2020-07-08 17:39:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:13,062 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2020-07-08 17:39:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 17:39:13,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2020-07-08 17:39:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:39:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2020-07-08 17:39:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:39:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2020-07-08 17:39:13,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 78 transitions. [2020-07-08 17:39:13,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:13,184 INFO L225 Difference]: With dead ends: 157 [2020-07-08 17:39:13,184 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 17:39:13,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2020-07-08 17:39:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 17:39:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 17:39:13,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:13,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:13,186 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:13,186 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:13,186 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:39:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:13,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:13,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:13,187 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:13,187 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:13,187 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:39:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:13,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:13,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:13,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:13,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 17:39:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 17:39:13,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2020-07-08 17:39:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:13,188 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 17:39:13,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 17:39:13,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 17:39:13,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:13,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:13,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-08 17:39:13,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 17:39:15,545 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:39:15,545 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:39:15,546 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:39:15,546 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 17:39:15,546 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 17:39:15,546 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:39:15,546 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 17:39:15,547 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 17:39:15,547 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 17:39:15,547 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 17:39:15,547 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 17:39:15,547 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ |main_#t~post9| 1) main_~tagbuf_len~0) (<= 1 |main_#t~post9|) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,547 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,548 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= (+ |main_#t~post9| 1) main_~tagbuf_len~0) (<= 1 |main_#t~post9|) (<= 2 main_~t~0)) [2020-07-08 17:39:15,548 INFO L264 CegarLoopResult]: At program point L27-1(lines 27 29) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,548 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,548 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 66) the Hoare annotation is: true [2020-07-08 17:39:15,548 INFO L264 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,548 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,548 INFO L264 CegarLoopResult]: At program point L44-1(lines 44 53) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,548 INFO L264 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,549 INFO L264 CegarLoopResult]: At program point L44-4(line 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,549 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ |main_#t~post4| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post4|) (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,549 INFO L264 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (and (<= (+ |main_#t~post4| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post4|) (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,549 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,549 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,549 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-08 17:39:15,549 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,550 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,550 INFO L264 CegarLoopResult]: At program point L37-2(lines 37 61) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,550 INFO L264 CegarLoopResult]: At program point L37-3(lines 37 61) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,550 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,550 INFO L264 CegarLoopResult]: At program point L21-2(lines 21 33) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-08 17:39:15,550 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 33) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,550 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,550 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 66) the Hoare annotation is: true [2020-07-08 17:39:15,551 INFO L264 CegarLoopResult]: At program point L38(lines 38 42) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,551 INFO L271 CegarLoopResult]: At program point L63(lines 14 66) the Hoare annotation is: true [2020-07-08 17:39:15,551 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,551 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 66) the Hoare annotation is: true [2020-07-08 17:39:15,551 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,551 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,551 INFO L264 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-08 17:39:15,551 INFO L264 CegarLoopResult]: At program point L55-1(lines 55 57) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,551 INFO L264 CegarLoopResult]: At program point L55-2(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,551 INFO L264 CegarLoopResult]: At program point L55-3(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ |main_#t~post7| 1) main_~tagbuf_len~0) (<= 1 |main_#t~post7|) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (and (<= (+ |main_#t~post7| 1) main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 1 |main_#t~post7|) (<= 2 main_~t~0)) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L48(lines 48 52) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 2 main_~t~0)) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ |main_#t~post3| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post3|) (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ |main_#t~post3| 1) main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 |main_#t~post3|) (<= 1 main_~t~0)) [2020-07-08 17:39:15,552 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-08 17:39:15,553 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-08 17:39:15,553 INFO L264 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0) [2020-07-08 17:39:15,553 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,553 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-08 17:39:15,553 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-08 17:39:15,553 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-07-08 17:39:15,553 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,553 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,554 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-08 17:39:15,554 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (<= 1 main_~tagbuf_len~0) [2020-07-08 17:39:15,554 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,554 INFO L264 CegarLoopResult]: At program point L43-1(lines 43 57) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,554 INFO L264 CegarLoopResult]: At program point L43-2(line 43) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,554 INFO L264 CegarLoopResult]: At program point L43-3(line 43) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,554 INFO L264 CegarLoopResult]: At program point L43-4(lines 43 57) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-07-08 17:39:15,554 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-08 17:39:15,555 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 17:39:15,555 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 17:39:15,555 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 17:39:15,555 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 17:39:15,555 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 17:39:15,555 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 17:39:15,559 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 17:39:15,560 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 17:39:15,560 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 17:39:15,561 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 17:39:15,561 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 17:39:15,605 INFO L163 areAnnotationChecker]: CFG has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 17:39:15,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 05:39:15 BoogieIcfgContainer [2020-07-08 17:39:15,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 17:39:15,627 INFO L168 Benchmark]: Toolchain (without parser) took 58426.92 ms. Allocated memory was 144.7 MB in the beginning and 511.7 MB in the end (delta: 367.0 MB). Free memory was 102.8 MB in the beginning and 308.8 MB in the end (delta: -206.0 MB). Peak memory consumption was 161.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:15,627 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 144.7 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 17:39:15,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.40 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 92.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:15,628 INFO L168 Benchmark]: Boogie Preprocessor took 144.62 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 180.4 MB in the end (delta: -88.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:15,631 INFO L168 Benchmark]: RCFGBuilder took 650.28 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 146.3 MB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:15,632 INFO L168 Benchmark]: TraceAbstraction took 57334.38 ms. Allocated memory was 201.9 MB in the beginning and 511.7 MB in the end (delta: 309.9 MB). Free memory was 146.3 MB in the beginning and 308.8 MB in the end (delta: -162.4 MB). Peak memory consumption was 147.4 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:15,633 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 144.7 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.40 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 92.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.62 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 180.4 MB in the end (delta: -88.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 650.28 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 146.3 MB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57334.38 ms. Allocated memory was 201.9 MB in the beginning and 511.7 MB in the end (delta: 309.9 MB). Free memory was 146.3 MB in the beginning and 308.8 MB in the end (delta: -162.4 MB). Peak memory consumption was 147.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 0 <= t - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 1 <= t - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 54.8s, OverallIterations: 25, TraceHistogramMax: 10, AutomataDifference: 33.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2053 SDtfs, 871 SDslu, 10785 SDs, 0 SdLazy, 3907 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 350 SyntacticMatches, 35 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 193 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 494 PreInvPairs, 814 NumberOfFragments, 537 HoareAnnotationTreeSize, 494 FomulaSimplifications, 529911 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 74 FomulaSimplificationsInter, 1449 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...