./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/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 75f71671f83387eb35a445031d63abe79f5c0c7c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:47,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:47,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:47,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:47,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:47,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:47,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:47,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:47,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:47,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:47,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:47,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:47,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:47,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:47,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:47,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:47,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:47,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:47,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:47,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:47,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:47,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:47,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:47,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:47,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:47,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:47,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:47,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:47,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:47,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:47,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:47,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:47,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:47,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:47,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:47,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:47,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:47,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:47,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:47,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:47,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:47,194 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:47,205 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:47,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:47,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:47,206 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:47,206 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:47,206 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:47,206 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:47,206 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:47,207 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:47,207 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:47,207 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:47,207 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:47,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:47,208 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:47,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:47,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:47,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:47,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:47,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:47,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:47,209 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:47,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:47,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:47,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:47,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:47,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:47,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:47,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:47,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:47,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:47,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:47,212 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:47,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:47,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:47,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:47,212 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/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/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 -> 75f71671f83387eb35a445031d63abe79f5c0c7c [2019-10-22 11:22:47,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:47,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:47,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:47,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:47,251 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:47,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-22 11:22:47,302 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/data/8939d6a92/9c5d425d49a04b3d90d3b58f6c6f86a4/FLAGbd7296be5 [2019-10-22 11:22:47,709 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:47,709 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-22 11:22:47,717 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/data/8939d6a92/9c5d425d49a04b3d90d3b58f6c6f86a4/FLAGbd7296be5 [2019-10-22 11:22:47,728 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/data/8939d6a92/9c5d425d49a04b3d90d3b58f6c6f86a4 [2019-10-22 11:22:47,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:47,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:47,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:47,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:47,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:47,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375f0f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47, skipping insertion in model container [2019-10-22 11:22:47,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,749 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:47,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:48,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:48,054 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:48,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:48,116 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:48,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48 WrapperNode [2019-10-22 11:22:48,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:48,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:48,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:48,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:48,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... [2019-10-22 11:22:48,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... [2019-10-22 11:22:48,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:48,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:48,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:48,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:48,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... [2019-10-22 11:22:48,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... [2019-10-22 11:22:48,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... [2019-10-22 11:22:48,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... [2019-10-22 11:22:48,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... [2019-10-22 11:22:48,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... [2019-10-22 11:22:48,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... [2019-10-22 11:22:48,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:48,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:48,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:48,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:48,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/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-10-22 11:22:48,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:48,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:48,593 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:48,593 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 11:22:48,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:48 BoogieIcfgContainer [2019-10-22 11:22:48,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:48,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:48,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:48,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:48,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:47" (1/3) ... [2019-10-22 11:22:48,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef3a9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:48, skipping insertion in model container [2019-10-22 11:22:48,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:48" (2/3) ... [2019-10-22 11:22:48,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef3a9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:48, skipping insertion in model container [2019-10-22 11:22:48,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:48" (3/3) ... [2019-10-22 11:22:48,601 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-10-22 11:22:48,609 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:48,614 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-22 11:22:48,624 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-22 11:22:48,645 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:48,645 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:48,645 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:48,645 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:48,645 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:48,645 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:48,645 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:48,645 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-10-22 11:22:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:22:48,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:48,681 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:48,683 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2019-10-22 11:22:48,694 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:48,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869092085] [2019-10-22 11:22:48,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:48,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:48,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:48,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869092085] [2019-10-22 11:22:48,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:48,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:48,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234471073] [2019-10-22 11:22:48,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:48,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:48,886 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2019-10-22 11:22:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:49,035 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2019-10-22 11:22:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:49,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:22:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:49,048 INFO L225 Difference]: With dead ends: 128 [2019-10-22 11:22:49,048 INFO L226 Difference]: Without dead ends: 107 [2019-10-22 11:22:49,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-22 11:22:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2019-10-22 11:22:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:22:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-22 11:22:49,101 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2019-10-22 11:22:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:49,102 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-22 11:22:49,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-22 11:22:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:22:49,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:49,106 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:49,106 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:49,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2019-10-22 11:22:49,107 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:49,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215739593] [2019-10-22 11:22:49,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:49,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215739593] [2019-10-22 11:22:49,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:49,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:49,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449848306] [2019-10-22 11:22:49,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:49,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:49,200 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-10-22 11:22:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:49,296 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-10-22 11:22:49,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:49,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:22:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:49,298 INFO L225 Difference]: With dead ends: 107 [2019-10-22 11:22:49,298 INFO L226 Difference]: Without dead ends: 105 [2019-10-22 11:22:49,299 INFO L600 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-10-22 11:22:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-22 11:22:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2019-10-22 11:22:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 11:22:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-22 11:22:49,307 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2019-10-22 11:22:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:49,308 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-22 11:22:49,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-22 11:22:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:22:49,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:49,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:49,309 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:49,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2019-10-22 11:22:49,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:49,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760576812] [2019-10-22 11:22:49,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:49,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760576812] [2019-10-22 11:22:49,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:49,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:49,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185557560] [2019-10-22 11:22:49,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:49,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:49,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:49,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:49,396 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-10-22 11:22:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:49,473 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-10-22 11:22:49,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:49,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 11:22:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:49,475 INFO L225 Difference]: With dead ends: 67 [2019-10-22 11:22:49,475 INFO L226 Difference]: Without dead ends: 65 [2019-10-22 11:22:49,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10-22 11:22:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-22 11:22:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-10-22 11:22:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 11:22:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-22 11:22:49,480 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2019-10-22 11:22:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:49,481 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-22 11:22:49,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-22 11:22:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:22:49,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:49,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:49,482 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:49,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:49,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2019-10-22 11:22:49,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:49,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588850117] [2019-10-22 11:22:49,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:49,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588850117] [2019-10-22 11:22:49,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:49,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:49,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648170975] [2019-10-22 11:22:49,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:49,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:49,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:49,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:49,532 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-10-22 11:22:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:49,600 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-10-22 11:22:49,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:49,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 11:22:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:49,601 INFO L225 Difference]: With dead ends: 67 [2019-10-22 11:22:49,601 INFO L226 Difference]: Without dead ends: 65 [2019-10-22 11:22:49,601 INFO L600 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-10-22 11:22:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-22 11:22:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-22 11:22:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 11:22:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-22 11:22:49,606 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2019-10-22 11:22:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:49,607 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-22 11:22:49,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-22 11:22:49,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:22:49,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:49,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:49,608 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:49,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2019-10-22 11:22:49,609 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:49,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060604493] [2019-10-22 11:22:49,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:49,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060604493] [2019-10-22 11:22:49,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:49,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:49,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817815865] [2019-10-22 11:22:49,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:49,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:49,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:49,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:49,645 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-10-22 11:22:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:49,696 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-22 11:22:49,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:49,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:22:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:49,698 INFO L225 Difference]: With dead ends: 65 [2019-10-22 11:22:49,698 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 11:22:49,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 11:22:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-22 11:22:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 11:22:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-22 11:22:49,703 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2019-10-22 11:22:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:49,704 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-22 11:22:49,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-22 11:22:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:22:49,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:49,704 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:49,705 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2019-10-22 11:22:49,705 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:49,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960959528] [2019-10-22 11:22:49,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:49,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960959528] [2019-10-22 11:22:49,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:49,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:49,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489060927] [2019-10-22 11:22:49,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:49,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:49,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:49,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:49,755 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-10-22 11:22:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:49,831 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-10-22 11:22:49,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:49,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 11:22:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:49,832 INFO L225 Difference]: With dead ends: 94 [2019-10-22 11:22:49,832 INFO L226 Difference]: Without dead ends: 92 [2019-10-22 11:22:49,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10-22 11:22:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-22 11:22:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2019-10-22 11:22:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 11:22:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-10-22 11:22:49,838 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2019-10-22 11:22:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:49,838 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-10-22 11:22:49,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-10-22 11:22:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:22:49,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:49,839 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:49,839 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2019-10-22 11:22:49,840 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:49,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355957166] [2019-10-22 11:22:49,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:49,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355957166] [2019-10-22 11:22:49,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:49,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:49,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109639133] [2019-10-22 11:22:49,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:49,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:49,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:49,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:49,895 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2019-10-22 11:22:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:50,002 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-10-22 11:22:50,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:50,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 11:22:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:50,003 INFO L225 Difference]: With dead ends: 99 [2019-10-22 11:22:50,003 INFO L226 Difference]: Without dead ends: 97 [2019-10-22 11:22:50,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10-22 11:22:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-22 11:22:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2019-10-22 11:22:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:22:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-22 11:22:50,010 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2019-10-22 11:22:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:50,011 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-22 11:22:50,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-22 11:22:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:22:50,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:50,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:50,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:50,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2019-10-22 11:22:50,013 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:50,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020560444] [2019-10-22 11:22:50,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:50,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020560444] [2019-10-22 11:22:50,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:50,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:50,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511374461] [2019-10-22 11:22:50,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:50,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:50,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:50,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:50,074 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2019-10-22 11:22:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:50,130 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-10-22 11:22:50,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:50,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:22:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:50,131 INFO L225 Difference]: With dead ends: 57 [2019-10-22 11:22:50,131 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 11:22:50,131 INFO L600 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-10-22 11:22:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 11:22:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-10-22 11:22:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 11:22:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-22 11:22:50,139 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2019-10-22 11:22:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:50,140 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-22 11:22:50,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-22 11:22:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:22:50,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:50,141 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:50,141 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2019-10-22 11:22:50,142 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:50,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970769163] [2019-10-22 11:22:50,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:50,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970769163] [2019-10-22 11:22:50,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:50,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:50,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291401323] [2019-10-22 11:22:50,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:50,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:50,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:50,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:50,241 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-10-22 11:22:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:50,376 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-10-22 11:22:50,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:50,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 11:22:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:50,377 INFO L225 Difference]: With dead ends: 82 [2019-10-22 11:22:50,377 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 11:22:50,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:50,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 11:22:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2019-10-22 11:22:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 11:22:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-22 11:22:50,383 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 13 [2019-10-22 11:22:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:50,384 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-22 11:22:50,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-22 11:22:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:22:50,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:50,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:50,386 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:50,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:50,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2019-10-22 11:22:50,386 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:50,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984441557] [2019-10-22 11:22:50,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:50,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984441557] [2019-10-22 11:22:50,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:50,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:50,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344783203] [2019-10-22 11:22:50,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:50,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:50,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:50,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:50,478 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-10-22 11:22:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:50,629 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-10-22 11:22:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:50,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 11:22:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:50,631 INFO L225 Difference]: With dead ends: 86 [2019-10-22 11:22:50,631 INFO L226 Difference]: Without dead ends: 84 [2019-10-22 11:22:50,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-22 11:22:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2019-10-22 11:22:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:22:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-22 11:22:50,642 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-10-22 11:22:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:50,643 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-22 11:22:50,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-22 11:22:50,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:22:50,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:50,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:50,644 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:50,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2019-10-22 11:22:50,645 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:50,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658275362] [2019-10-22 11:22:50,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:50,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658275362] [2019-10-22 11:22:50,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:50,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:50,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33799462] [2019-10-22 11:22:50,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:50,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:50,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:50,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:50,688 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-10-22 11:22:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:50,767 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-10-22 11:22:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:50,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 11:22:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:50,768 INFO L225 Difference]: With dead ends: 66 [2019-10-22 11:22:50,769 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 11:22:50,769 INFO L600 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-10-22 11:22:50,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 11:22:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 45. [2019-10-22 11:22:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:22:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-22 11:22:50,773 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 13 [2019-10-22 11:22:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:50,773 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-22 11:22:50,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-22 11:22:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:22:50,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:50,774 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:50,774 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:50,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2019-10-22 11:22:50,778 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:50,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283039338] [2019-10-22 11:22:50,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:50,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283039338] [2019-10-22 11:22:50,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:50,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:50,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350169596] [2019-10-22 11:22:50,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:50,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:50,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:50,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:50,858 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-10-22 11:22:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:50,922 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-10-22 11:22:50,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:50,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 11:22:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:50,924 INFO L225 Difference]: With dead ends: 47 [2019-10-22 11:22:50,924 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:22:50,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:22:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-22 11:22:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 11:22:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-22 11:22:50,930 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2019-10-22 11:22:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:50,930 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-22 11:22:50,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-22 11:22:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:22:50,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:50,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:50,931 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:50,932 INFO L82 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2019-10-22 11:22:50,932 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:50,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573133933] [2019-10-22 11:22:50,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:50,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573133933] [2019-10-22 11:22:50,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:50,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:50,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101780106] [2019-10-22 11:22:50,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:50,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:50,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:50,984 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-10-22 11:22:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:51,079 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-10-22 11:22:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:51,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:22:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:51,080 INFO L225 Difference]: With dead ends: 59 [2019-10-22 11:22:51,080 INFO L226 Difference]: Without dead ends: 57 [2019-10-22 11:22:51,080 INFO L600 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-10-22 11:22:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-22 11:22:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-10-22 11:22:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:22:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-22 11:22:51,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-10-22 11:22:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:51,085 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-22 11:22:51,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-22 11:22:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:22:51,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:51,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:51,086 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:51,086 INFO L82 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2019-10-22 11:22:51,086 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:51,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628052000] [2019-10-22 11:22:51,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:51,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628052000] [2019-10-22 11:22:51,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:51,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:51,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310447447] [2019-10-22 11:22:51,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:51,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:51,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:51,139 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-10-22 11:22:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:51,254 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-10-22 11:22:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:51,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-22 11:22:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:51,255 INFO L225 Difference]: With dead ends: 61 [2019-10-22 11:22:51,255 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 11:22:51,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 11:22:51,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2019-10-22 11:22:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:22:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-22 11:22:51,259 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-10-22 11:22:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:51,259 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-22 11:22:51,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-22 11:22:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:22:51,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:51,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:51,261 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2019-10-22 11:22:51,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:51,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315360524] [2019-10-22 11:22:51,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:51,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315360524] [2019-10-22 11:22:51,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:51,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:51,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892635594] [2019-10-22 11:22:51,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:51,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:51,308 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-10-22 11:22:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:51,368 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-10-22 11:22:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:51,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:22:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:51,369 INFO L225 Difference]: With dead ends: 39 [2019-10-22 11:22:51,369 INFO L226 Difference]: Without dead ends: 35 [2019-10-22 11:22:51,369 INFO L600 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-10-22 11:22:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-22 11:22:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-22 11:22:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 11:22:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-22 11:22:51,372 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2019-10-22 11:22:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:51,372 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-22 11:22:51,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-22 11:22:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:22:51,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:51,373 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:51,373 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2019-10-22 11:22:51,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:51,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544593841] [2019-10-22 11:22:51,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:51,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544593841] [2019-10-22 11:22:51,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:51,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:51,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81766014] [2019-10-22 11:22:51,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:51,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:51,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:51,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:51,427 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-10-22 11:22:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:51,500 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-10-22 11:22:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:51,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-22 11:22:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:51,501 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:22:51,501 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 11:22:51,502 INFO L600 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-10-22 11:22:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 11:22:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2019-10-22 11:22:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 11:22:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-22 11:22:51,504 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2019-10-22 11:22:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:51,505 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-22 11:22:51,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-22 11:22:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:22:51,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:51,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:51,506 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:51,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2019-10-22 11:22:51,506 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:51,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701444929] [2019-10-22 11:22:51,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:51,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-10-22 11:22:51,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701444929] [2019-10-22 11:22:51,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:51,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:51,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435502942] [2019-10-22 11:22:51,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:51,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:51,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:51,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:51,547 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-10-22 11:22:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:51,647 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-10-22 11:22:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:51,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:22:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:51,650 INFO L225 Difference]: With dead ends: 52 [2019-10-22 11:22:51,650 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:22:51,650 INFO L600 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-10-22 11:22:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:22:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-10-22 11:22:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 11:22:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-22 11:22:51,654 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-10-22 11:22:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:51,654 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-22 11:22:51,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-22 11:22:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:22:51,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:51,655 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:51,655 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2019-10-22 11:22:51,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:51,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074770213] [2019-10-22 11:22:51,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:51,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074770213] [2019-10-22 11:22:51,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:51,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:51,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917845221] [2019-10-22 11:22:51,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:51,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:51,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:51,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:51,694 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-10-22 11:22:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:51,732 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-10-22 11:22:51,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:51,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-22 11:22:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:51,733 INFO L225 Difference]: With dead ends: 33 [2019-10-22 11:22:51,733 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:22:51,733 INFO L600 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-10-22 11:22:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:22:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:22:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:22:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:22:51,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-22 11:22:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:51,734 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:22:51,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:22:51,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:22:51,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:22:52,035 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:22:52,036 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:22:52,037 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-10-22 11:22:52,037 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-10-22 11:22:52,037 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-10-22 11:22:52,037 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-10-22 11:22:52,037 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-10-22 11:22:52,037 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-10-22 11:22:52,037 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-10-22 11:22:52,037 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-10-22 11:22:52,037 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-10-22 11:22:52,038 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-10-22 11:22:52,038 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-10-22 11:22:52,038 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-10-22 11:22:52,038 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-10-22 11:22:52,038 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) 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-10-22 11:22:52,038 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-22 11:22:52,038 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-10-22 11:22:52,038 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-10-22 11:22:52,038 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-10-22 11:22:52,039 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-10-22 11:22:52,040 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-10-22 11:22:52,040 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-10-22 11:22:52,040 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-10-22 11:22:52,040 INFO L446 ceAbstractionStarter]: At program point L395(lines 10 397) the Hoare annotation is: true [2019-10-22 11:22:52,040 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-10-22 11:22:52,040 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-10-22 11:22:52,040 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:22:52,040 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-10-22 11:22:52,040 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-10-22 11:22:52,041 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-10-22 11:22:52,041 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-10-22 11:22:52,041 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-10-22 11:22:52,041 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-22 11:22:52,041 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-10-22 11:22:52,041 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-10-22 11:22:52,041 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-10-22 11:22:52,041 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-10-22 11:22:52,041 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:22:52,041 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) 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-10-22 11:22:52,041 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-10-22 11:22:52,042 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-22 11:22:52,043 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-10-22 11:22:52,043 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-10-22 11:22:52,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:52 BoogieIcfgContainer [2019-10-22 11:22:52,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:52,065 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:52,065 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:52,066 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:52,066 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:48" (3/4) ... [2019-10-22 11:22:52,069 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:22:52,080 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:22:52,080 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:22:52,142 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eb39d611-b2c4-4263-b0d4-3a95f1d2a5d3/bin/utaipan/witness.graphml [2019-10-22 11:22:52,143 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:52,144 INFO L168 Benchmark]: Toolchain (without parser) took 4413.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -108.9 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:52,145 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:52,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 948.5 MB in the beginning and 1.2 GB in the end (delta: -205.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:52,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.70 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:52,146 INFO L168 Benchmark]: Boogie Preprocessor took 42.06 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:52,146 INFO L168 Benchmark]: RCFGBuilder took 388.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:52,146 INFO L168 Benchmark]: TraceAbstraction took 3470.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.4 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:52,146 INFO L168 Benchmark]: Witness Printer took 77.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:52,148 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 948.5 MB in the beginning and 1.2 GB in the end (delta: -205.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.70 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.06 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 388.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3470.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.4 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. * Witness Printer took 77.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 18 error locations. Result: SAFE, OverallTime: 3.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 773 SDtfs, 1307 SDslu, 740 SDs, 0 SdLazy, 1080 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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, 18 MinimizatonAttempts, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 40 HoareAnnotationTreeSize, 6 FomulaSimplifications, 285889 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1102 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 7087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...