./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-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_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/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 d63a23585cedb87d2d2ae4c59168b108a64280e1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:01:32,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 03:01:32,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 03:01:32,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 03:01:32,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 03:01:32,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 03:01:32,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 03:01:32,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 03:01:32,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 03:01:32,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 03:01:32,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 03:01:32,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 03:01:32,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 03:01:32,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 03:01:32,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 03:01:32,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 03:01:32,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 03:01:32,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 03:01:32,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 03:01:32,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 03:01:32,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 03:01:32,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 03:01:32,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 03:01:32,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 03:01:32,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 03:01:32,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 03:01:32,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 03:01:32,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 03:01:32,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 03:01:32,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 03:01:32,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 03:01:32,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 03:01:32,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 03:01:32,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 03:01:32,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 03:01:32,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 03:01:32,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 03:01:32,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 03:01:32,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 03:01:32,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 03:01:32,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 03:01:32,160 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 03:01:32,184 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 03:01:32,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 03:01:32,186 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 03:01:32,186 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 03:01:32,186 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 03:01:32,186 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 03:01:32,187 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 03:01:32,187 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 03:01:32,187 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 03:01:32,187 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 03:01:32,188 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 03:01:32,188 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 03:01:32,189 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 03:01:32,189 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 03:01:32,189 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 03:01:32,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 03:01:32,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 03:01:32,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 03:01:32,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 03:01:32,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 03:01:32,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 03:01:32,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 03:01:32,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 03:01:32,191 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 03:01:32,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 03:01:32,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 03:01:32,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 03:01:32,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 03:01:32,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 03:01:32,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 03:01:32,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 03:01:32,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 03:01:32,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 03:01:32,193 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 03:01:32,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 03:01:32,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 03:01:32,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 03:01:32,194 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_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/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 -> d63a23585cedb87d2d2ae4c59168b108a64280e1 [2019-11-26 03:01:32,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 03:01:32,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 03:01:32,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 03:01:32,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 03:01:32,376 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 03:01:32,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-11-26 03:01:32,432 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/data/837e9e7f3/0f652d577c354b06bdb535d104b0a2d6/FLAG64c2452e5 [2019-11-26 03:01:32,802 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 03:01:32,803 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-11-26 03:01:32,815 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/data/837e9e7f3/0f652d577c354b06bdb535d104b0a2d6/FLAG64c2452e5 [2019-11-26 03:01:33,268 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/data/837e9e7f3/0f652d577c354b06bdb535d104b0a2d6 [2019-11-26 03:01:33,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 03:01:33,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 03:01:33,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 03:01:33,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 03:01:33,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 03:01:33,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299fdc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33, skipping insertion in model container [2019-11-26 03:01:33,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 03:01:33,353 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 03:01:33,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:01:33,654 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 03:01:33,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:01:33,743 INFO L205 MainTranslator]: Completed translation [2019-11-26 03:01:33,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33 WrapperNode [2019-11-26 03:01:33,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 03:01:33,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 03:01:33,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 03:01:33,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 03:01:33,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 03:01:33,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 03:01:33,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 03:01:33,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 03:01:33,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... [2019-11-26 03:01:33,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 03:01:33,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 03:01:33,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 03:01:33,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 03:01:33,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/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 03:01:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 03:01:33,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 03:01:34,691 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 03:01:34,691 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-26 03:01:34,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:01:34 BoogieIcfgContainer [2019-11-26 03:01:34,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 03:01:34,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 03:01:34,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 03:01:34,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 03:01:34,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 03:01:33" (1/3) ... [2019-11-26 03:01:34,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3cd0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:01:34, skipping insertion in model container [2019-11-26 03:01:34,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:01:33" (2/3) ... [2019-11-26 03:01:34,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3cd0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:01:34, skipping insertion in model container [2019-11-26 03:01:34,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:01:34" (3/3) ... [2019-11-26 03:01:34,700 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-11-26 03:01:34,708 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 03:01:34,714 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-26 03:01:34,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-26 03:01:34,748 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 03:01:34,749 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 03:01:34,749 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 03:01:34,749 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 03:01:34,749 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 03:01:34,749 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 03:01:34,749 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 03:01:34,750 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 03:01:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2019-11-26 03:01:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 03:01:34,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:34,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 03:01:34,776 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 03:01:34,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash 547035891, now seen corresponding path program 1 times [2019-11-26 03:01:34,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:34,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809962836] [2019-11-26 03:01:34,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:34,938 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 03:01:34,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809962836] [2019-11-26 03:01:34,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:34,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:01:34,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968653987] [2019-11-26 03:01:34,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:34,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:34,957 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 4 states. [2019-11-26 03:01:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:35,265 INFO L93 Difference]: Finished difference Result 126 states and 200 transitions. [2019-11-26 03:01:35,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:01:35,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-26 03:01:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:35,281 INFO L225 Difference]: With dead ends: 126 [2019-11-26 03:01:35,282 INFO L226 Difference]: Without dead ends: 113 [2019-11-26 03:01:35,286 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 03:01:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-26 03:01:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-26 03:01:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-26 03:01:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2019-11-26 03:01:35,348 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 6 [2019-11-26 03:01:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:35,349 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2019-11-26 03:01:35,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2019-11-26 03:01:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 03:01:35,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:35,350 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:35,350 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 03:01:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash -221752512, now seen corresponding path program 1 times [2019-11-26 03:01:35,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:35,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089071135] [2019-11-26 03:01:35,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:35,400 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 03:01:35,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089071135] [2019-11-26 03:01:35,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:35,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:01:35,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330850233] [2019-11-26 03:01:35,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:35,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:35,403 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 4 states. [2019-11-26 03:01:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:35,574 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-11-26 03:01:35,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:01:35,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 03:01:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:35,576 INFO L225 Difference]: With dead ends: 113 [2019-11-26 03:01:35,576 INFO L226 Difference]: Without dead ends: 108 [2019-11-26 03:01:35,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 03:01:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-26 03:01:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-26 03:01:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-26 03:01:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2019-11-26 03:01:35,590 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 7 [2019-11-26 03:01:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:35,591 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2019-11-26 03:01:35,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2019-11-26 03:01:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 03:01:35,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:35,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:35,593 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 03:01:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1948841692, now seen corresponding path program 1 times [2019-11-26 03:01:35,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:35,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751510401] [2019-11-26 03:01:35,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:35,634 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 03:01:35,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751510401] [2019-11-26 03:01:35,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:35,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:35,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671865203] [2019-11-26 03:01:35,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:35,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:35,636 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 5 states. [2019-11-26 03:01:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:35,903 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-11-26 03:01:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:35,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-26 03:01:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:35,905 INFO L225 Difference]: With dead ends: 108 [2019-11-26 03:01:35,905 INFO L226 Difference]: Without dead ends: 106 [2019-11-26 03:01:35,905 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 03:01:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-26 03:01:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-26 03:01:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-26 03:01:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2019-11-26 03:01:35,922 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 10 [2019-11-26 03:01:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:35,923 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2019-11-26 03:01:35,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2019-11-26 03:01:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 03:01:35,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:35,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:35,925 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 03:01:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:35,925 INFO L82 PathProgramCache]: Analyzing trace with hash 284554395, now seen corresponding path program 1 times [2019-11-26 03:01:35,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:35,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505816965] [2019-11-26 03:01:35,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:35,989 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 03:01:35,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505816965] [2019-11-26 03:01:35,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:35,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:01:35,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062702718] [2019-11-26 03:01:35,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:35,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:35,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:35,991 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 4 states. [2019-11-26 03:01:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:36,141 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2019-11-26 03:01:36,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:01:36,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-26 03:01:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:36,143 INFO L225 Difference]: With dead ends: 106 [2019-11-26 03:01:36,143 INFO L226 Difference]: Without dead ends: 102 [2019-11-26 03:01:36,144 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 03:01:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-26 03:01:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-26 03:01:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-26 03:01:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-11-26 03:01:36,151 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 11 [2019-11-26 03:01:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:36,152 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-11-26 03:01:36,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-11-26 03:01:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 03:01:36,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:36,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:36,153 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 03:01:36,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash 246397519, now seen corresponding path program 1 times [2019-11-26 03:01:36,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:36,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721758927] [2019-11-26 03:01:36,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:36,207 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 03:01:36,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721758927] [2019-11-26 03:01:36,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:36,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:36,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884009049] [2019-11-26 03:01:36,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:36,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:36,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:36,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:36,209 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 5 states. [2019-11-26 03:01:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:36,443 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-11-26 03:01:36,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:36,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-26 03:01:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:36,445 INFO L225 Difference]: With dead ends: 120 [2019-11-26 03:01:36,445 INFO L226 Difference]: Without dead ends: 118 [2019-11-26 03:01:36,446 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 03:01:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-26 03:01:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2019-11-26 03:01:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-26 03:01:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-11-26 03:01:36,452 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 12 [2019-11-26 03:01:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:36,453 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-11-26 03:01:36,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-11-26 03:01:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 03:01:36,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:36,459 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:36,461 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 03:01:36,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:36,461 INFO L82 PathProgramCache]: Analyzing trace with hash 248121423, now seen corresponding path program 1 times [2019-11-26 03:01:36,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:36,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141184586] [2019-11-26 03:01:36,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:36,558 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 03:01:36,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141184586] [2019-11-26 03:01:36,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:36,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 03:01:36,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496465281] [2019-11-26 03:01:36,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 03:01:36,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 03:01:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:01:36,560 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 6 states. [2019-11-26 03:01:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:36,740 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2019-11-26 03:01:36,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:36,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-26 03:01:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:36,741 INFO L225 Difference]: With dead ends: 100 [2019-11-26 03:01:36,741 INFO L226 Difference]: Without dead ends: 98 [2019-11-26 03:01:36,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:01:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-26 03:01:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-26 03:01:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-26 03:01:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-26 03:01:36,747 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 12 [2019-11-26 03:01:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:36,748 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-26 03:01:36,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 03:01:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-26 03:01:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 03:01:36,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:36,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:36,754 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 03:01:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash -951607394, now seen corresponding path program 1 times [2019-11-26 03:01:36,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:36,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667549578] [2019-11-26 03:01:36,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:36,837 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 03:01:36,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667549578] [2019-11-26 03:01:36,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:36,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:36,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038168252] [2019-11-26 03:01:36,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:36,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:36,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:36,839 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 5 states. [2019-11-26 03:01:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:37,076 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2019-11-26 03:01:37,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 03:01:37,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-26 03:01:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:37,078 INFO L225 Difference]: With dead ends: 115 [2019-11-26 03:01:37,078 INFO L226 Difference]: Without dead ends: 113 [2019-11-26 03:01:37,078 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 03:01:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-26 03:01:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2019-11-26 03:01:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-26 03:01:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-26 03:01:37,089 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 13 [2019-11-26 03:01:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:37,089 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-26 03:01:37,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-26 03:01:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 03:01:37,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:37,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:37,090 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 03:01:37,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:37,090 INFO L82 PathProgramCache]: Analyzing trace with hash -950060249, now seen corresponding path program 1 times [2019-11-26 03:01:37,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:37,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553201016] [2019-11-26 03:01:37,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:37,151 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 03:01:37,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553201016] [2019-11-26 03:01:37,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:37,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:37,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812878334] [2019-11-26 03:01:37,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:37,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:37,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:37,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:37,153 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 5 states. [2019-11-26 03:01:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:37,352 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2019-11-26 03:01:37,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:37,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-26 03:01:37,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:37,353 INFO L225 Difference]: With dead ends: 115 [2019-11-26 03:01:37,353 INFO L226 Difference]: Without dead ends: 113 [2019-11-26 03:01:37,353 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 03:01:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-26 03:01:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2019-11-26 03:01:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-26 03:01:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2019-11-26 03:01:37,357 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 13 [2019-11-26 03:01:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:37,357 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2019-11-26 03:01:37,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2019-11-26 03:01:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 03:01:37,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:37,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:37,358 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 03:01:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash -898166314, now seen corresponding path program 1 times [2019-11-26 03:01:37,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:37,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216332645] [2019-11-26 03:01:37,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:37,411 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 03:01:37,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216332645] [2019-11-26 03:01:37,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:37,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:37,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811415068] [2019-11-26 03:01:37,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:37,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:37,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:37,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:37,412 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 5 states. [2019-11-26 03:01:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:37,584 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2019-11-26 03:01:37,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:37,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-26 03:01:37,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:37,585 INFO L225 Difference]: With dead ends: 94 [2019-11-26 03:01:37,585 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 03:01:37,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:01:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 03:01:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-26 03:01:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-26 03:01:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2019-11-26 03:01:37,589 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 13 [2019-11-26 03:01:37,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:37,589 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2019-11-26 03:01:37,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2019-11-26 03:01:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 03:01:37,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:37,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:37,590 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 03:01:37,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash 612907497, now seen corresponding path program 1 times [2019-11-26 03:01:37,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:37,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505612574] [2019-11-26 03:01:37,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:37,674 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 03:01:37,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505612574] [2019-11-26 03:01:37,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:37,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:37,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865499189] [2019-11-26 03:01:37,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:37,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:37,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:37,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:37,676 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 5 states. [2019-11-26 03:01:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:37,890 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2019-11-26 03:01:37,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 03:01:37,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-26 03:01:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:37,892 INFO L225 Difference]: With dead ends: 106 [2019-11-26 03:01:37,892 INFO L226 Difference]: Without dead ends: 104 [2019-11-26 03:01:37,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:01:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-26 03:01:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2019-11-26 03:01:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-26 03:01:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2019-11-26 03:01:37,896 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 14 [2019-11-26 03:01:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:37,897 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2019-11-26 03:01:37,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2019-11-26 03:01:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 03:01:37,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:37,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:37,899 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 03:01:37,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:37,899 INFO L82 PathProgramCache]: Analyzing trace with hash 333456161, now seen corresponding path program 1 times [2019-11-26 03:01:37,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:37,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732080003] [2019-11-26 03:01:37,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:37,989 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 03:01:37,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732080003] [2019-11-26 03:01:37,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:37,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 03:01:37,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433536949] [2019-11-26 03:01:37,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 03:01:37,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:37,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 03:01:37,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:01:37,990 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 6 states. [2019-11-26 03:01:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:38,170 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-11-26 03:01:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 03:01:38,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-26 03:01:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:38,171 INFO L225 Difference]: With dead ends: 98 [2019-11-26 03:01:38,171 INFO L226 Difference]: Without dead ends: 96 [2019-11-26 03:01:38,172 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 03:01:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-26 03:01:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2019-11-26 03:01:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-26 03:01:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-11-26 03:01:38,175 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 15 [2019-11-26 03:01:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:38,175 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-11-26 03:01:38,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 03:01:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-11-26 03:01:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 03:01:38,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:38,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:01:38,176 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 03:01:38,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:38,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1747210525, now seen corresponding path program 1 times [2019-11-26 03:01:38,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:38,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816129141] [2019-11-26 03:01:38,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:38,211 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 03:01:38,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816129141] [2019-11-26 03:01:38,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:38,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 03:01:38,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312741375] [2019-11-26 03:01:38,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:01:38,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:38,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:01:38,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:01:38,212 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 4 states. [2019-11-26 03:01:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:38,318 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-26 03:01:38,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:01:38,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-26 03:01:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:38,319 INFO L225 Difference]: With dead ends: 86 [2019-11-26 03:01:38,319 INFO L226 Difference]: Without dead ends: 53 [2019-11-26 03:01:38,320 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 03:01:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-26 03:01:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-26 03:01:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-26 03:01:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-11-26 03:01:38,322 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 16 [2019-11-26 03:01:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:38,322 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-11-26 03:01:38,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:01:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-11-26 03:01:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-26 03:01:38,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:38,323 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] [2019-11-26 03:01:38,323 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 03:01:38,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:38,324 INFO L82 PathProgramCache]: Analyzing trace with hash -789661849, now seen corresponding path program 1 times [2019-11-26 03:01:38,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:38,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595300871] [2019-11-26 03:01:38,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:38,545 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 03:01:38,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595300871] [2019-11-26 03:01:38,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:38,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-26 03:01:38,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758900493] [2019-11-26 03:01:38,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 03:01:38,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:38,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 03:01:38,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-26 03:01:38,546 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 13 states. [2019-11-26 03:01:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:38,673 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-11-26 03:01:38,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 03:01:38,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-11-26 03:01:38,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:38,674 INFO L225 Difference]: With dead ends: 53 [2019-11-26 03:01:38,674 INFO L226 Difference]: Without dead ends: 51 [2019-11-26 03:01:38,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-11-26 03:01:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-26 03:01:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-26 03:01:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-26 03:01:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-11-26 03:01:38,677 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 43 [2019-11-26 03:01:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:38,677 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-11-26 03:01:38,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 03:01:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-11-26 03:01:38,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-26 03:01:38,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:38,678 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] [2019-11-26 03:01:38,678 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 03:01:38,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:38,679 INFO L82 PathProgramCache]: Analyzing trace with hash -789645961, now seen corresponding path program 1 times [2019-11-26 03:01:38,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:38,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722432544] [2019-11-26 03:01:38,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:38,865 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 03:01:38,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722432544] [2019-11-26 03:01:38,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:38,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-26 03:01:38,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891169396] [2019-11-26 03:01:38,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 03:01:38,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:38,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 03:01:38,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-26 03:01:38,867 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 13 states. [2019-11-26 03:01:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:38,991 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-11-26 03:01:38,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 03:01:38,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-11-26 03:01:38,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:38,992 INFO L225 Difference]: With dead ends: 58 [2019-11-26 03:01:38,992 INFO L226 Difference]: Without dead ends: 56 [2019-11-26 03:01:38,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-11-26 03:01:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-26 03:01:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2019-11-26 03:01:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-26 03:01:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-11-26 03:01:38,994 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 43 [2019-11-26 03:01:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:38,995 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-11-26 03:01:38,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 03:01:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-11-26 03:01:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 03:01:38,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:38,996 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] [2019-11-26 03:01:38,996 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 03:01:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1290290900, now seen corresponding path program 1 times [2019-11-26 03:01:38,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:38,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229180265] [2019-11-26 03:01:38,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:39,212 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 03:01:39,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229180265] [2019-11-26 03:01:39,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:39,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:39,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609922462] [2019-11-26 03:01:39,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:39,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:39,213 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2019-11-26 03:01:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:39,314 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-11-26 03:01:39,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:01:39,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-26 03:01:39,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:39,316 INFO L225 Difference]: With dead ends: 49 [2019-11-26 03:01:39,316 INFO L226 Difference]: Without dead ends: 45 [2019-11-26 03:01:39,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:01:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-26 03:01:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-26 03:01:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-26 03:01:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-11-26 03:01:39,318 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 44 [2019-11-26 03:01:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:39,318 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-11-26 03:01:39,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-11-26 03:01:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 03:01:39,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:01:39,319 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] [2019-11-26 03:01:39,319 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 03:01:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:01:39,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1290783444, now seen corresponding path program 1 times [2019-11-26 03:01:39,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:01:39,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602929260] [2019-11-26 03:01:39,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:01:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:01:39,500 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 03:01:39,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602929260] [2019-11-26 03:01:39,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:01:39,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 03:01:39,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944593347] [2019-11-26 03:01:39,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 03:01:39,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:01:39,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 03:01:39,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:01:39,502 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 5 states. [2019-11-26 03:01:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:01:39,609 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-11-26 03:01:39,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 03:01:39,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-26 03:01:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:01:39,610 INFO L225 Difference]: With dead ends: 49 [2019-11-26 03:01:39,610 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 03:01:39,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 03:01:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 03:01:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 03:01:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 03:01:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 03:01:39,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-11-26 03:01:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:01:39,611 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 03:01:39,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 03:01:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 03:01:39,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 03:01:39,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 03:01:39,705 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-11-26 03:01:39,706 INFO L447 ceAbstractionStarter]: At program point L927(lines 12 1001) the Hoare annotation is: true [2019-11-26 03:01:39,706 INFO L444 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-11-26 03:01:39,706 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-11-26 03:01:39,706 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-11-26 03:01:39,706 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-11-26 03:01:39,706 INFO L444 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-11-26 03:01:39,706 INFO L444 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-11-26 03:01:39,706 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-11-26 03:01:39,706 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-26 03:01:39,707 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 03:01:39,707 INFO L444 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-11-26 03:01:39,707 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-26 03:01:39,707 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-11-26 03:01:39,707 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-11-26 03:01:39,707 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-11-26 03:01:39,707 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-26 03:01:39,707 INFO L444 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-11-26 03:01:39,707 INFO L440 ceAbstractionStarter]: At program point L863(lines 21 995) 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 03:01:39,707 INFO L444 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-11-26 03:01:39,708 INFO L444 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-11-26 03:01:39,709 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-11-26 03:01:39,709 INFO L444 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-11-26 03:01:39,709 INFO L444 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-11-26 03:01:39,709 INFO L440 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-11-26 03:01:39,709 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-11-26 03:01:39,709 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-11-26 03:01:39,709 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-11-26 03:01:39,709 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-26 03:01:39,709 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-11-26 03:01:39,709 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L447 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-11-26 03:01:39,710 INFO L444 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-11-26 03:01:39,711 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-26 03:01:39,711 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-11-26 03:01:39,711 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-11-26 03:01:39,711 INFO L440 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 8 ULTIMATE.start_main_~main__t~0)) [2019-11-26 03:01:39,711 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-11-26 03:01:39,711 INFO L444 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-11-26 03:01:39,711 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-11-26 03:01:39,711 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-11-26 03:01:39,711 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-11-26 03:01:39,711 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-11-26 03:01:39,712 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-11-26 03:01:39,713 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-11-26 03:01:39,713 INFO L444 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-11-26 03:01:39,713 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-26 03:01:39,713 INFO L440 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-11-26 03:01:39,713 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-11-26 03:01:39,715 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-26 03:01:39,715 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-11-26 03:01:39,715 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-11-26 03:01:39,715 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-26 03:01:39,715 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-11-26 03:01:39,715 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-11-26 03:01:39,715 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-11-26 03:01:39,716 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-11-26 03:01:39,716 INFO L444 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-11-26 03:01:39,716 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-26 03:01:39,716 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-26 03:01:39,716 INFO L444 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-11-26 03:01:39,716 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-11-26 03:01:39,716 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-26 03:01:39,717 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-11-26 03:01:39,717 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-11-26 03:01:39,717 INFO L444 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-11-26 03:01:39,717 INFO L444 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-11-26 03:01:39,717 INFO L444 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-11-26 03:01:39,717 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-11-26 03:01:39,717 INFO L444 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-11-26 03:01:39,717 INFO L444 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-11-26 03:01:39,718 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-11-26 03:01:39,718 INFO L444 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-26 03:01:39,718 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-11-26 03:01:39,718 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-11-26 03:01:39,718 INFO L444 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-11-26 03:01:39,718 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-11-26 03:01:39,718 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-11-26 03:01:39,719 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-11-26 03:01:39,719 INFO L444 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-11-26 03:01:39,719 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-26 03:01:39,719 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-11-26 03:01:39,719 INFO L444 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-11-26 03:01:39,719 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-26 03:01:39,719 INFO L444 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-11-26 03:01:39,719 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-11-26 03:01:39,720 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-11-26 03:01:39,720 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-11-26 03:01:39,720 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-11-26 03:01:39,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 03:01:39 BoogieIcfgContainer [2019-11-26 03:01:39,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 03:01:39,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 03:01:39,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 03:01:39,738 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 03:01:39,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:01:34" (3/4) ... [2019-11-26 03:01:39,742 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 03:01:39,766 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-26 03:01:39,767 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 03:01:39,937 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1a66e14c-0a70-4cff-aa9b-81eb84806cfa/bin/utaipan/witness.graphml [2019-11-26 03:01:39,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 03:01:39,940 INFO L168 Benchmark]: Toolchain (without parser) took 6666.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -66.4 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:39,941 INFO L168 Benchmark]: CDTParser took 0.22 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 03:01:39,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:39,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:39,942 INFO L168 Benchmark]: Boogie Preprocessor took 44.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:01:39,942 INFO L168 Benchmark]: RCFGBuilder took 832.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:39,943 INFO L168 Benchmark]: TraceAbstraction took 5044.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.6 MB). Peak memory consumption was 125.1 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:39,943 INFO L168 Benchmark]: Witness Printer took 199.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-11-26 03:01:39,945 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.22 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 470.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 832.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5044.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.6 MB). Peak memory consumption was 125.1 MB. Max. memory is 11.5 GB. * Witness Printer took 199.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: 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: 31]: 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: 878]: 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: 152]: 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: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 8 <= main__t - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 16 error locations. Result: SAFE, OverallTime: 4.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 678 SDtfs, 1957 SDslu, 689 SDs, 0 SdLazy, 2401 SolverSat, 468 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 48 SyntacticMatches, 55 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred 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, 16 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 32 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1145 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 61 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 30483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...