./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 595902ef9b99aff9bcc31a52a77391ef5dbaa4b7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:30:22,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:30:22,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:30:22,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:30:22,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:30:22,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:30:22,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:30:22,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:30:22,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:30:22,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:30:22,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:30:22,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:30:22,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:30:22,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:30:22,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:30:22,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:30:22,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:30:22,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:30:22,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:30:22,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:30:22,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:30:22,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:30:22,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:30:22,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:30:22,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:30:22,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:30:22,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:30:22,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:30:22,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:30:22,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:30:22,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:30:22,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:30:22,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:30:22,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:30:22,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:30:22,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:30:22,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:30:22,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:30:22,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:30:22,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:30:22,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:30:22,919 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:30:22,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:30:22,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:30:22,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:30:22,944 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:30:22,945 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:30:22,945 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:30:22,945 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:30:22,945 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:30:22,945 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:30:22,945 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:30:22,946 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:30:22,946 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:30:22,946 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:30:22,946 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:30:22,946 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:30:22,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:30:22,947 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:30:22,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:30:22,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:30:22,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:30:22,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:30:22,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:30:22,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:30:22,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:30:22,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:30:22,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:30:22,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:30:22,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:30:22,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:30:22,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:30:22,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:30:22,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:30:22,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:30:22,960 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:30:22,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:30:22,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:30:22,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:30:22,961 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 595902ef9b99aff9bcc31a52a77391ef5dbaa4b7 [2019-11-26 02:30:23,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:30:23,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:30:23,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:30:23,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:30:23,153 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:30:23,153 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-11-26 02:30:23,214 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/data/5d1d196a9/a4b2bb5b5c674e03aafc07510672d813/FLAG0a8f9a639 [2019-11-26 02:30:23,713 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:30:23,714 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-11-26 02:30:23,730 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/data/5d1d196a9/a4b2bb5b5c674e03aafc07510672d813/FLAG0a8f9a639 [2019-11-26 02:30:24,015 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/data/5d1d196a9/a4b2bb5b5c674e03aafc07510672d813 [2019-11-26 02:30:24,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:30:24,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:30:24,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:30:24,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:30:24,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:30:24,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:24,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d49a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24, skipping insertion in model container [2019-11-26 02:30:24,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:24,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:30:24,110 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:30:24,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:30:24,695 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:30:24,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:30:24,932 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:30:24,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24 WrapperNode [2019-11-26 02:30:24,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:30:24,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:30:24,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:30:24,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:30:24,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:24,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:25,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:30:25,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:30:25,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:30:25,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:30:25,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:25,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:25,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:25,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:25,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:25,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:25,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... [2019-11-26 02:30:25,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:30:25,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:30:25,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:30:25,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:30:25,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/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 [2019-11-26 02:30:25,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:30:25,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:30:26,847 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:30:26,847 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-26 02:30:26,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:30:26 BoogieIcfgContainer [2019-11-26 02:30:26,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:30:26,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:30:26,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:30:26,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:30:26,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:30:24" (1/3) ... [2019-11-26 02:30:26,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdfdd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:30:26, skipping insertion in model container [2019-11-26 02:30:26,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:30:24" (2/3) ... [2019-11-26 02:30:26,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdfdd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:30:26, skipping insertion in model container [2019-11-26 02:30:26,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:30:26" (3/3) ... [2019-11-26 02:30:26,858 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2019-11-26 02:30:26,866 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:30:26,872 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-26 02:30:26,882 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-26 02:30:26,907 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:30:26,907 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:30:26,907 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:30:26,907 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:30:26,907 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:30:26,908 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:30:26,908 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:30:26,908 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:30:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-26 02:30:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 02:30:26,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:26,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 02:30:26,942 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1144680186, now seen corresponding path program 1 times [2019-11-26 02:30:26,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:26,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779293596] [2019-11-26 02:30:26,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:27,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779293596] [2019-11-26 02:30:27,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:27,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:30:27,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790493653] [2019-11-26 02:30:27,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:30:27,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:27,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:30:27,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:30:27,134 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-26 02:30:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:27,995 INFO L93 Difference]: Finished difference Result 310 states and 568 transitions. [2019-11-26 02:30:27,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:30:27,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-26 02:30:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:28,013 INFO L225 Difference]: With dead ends: 310 [2019-11-26 02:30:28,013 INFO L226 Difference]: Without dead ends: 297 [2019-11-26 02:30:28,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-26 02:30:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-11-26 02:30:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-26 02:30:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 420 transitions. [2019-11-26 02:30:28,087 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 420 transitions. Word has length 6 [2019-11-26 02:30:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:28,088 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 420 transitions. [2019-11-26 02:30:28,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:30:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 420 transitions. [2019-11-26 02:30:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:30:28,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:28,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:28,089 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:28,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1125351449, now seen corresponding path program 1 times [2019-11-26 02:30:28,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:28,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825290491] [2019-11-26 02:30:28,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:28,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825290491] [2019-11-26 02:30:28,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:28,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:30:28,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075212479] [2019-11-26 02:30:28,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:30:28,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:28,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:30:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:30:28,135 INFO L87 Difference]: Start difference. First operand 297 states and 420 transitions. Second operand 4 states. [2019-11-26 02:30:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:28,546 INFO L93 Difference]: Finished difference Result 304 states and 427 transitions. [2019-11-26 02:30:28,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:30:28,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 02:30:28,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:28,549 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:30:28,549 INFO L226 Difference]: Without dead ends: 299 [2019-11-26 02:30:28,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-26 02:30:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 292. [2019-11-26 02:30:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-26 02:30:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2019-11-26 02:30:28,564 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 7 [2019-11-26 02:30:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:28,564 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2019-11-26 02:30:28,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:30:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2019-11-26 02:30:28,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:30:28,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:28,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:28,566 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:28,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1144463368, now seen corresponding path program 1 times [2019-11-26 02:30:28,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:28,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485721176] [2019-11-26 02:30:28,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:28,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485721176] [2019-11-26 02:30:28,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:28,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:30:28,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515521956] [2019-11-26 02:30:28,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:30:28,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:28,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:30:28,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:30:28,602 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand 4 states. [2019-11-26 02:30:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:29,105 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2019-11-26 02:30:29,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:30:29,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 02:30:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:29,109 INFO L225 Difference]: With dead ends: 292 [2019-11-26 02:30:29,109 INFO L226 Difference]: Without dead ends: 290 [2019-11-26 02:30:29,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-26 02:30:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2019-11-26 02:30:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-26 02:30:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 353 transitions. [2019-11-26 02:30:29,126 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 353 transitions. Word has length 7 [2019-11-26 02:30:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:29,126 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 353 transitions. [2019-11-26 02:30:29,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:30:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 353 transitions. [2019-11-26 02:30:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:30:29,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:29,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:29,127 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:29,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1118630114, now seen corresponding path program 1 times [2019-11-26 02:30:29,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:29,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355265405] [2019-11-26 02:30:29,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:29,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355265405] [2019-11-26 02:30:29,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:29,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:30:29,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929212398] [2019-11-26 02:30:29,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:30:29,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:29,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:30:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:30:29,217 INFO L87 Difference]: Start difference. First operand 290 states and 353 transitions. Second operand 4 states. [2019-11-26 02:30:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:29,573 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2019-11-26 02:30:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:30:29,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-26 02:30:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:29,576 INFO L225 Difference]: With dead ends: 295 [2019-11-26 02:30:29,576 INFO L226 Difference]: Without dead ends: 293 [2019-11-26 02:30:29,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-26 02:30:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-11-26 02:30:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-26 02:30:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 356 transitions. [2019-11-26 02:30:29,586 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 356 transitions. Word has length 8 [2019-11-26 02:30:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:29,586 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 356 transitions. [2019-11-26 02:30:29,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:30:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 356 transitions. [2019-11-26 02:30:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:30:29,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:29,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:29,587 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:29,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:29,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1261843174, now seen corresponding path program 1 times [2019-11-26 02:30:29,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:29,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003170684] [2019-11-26 02:30:29,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:29,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003170684] [2019-11-26 02:30:29,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:29,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:30:29,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527281295] [2019-11-26 02:30:29,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:30:29,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:30:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:29,632 INFO L87 Difference]: Start difference. First operand 293 states and 356 transitions. Second operand 5 states. [2019-11-26 02:30:30,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:30,171 INFO L93 Difference]: Finished difference Result 293 states and 356 transitions. [2019-11-26 02:30:30,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:30:30,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-26 02:30:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:30,174 INFO L225 Difference]: With dead ends: 293 [2019-11-26 02:30:30,174 INFO L226 Difference]: Without dead ends: 291 [2019-11-26 02:30:30,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:30:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-26 02:30:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-11-26 02:30:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-26 02:30:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2019-11-26 02:30:30,183 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 10 [2019-11-26 02:30:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:30,183 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2019-11-26 02:30:30,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:30:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2019-11-26 02:30:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:30:30,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:30,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:30,185 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:30,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash 462436822, now seen corresponding path program 1 times [2019-11-26 02:30:30,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:30,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849044194] [2019-11-26 02:30:30,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:30,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849044194] [2019-11-26 02:30:30,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:30,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:30:30,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518015147] [2019-11-26 02:30:30,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:30:30,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:30:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:30:30,230 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand 4 states. [2019-11-26 02:30:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:30,601 INFO L93 Difference]: Finished difference Result 291 states and 354 transitions. [2019-11-26 02:30:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:30:30,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-26 02:30:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:30,604 INFO L225 Difference]: With dead ends: 291 [2019-11-26 02:30:30,604 INFO L226 Difference]: Without dead ends: 287 [2019-11-26 02:30:30,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:30,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-26 02:30:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-26 02:30:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 02:30:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2019-11-26 02:30:30,621 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 11 [2019-11-26 02:30:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:30,623 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2019-11-26 02:30:30,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:30:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2019-11-26 02:30:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:30:30,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:30,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:30,624 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash -959031714, now seen corresponding path program 1 times [2019-11-26 02:30:30,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:30,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33875823] [2019-11-26 02:30:30,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:30,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33875823] [2019-11-26 02:30:30,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:30,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:30:30,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277634407] [2019-11-26 02:30:30,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:30:30,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:30,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:30:30,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:30,745 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand 5 states. [2019-11-26 02:30:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:31,391 INFO L93 Difference]: Finished difference Result 287 states and 350 transitions. [2019-11-26 02:30:31,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:30:31,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-26 02:30:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:31,393 INFO L225 Difference]: With dead ends: 287 [2019-11-26 02:30:31,393 INFO L226 Difference]: Without dead ends: 285 [2019-11-26 02:30:31,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:30:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-26 02:30:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-11-26 02:30:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-26 02:30:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 345 transitions. [2019-11-26 02:30:31,402 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 345 transitions. Word has length 12 [2019-11-26 02:30:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:31,402 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 345 transitions. [2019-11-26 02:30:31,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:30:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 345 transitions. [2019-11-26 02:30:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:30:31,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:31,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:31,404 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1465785465, now seen corresponding path program 1 times [2019-11-26 02:30:31,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:31,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427898700] [2019-11-26 02:30:31,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:31,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427898700] [2019-11-26 02:30:31,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:31,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:30:31,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068478890] [2019-11-26 02:30:31,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:30:31,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:31,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:30:31,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:31,449 INFO L87 Difference]: Start difference. First operand 282 states and 345 transitions. Second operand 5 states. [2019-11-26 02:30:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:31,967 INFO L93 Difference]: Finished difference Result 302 states and 367 transitions. [2019-11-26 02:30:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:30:31,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-26 02:30:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:31,970 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:30:31,970 INFO L226 Difference]: Without dead ends: 300 [2019-11-26 02:30:31,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:30:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-26 02:30:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 280. [2019-11-26 02:30:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-26 02:30:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 343 transitions. [2019-11-26 02:30:31,978 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 343 transitions. Word has length 12 [2019-11-26 02:30:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:31,978 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 343 transitions. [2019-11-26 02:30:31,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:30:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 343 transitions. [2019-11-26 02:30:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:30:31,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:31,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:31,980 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1467509369, now seen corresponding path program 1 times [2019-11-26 02:30:31,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:31,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726274708] [2019-11-26 02:30:31,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:32,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726274708] [2019-11-26 02:30:32,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:32,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:30:32,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129131997] [2019-11-26 02:30:32,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:30:32,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:30:32,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:32,067 INFO L87 Difference]: Start difference. First operand 280 states and 343 transitions. Second operand 5 states. [2019-11-26 02:30:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:32,563 INFO L93 Difference]: Finished difference Result 283 states and 346 transitions. [2019-11-26 02:30:32,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:30:32,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-26 02:30:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:32,565 INFO L225 Difference]: With dead ends: 283 [2019-11-26 02:30:32,566 INFO L226 Difference]: Without dead ends: 281 [2019-11-26 02:30:32,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:30:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-26 02:30:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2019-11-26 02:30:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-26 02:30:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 341 transitions. [2019-11-26 02:30:32,573 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 341 transitions. Word has length 12 [2019-11-26 02:30:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:32,573 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 341 transitions. [2019-11-26 02:30:32,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:30:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 341 transitions. [2019-11-26 02:30:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:30:32,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:32,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:32,574 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:32,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1805286727, now seen corresponding path program 1 times [2019-11-26 02:30:32,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:32,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281727644] [2019-11-26 02:30:32,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:32,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281727644] [2019-11-26 02:30:32,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:32,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:30:32,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079906817] [2019-11-26 02:30:32,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:30:32,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:32,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:30:32,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:32,626 INFO L87 Difference]: Start difference. First operand 278 states and 341 transitions. Second operand 5 states. [2019-11-26 02:30:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:33,191 INFO L93 Difference]: Finished difference Result 294 states and 359 transitions. [2019-11-26 02:30:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:30:33,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-26 02:30:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:33,195 INFO L225 Difference]: With dead ends: 294 [2019-11-26 02:30:33,195 INFO L226 Difference]: Without dead ends: 292 [2019-11-26 02:30:33,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:30:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-26 02:30:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 276. [2019-11-26 02:30:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-26 02:30:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 339 transitions. [2019-11-26 02:30:33,207 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 339 transitions. Word has length 13 [2019-11-26 02:30:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:33,207 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 339 transitions. [2019-11-26 02:30:33,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:30:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 339 transitions. [2019-11-26 02:30:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:30:33,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:33,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:33,208 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:33,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1803739582, now seen corresponding path program 1 times [2019-11-26 02:30:33,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:33,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187195838] [2019-11-26 02:30:33,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:33,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187195838] [2019-11-26 02:30:33,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:33,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:30:33,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738808906] [2019-11-26 02:30:33,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:30:33,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:33,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:30:33,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:33,248 INFO L87 Difference]: Start difference. First operand 276 states and 339 transitions. Second operand 5 states. [2019-11-26 02:30:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:33,751 INFO L93 Difference]: Finished difference Result 297 states and 362 transitions. [2019-11-26 02:30:33,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:30:33,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-26 02:30:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:33,758 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:30:33,758 INFO L226 Difference]: Without dead ends: 295 [2019-11-26 02:30:33,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:30:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-26 02:30:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 274. [2019-11-26 02:30:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-26 02:30:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 337 transitions. [2019-11-26 02:30:33,766 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 337 transitions. Word has length 13 [2019-11-26 02:30:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:33,766 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 337 transitions. [2019-11-26 02:30:33,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:30:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 337 transitions. [2019-11-26 02:30:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:30:33,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:33,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:33,768 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1751845647, now seen corresponding path program 1 times [2019-11-26 02:30:33,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:33,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608072099] [2019-11-26 02:30:33,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:33,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608072099] [2019-11-26 02:30:33,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:33,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:30:33,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724487212] [2019-11-26 02:30:33,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:30:33,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:33,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:30:33,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:30:33,847 INFO L87 Difference]: Start difference. First operand 274 states and 337 transitions. Second operand 6 states. [2019-11-26 02:30:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:34,497 INFO L93 Difference]: Finished difference Result 274 states and 337 transitions. [2019-11-26 02:30:34,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:30:34,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-26 02:30:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:34,499 INFO L225 Difference]: With dead ends: 274 [2019-11-26 02:30:34,499 INFO L226 Difference]: Without dead ends: 270 [2019-11-26 02:30:34,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:30:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-26 02:30:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-11-26 02:30:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-26 02:30:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 333 transitions. [2019-11-26 02:30:34,508 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 333 transitions. Word has length 13 [2019-11-26 02:30:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:34,508 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 333 transitions. [2019-11-26 02:30:34,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:30:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 333 transitions. [2019-11-26 02:30:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 02:30:34,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:34,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:34,510 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash -81348045, now seen corresponding path program 1 times [2019-11-26 02:30:34,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:34,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726938061] [2019-11-26 02:30:34,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:34,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726938061] [2019-11-26 02:30:34,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:34,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:30:34,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250515800] [2019-11-26 02:30:34,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:30:34,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:30:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:30:34,602 INFO L87 Difference]: Start difference. First operand 270 states and 333 transitions. Second operand 6 states. [2019-11-26 02:30:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:35,247 INFO L93 Difference]: Finished difference Result 285 states and 350 transitions. [2019-11-26 02:30:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:30:35,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-26 02:30:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:35,249 INFO L225 Difference]: With dead ends: 285 [2019-11-26 02:30:35,249 INFO L226 Difference]: Without dead ends: 283 [2019-11-26 02:30:35,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:30:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-26 02:30:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2019-11-26 02:30:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-26 02:30:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 331 transitions. [2019-11-26 02:30:35,256 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 331 transitions. Word has length 14 [2019-11-26 02:30:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:35,258 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 331 transitions. [2019-11-26 02:30:35,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:30:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 331 transitions. [2019-11-26 02:30:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:30:35,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:35,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:35,260 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash 286370844, now seen corresponding path program 1 times [2019-11-26 02:30:35,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:35,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001387797] [2019-11-26 02:30:35,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:35,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001387797] [2019-11-26 02:30:35,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:35,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:30:35,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247981446] [2019-11-26 02:30:35,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:30:35,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:35,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:30:35,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:30:35,317 INFO L87 Difference]: Start difference. First operand 268 states and 331 transitions. Second operand 6 states. [2019-11-26 02:30:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:35,912 INFO L93 Difference]: Finished difference Result 283 states and 348 transitions. [2019-11-26 02:30:35,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:30:35,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-26 02:30:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:35,914 INFO L225 Difference]: With dead ends: 283 [2019-11-26 02:30:35,914 INFO L226 Difference]: Without dead ends: 281 [2019-11-26 02:30:35,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:30:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-26 02:30:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 266. [2019-11-26 02:30:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-26 02:30:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 329 transitions. [2019-11-26 02:30:35,922 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 329 transitions. Word has length 15 [2019-11-26 02:30:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:35,922 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 329 transitions. [2019-11-26 02:30:35,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:30:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 329 transitions. [2019-11-26 02:30:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:30:35,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:35,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:35,923 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash 287565703, now seen corresponding path program 1 times [2019-11-26 02:30:35,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:35,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967279216] [2019-11-26 02:30:35,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:35,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967279216] [2019-11-26 02:30:35,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:35,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:30:35,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255067711] [2019-11-26 02:30:35,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:30:35,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:35,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:30:35,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:30:35,949 INFO L87 Difference]: Start difference. First operand 266 states and 329 transitions. Second operand 4 states. [2019-11-26 02:30:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:36,263 INFO L93 Difference]: Finished difference Result 269 states and 332 transitions. [2019-11-26 02:30:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:30:36,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-26 02:30:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:36,265 INFO L225 Difference]: With dead ends: 269 [2019-11-26 02:30:36,265 INFO L226 Difference]: Without dead ends: 249 [2019-11-26 02:30:36,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-26 02:30:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-11-26 02:30:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-26 02:30:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-11-26 02:30:36,271 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 16 [2019-11-26 02:30:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:36,271 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-11-26 02:30:36,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:30:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-11-26 02:30:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-26 02:30:36,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:36,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:36,278 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:36,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1536774122, now seen corresponding path program 1 times [2019-11-26 02:30:36,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:36,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203111255] [2019-11-26 02:30:36,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:38,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203111255] [2019-11-26 02:30:38,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:38,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2019-11-26 02:30:38,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815524992] [2019-11-26 02:30:38,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-11-26 02:30:38,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:38,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-11-26 02:30:38,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-11-26 02:30:38,436 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 64 states. [2019-11-26 02:30:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:39,493 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-11-26 02:30:39,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-26 02:30:39,494 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 243 [2019-11-26 02:30:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:39,496 INFO L225 Difference]: With dead ends: 250 [2019-11-26 02:30:39,496 INFO L226 Difference]: Without dead ends: 248 [2019-11-26 02:30:39,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2019-11-26 02:30:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-26 02:30:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-11-26 02:30:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-26 02:30:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-11-26 02:30:39,504 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-11-26 02:30:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:39,504 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-11-26 02:30:39,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-11-26 02:30:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-11-26 02:30:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-26 02:30:39,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:39,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:30:39,509 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash -395352156, now seen corresponding path program 1 times [2019-11-26 02:30:39,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:39,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847951435] [2019-11-26 02:30:39,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:30:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:30:40,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847951435] [2019-11-26 02:30:40,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:30:40,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:30:40,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857367479] [2019-11-26 02:30:40,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:30:40,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:40,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:30:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:30:40,564 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 5 states. [2019-11-26 02:30:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:40,914 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-11-26 02:30:40,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:30:40,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-11-26 02:30:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:40,915 INFO L225 Difference]: With dead ends: 249 [2019-11-26 02:30:40,915 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:30:40,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 62 SyntacticMatches, 117 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:30:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:30:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:30:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:30:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:30:40,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2019-11-26 02:30:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:40,917 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:30:40,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:30:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:30:40,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:30:40,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:30:41,129 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-11-26 02:30:41,129 INFO L444 ceAbstractionStarter]: For program point L1753(lines 1753 2769) no Hoare annotation was computed. [2019-11-26 02:30:41,129 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 2942) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L447 ceAbstractionStarter]: At program point L2612(lines 11 3003) the Hoare annotation is: true [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L564(lines 564 2952) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L2018(lines 2018 2728) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 2901) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L1160(lines 1160 2860) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L2151(lines 2151 2708) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L2085(lines 2085 2718) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L2416(lines 2416 2667) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 2992) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L1293(lines 1293 2840) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L1227(lines 1227 2850) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L1558(lines 1558 2799) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L435(lines 435 2972) no Hoare annotation was computed. [2019-11-26 02:30:41,130 INFO L444 ceAbstractionStarter]: For program point L369(lines 369 2982) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L1823(lines 1823 2758) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 2931) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 50) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L965(lines 965 2890) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L1956(lines 1956 2738) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L1890(lines 1890 2748) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L2221(lines 2221 2697) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 2870) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L1032(lines 1032 2880) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L2618(lines 2618 2637) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L2486(lines 2486 2656) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L1363(lines 1363 2829) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L1628(lines 1628 2788) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L505(lines 505 2961) no Hoare annotation was computed. [2019-11-26 02:30:41,131 INFO L444 ceAbstractionStarter]: For program point L2553(lines 2553 2646) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 276) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L770(lines 770 2920) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L1761(lines 1761 2768) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L1695(lines 1695 2778) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L440 ceAbstractionStarter]: At program point L2620(lines 20 2997) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L2026(lines 2026 2727) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 2900) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 2910) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L2291(lines 2291 2686) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 2859) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L1433(lines 1433 2818) no Hoare annotation was computed. [2019-11-26 02:30:41,132 INFO L444 ceAbstractionStarter]: For program point L2424(lines 2424 2666) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L2358(lines 2358 2676) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 2991) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2599) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 2950) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 2798) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L1500(lines 1500 2808) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L1831(lines 1831 2757) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L708(lines 708 2930) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 2940) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L2096(lines 2096 2716) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 2889) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L1238(lines 1238 2848) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L2229(lines 2229 2696) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L2163(lines 2163 2706) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L2626(lines 2626 2636) no Hoare annotation was computed. [2019-11-26 02:30:41,133 INFO L444 ceAbstractionStarter]: For program point L2494(lines 2494 2655) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 2980) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 2828) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 2838) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 270) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1636(lines 1636 2787) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 2960) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L447(lines 447 2970) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1901(lines 1901 2746) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L778(lines 778 2919) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1043(lines 1043 2878) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L2034(lines 2034 2726) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1968(lines 1968 2736) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L440 ceAbstractionStarter]: At program point L2629(lines 59 2996) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__t~0) (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L2299(lines 2299 2685) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1176(lines 1176 2858) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1110(lines 1110 2868) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L2564(lines 2564 2644) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1441(lines 1441 2817) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 2990) no Hoare annotation was computed. [2019-11-26 02:30:41,134 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 2776) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 2949) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 2908) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L1839(lines 1839 2756) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L1773(lines 1773 2766) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L2104(lines 2104 2715) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 2888) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 2898) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L2369(lines 2369 2674) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L1246(lines 1246 2847) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 2806) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L2502(lines 2502 2654) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L2436(lines 2436 2664) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 2979) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 2938) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L1644(lines 1644 2786) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L1578(lines 1578 2796) no Hoare annotation was computed. [2019-11-26 02:30:41,135 INFO L440 ceAbstractionStarter]: At program point L2635(lines 2586 2642) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 59 ULTIMATE.start_main_~main__t~0)) [2019-11-26 02:30:41,135 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 2996) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L1909(lines 1909 2745) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 2918) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L720(lines 720 2928) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L2174(lines 2174 2704) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L1051(lines 1051 2877) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L1316(lines 1316 2836) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L2307(lines 2307 2684) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L2241(lines 2241 2694) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 277) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L2572(lines 2572 2643) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 2968) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 2816) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L1383(lines 1383 2826) no Hoare annotation was computed. [2019-11-26 02:30:41,136 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 268) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L1714(lines 1714 2775) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 2948) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L525(lines 525 2958) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L1979(lines 1979 2734) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L856(lines 856 2907) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L1121(lines 1121 2866) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L2112(lines 2112 2714) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L2046(lines 2046 2724) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L2377(lines 2377 2673) no Hoare annotation was computed. [2019-11-26 02:30:41,137 INFO L444 ceAbstractionStarter]: For program point L1254(lines 1254 2846) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L1188(lines 1188 2856) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 235) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L1519(lines 1519 2805) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 2978) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 2988) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L1784(lines 1784 2764) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L661(lines 661 2937) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L926(lines 926 2896) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L1917(lines 1917 2744) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L1851(lines 1851 2754) no Hoare annotation was computed. [2019-11-26 02:30:41,138 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 224) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L2182(lines 2182 2703) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L1059(lines 1059 2876) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 2886) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L2447(lines 2447 2662) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L1324(lines 1324 2835) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 281) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 2794) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L2580(lines 2580 2642) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L2514(lines 2514 2652) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 2967) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 2926) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 2774) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L1656(lines 1656 2784) no Hoare annotation was computed. [2019-11-26 02:30:41,139 INFO L444 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L1987(lines 1987 2733) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L864(lines 864 2906) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L798(lines 798 2916) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L2252(lines 2252 2692) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 229) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L1129(lines 1129 2865) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 2824) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L2385(lines 2385 2672) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L2319(lines 2319 2682) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 2956) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L1527(lines 1527 2804) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 2814) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L1792(lines 1792 2763) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L669(lines 669 2936) no Hoare annotation was computed. [2019-11-26 02:30:41,140 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 2946) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point L2057(lines 2057 2722) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point L934(lines 934 2895) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point L1199(lines 1199 2854) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point L2190(lines 2190 2702) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point L2124(lines 2124 2712) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point L2455(lines 2455 2661) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 2986) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point L1332(lines 1332 2834) no Hoare annotation was computed. [2019-11-26 02:30:41,141 INFO L440 ceAbstractionStarter]: At program point L275(lines 127 277) the Hoare annotation is: (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-11-26 02:30:41,141 INFO L444 ceAbstractionStarter]: For program point L1266(lines 1266 2844) no Hoare annotation was computed. [2019-11-26 02:30:41,142 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-11-26 02:30:41,142 INFO L444 ceAbstractionStarter]: For program point L1597(lines 1597 2793) no Hoare annotation was computed. [2019-11-26 02:30:41,142 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 2966) no Hoare annotation was computed. [2019-11-26 02:30:41,142 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 2976) no Hoare annotation was computed. [2019-11-26 02:30:41,142 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2611) no Hoare annotation was computed. [2019-11-26 02:30:41,142 INFO L444 ceAbstractionStarter]: For program point L1862(lines 1862 2752) no Hoare annotation was computed. [2019-11-26 02:30:41,142 INFO L444 ceAbstractionStarter]: For program point L739(lines 739 2925) no Hoare annotation was computed. [2019-11-26 02:30:41,142 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 2884) no Hoare annotation was computed. [2019-11-26 02:30:41,143 INFO L444 ceAbstractionStarter]: For program point L1995(lines 1995 2732) no Hoare annotation was computed. [2019-11-26 02:30:41,143 INFO L444 ceAbstractionStarter]: For program point L1929(lines 1929 2742) no Hoare annotation was computed. [2019-11-26 02:30:41,143 INFO L444 ceAbstractionStarter]: For program point L2260(lines 2260 2691) no Hoare annotation was computed. [2019-11-26 02:30:41,143 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 222) no Hoare annotation was computed. [2019-11-26 02:30:41,143 INFO L444 ceAbstractionStarter]: For program point L1137(lines 1137 2864) no Hoare annotation was computed. [2019-11-26 02:30:41,143 INFO L444 ceAbstractionStarter]: For program point L1071(lines 1071 2874) no Hoare annotation was computed. [2019-11-26 02:30:41,143 INFO L444 ceAbstractionStarter]: For program point L2525(lines 2525 2650) no Hoare annotation was computed. [2019-11-26 02:30:41,143 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 2823) no Hoare annotation was computed. [2019-11-26 02:30:41,144 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 279) no Hoare annotation was computed. [2019-11-26 02:30:41,144 INFO L444 ceAbstractionStarter]: For program point L1667(lines 1667 2782) no Hoare annotation was computed. [2019-11-26 02:30:41,144 INFO L444 ceAbstractionStarter]: For program point L544(lines 544 2955) no Hoare annotation was computed. [2019-11-26 02:30:41,144 INFO L444 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-11-26 02:30:41,144 INFO L444 ceAbstractionStarter]: For program point L16(lines 16 3002) no Hoare annotation was computed. [2019-11-26 02:30:41,144 INFO L444 ceAbstractionStarter]: For program point L809(lines 809 2914) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L1800(lines 1800 2762) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L1734(lines 1734 2772) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L2065(lines 2065 2721) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 2894) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 2904) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L2330(lines 2330 2680) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L1207(lines 1207 2853) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 227) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L1472(lines 1472 2812) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L2463(lines 2463 2660) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 2985) no Hoare annotation was computed. [2019-11-26 02:30:41,145 INFO L444 ceAbstractionStarter]: For program point L2397(lines 2397 2670) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 2944) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L1605(lines 1605 2792) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L1539(lines 1539 2802) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L20(lines 20 2997) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L1870(lines 1870 2751) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 2924) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 2934) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L2597(lines 2597 2640) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L2135(lines 2135 2710) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 2883) no Hoare annotation was computed. [2019-11-26 02:30:41,146 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-26 02:30:41,147 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 2842) no Hoare annotation was computed. [2019-11-26 02:30:41,147 INFO L444 ceAbstractionStarter]: For program point L2268(lines 2268 2690) no Hoare annotation was computed. [2019-11-26 02:30:41,147 INFO L444 ceAbstractionStarter]: For program point L2202(lines 2202 2700) no Hoare annotation was computed. [2019-11-26 02:30:41,147 INFO L444 ceAbstractionStarter]: For program point L2599(line 2599) no Hoare annotation was computed. [2019-11-26 02:30:41,147 INFO L444 ceAbstractionStarter]: For program point L2533(lines 2533 2649) no Hoare annotation was computed. [2019-11-26 02:30:41,147 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 2974) no Hoare annotation was computed. [2019-11-26 02:30:41,147 INFO L444 ceAbstractionStarter]: For program point L1410(lines 1410 2822) no Hoare annotation was computed. [2019-11-26 02:30:41,147 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 2832) no Hoare annotation was computed. [2019-11-26 02:30:41,148 INFO L440 ceAbstractionStarter]: At program point L221(lines 87 279) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) [2019-11-26 02:30:41,148 INFO L444 ceAbstractionStarter]: For program point L1675(lines 1675 2781) no Hoare annotation was computed. [2019-11-26 02:30:41,148 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 2954) no Hoare annotation was computed. [2019-11-26 02:30:41,148 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 2964) no Hoare annotation was computed. [2019-11-26 02:30:41,148 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-11-26 02:30:41,148 INFO L444 ceAbstractionStarter]: For program point L1940(lines 1940 2740) no Hoare annotation was computed. [2019-11-26 02:30:41,148 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 2913) no Hoare annotation was computed. [2019-11-26 02:30:41,148 INFO L444 ceAbstractionStarter]: For program point L1082(lines 1082 2872) no Hoare annotation was computed. [2019-11-26 02:30:41,149 INFO L444 ceAbstractionStarter]: For program point L2073(lines 2073 2720) no Hoare annotation was computed. [2019-11-26 02:30:41,149 INFO L444 ceAbstractionStarter]: For program point L2007(lines 2007 2730) no Hoare annotation was computed. [2019-11-26 02:30:41,149 INFO L444 ceAbstractionStarter]: For program point L2338(lines 2338 2679) no Hoare annotation was computed. [2019-11-26 02:30:41,149 INFO L444 ceAbstractionStarter]: For program point L1215(lines 1215 2852) no Hoare annotation was computed. [2019-11-26 02:30:41,149 INFO L444 ceAbstractionStarter]: For program point L1149(lines 1149 2862) no Hoare annotation was computed. [2019-11-26 02:30:41,149 INFO L444 ceAbstractionStarter]: For program point L1480(lines 1480 2811) no Hoare annotation was computed. [2019-11-26 02:30:41,149 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 2984) no Hoare annotation was computed. [2019-11-26 02:30:41,149 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 2994) no Hoare annotation was computed. [2019-11-26 02:30:41,150 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 226) no Hoare annotation was computed. [2019-11-26 02:30:41,150 INFO L444 ceAbstractionStarter]: For program point L1745(lines 1745 2770) no Hoare annotation was computed. [2019-11-26 02:30:41,150 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 2943) no Hoare annotation was computed. [2019-11-26 02:30:41,150 INFO L444 ceAbstractionStarter]: For program point L28(lines 28 52) no Hoare annotation was computed. [2019-11-26 02:30:41,150 INFO L447 ceAbstractionStarter]: At program point L3001(lines 16 3002) the Hoare annotation is: true [2019-11-26 02:30:41,150 INFO L444 ceAbstractionStarter]: For program point L887(lines 887 2902) no Hoare annotation was computed. [2019-11-26 02:30:41,150 INFO L444 ceAbstractionStarter]: For program point L1878(lines 1878 2750) no Hoare annotation was computed. [2019-11-26 02:30:41,151 INFO L444 ceAbstractionStarter]: For program point L1812(lines 1812 2760) no Hoare annotation was computed. [2019-11-26 02:30:41,151 INFO L444 ceAbstractionStarter]: For program point L2143(lines 2143 2709) no Hoare annotation was computed. [2019-11-26 02:30:41,151 INFO L444 ceAbstractionStarter]: For program point L1020(lines 1020 2882) no Hoare annotation was computed. [2019-11-26 02:30:41,151 INFO L444 ceAbstractionStarter]: For program point L954(lines 954 2892) no Hoare annotation was computed. [2019-11-26 02:30:41,151 INFO L444 ceAbstractionStarter]: For program point L2408(lines 2408 2668) no Hoare annotation was computed. [2019-11-26 02:30:41,151 INFO L444 ceAbstractionStarter]: For program point L1285(lines 1285 2841) no Hoare annotation was computed. [2019-11-26 02:30:41,151 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-26 02:30:41,152 INFO L444 ceAbstractionStarter]: For program point L1550(lines 1550 2800) no Hoare annotation was computed. [2019-11-26 02:30:41,152 INFO L444 ceAbstractionStarter]: For program point L2541(lines 2541 2648) no Hoare annotation was computed. [2019-11-26 02:30:41,152 INFO L444 ceAbstractionStarter]: For program point L427(lines 427 2973) no Hoare annotation was computed. [2019-11-26 02:30:41,152 INFO L444 ceAbstractionStarter]: For program point L2475(lines 2475 2658) no Hoare annotation was computed. [2019-11-26 02:30:41,152 INFO L444 ceAbstractionStarter]: For program point L692(lines 692 2932) no Hoare annotation was computed. [2019-11-26 02:30:41,152 INFO L444 ceAbstractionStarter]: For program point L1683(lines 1683 2780) no Hoare annotation was computed. [2019-11-26 02:30:41,152 INFO L444 ceAbstractionStarter]: For program point L1617(lines 1617 2790) no Hoare annotation was computed. [2019-11-26 02:30:41,152 INFO L444 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-11-26 02:30:41,153 INFO L444 ceAbstractionStarter]: For program point L1948(lines 1948 2739) no Hoare annotation was computed. [2019-11-26 02:30:41,153 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 2912) no Hoare annotation was computed. [2019-11-26 02:30:41,153 INFO L444 ceAbstractionStarter]: For program point L759(lines 759 2922) no Hoare annotation was computed. [2019-11-26 02:30:41,153 INFO L444 ceAbstractionStarter]: For program point L2609(lines 2609 2638) no Hoare annotation was computed. [2019-11-26 02:30:41,153 INFO L444 ceAbstractionStarter]: For program point L2213(lines 2213 2698) no Hoare annotation was computed. [2019-11-26 02:30:41,153 INFO L444 ceAbstractionStarter]: For program point L1090(lines 1090 2871) no Hoare annotation was computed. [2019-11-26 02:30:41,153 INFO L444 ceAbstractionStarter]: For program point L1355(lines 1355 2830) no Hoare annotation was computed. [2019-11-26 02:30:41,153 INFO L444 ceAbstractionStarter]: For program point L2346(lines 2346 2678) no Hoare annotation was computed. [2019-11-26 02:30:41,154 INFO L444 ceAbstractionStarter]: For program point L2280(lines 2280 2688) no Hoare annotation was computed. [2019-11-26 02:30:41,154 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-11-26 02:30:41,154 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-26 02:30:41,154 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-11-26 02:30:41,154 INFO L444 ceAbstractionStarter]: For program point L2611(line 2611) no Hoare annotation was computed. [2019-11-26 02:30:41,154 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 2962) no Hoare annotation was computed. [2019-11-26 02:30:41,154 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 2810) no Hoare annotation was computed. [2019-11-26 02:30:41,155 INFO L444 ceAbstractionStarter]: For program point L1422(lines 1422 2820) no Hoare annotation was computed. [2019-11-26 02:30:41,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:30:41 BoogieIcfgContainer [2019-11-26 02:30:41,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:30:41,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:30:41,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:30:41,177 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:30:41,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:30:26" (3/4) ... [2019-11-26 02:30:41,180 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:30:41,209 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-26 02:30:41,212 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:30:41,420 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9ba9d9f0-432b-4ef2-8082-b025f5331c27/bin/utaipan/witness.graphml [2019-11-26 02:30:41,420 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:30:41,422 INFO L168 Benchmark]: Toolchain (without parser) took 17402.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.1 MB). Free memory was 946.1 MB in the beginning and 995.7 MB in the end (delta: -49.6 MB). Peak memory consumption was 340.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:41,423 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:30:41,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 912.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -123.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:41,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:41,424 INFO L168 Benchmark]: Boogie Preprocessor took 69.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:41,424 INFO L168 Benchmark]: RCFGBuilder took 1716.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 862.5 MB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:41,425 INFO L168 Benchmark]: TraceAbstraction took 14326.69 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 287.8 MB). Free memory was 862.5 MB in the beginning and 1.0 GB in the end (delta: -174.8 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:41,425 INFO L168 Benchmark]: Witness Printer took 244.18 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 995.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:41,427 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 912.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -123.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1716.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 862.5 MB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14326.69 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 287.8 MB). Free memory was 862.5 MB in the beginning and 1.0 GB in the end (delta: -174.8 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. * Witness Printer took 244.18 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 995.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2611]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 59 <= main__t - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && 1 <= main__t) && !(0 == __VERIFIER_assert__cond)) && main__t < main__tagbuf_len - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t < main__tagbuf_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 16 error locations. Result: SAFE, OverallTime: 14.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 2534 SDtfs, 11671 SDslu, 2725 SDs, 0 SdLazy, 8467 SolverSat, 3232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 107 SyntacticMatches, 120 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 53 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3571 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 816 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 656 NumberOfCodeBlocks, 656 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 357239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...