./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/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 edfcf451b435e6b30ae37c75ee1e2f5c8348550f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:48:36,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:48:36,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:48:36,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:48:36,378 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:48:36,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:48:36,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:48:36,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:48:36,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:48:36,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:48:36,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:48:36,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:48:36,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:48:36,384 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:48:36,385 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:48:36,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:48:36,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:48:36,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:48:36,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:48:36,388 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:48:36,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:48:36,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:48:36,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:48:36,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:48:36,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:48:36,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:48:36,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:48:36,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:48:36,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:48:36,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:48:36,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:48:36,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:48:36,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:48:36,396 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:48:36,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:48:36,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:48:36,397 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 13:48:36,407 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:48:36,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:48:36,408 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:48:36,408 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:48:36,408 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:48:36,409 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:48:36,409 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:48:36,409 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 13:48:36,409 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:48:36,409 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:48:36,409 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 13:48:36,409 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 13:48:36,409 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:48:36,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:48:36,410 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:48:36,410 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:48:36,410 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:48:36,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:48:36,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:48:36,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:48:36,411 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:48:36,411 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:48:36,411 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:48:36,411 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:48:36,411 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:48:36,412 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:48:36,412 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:48:36,412 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:48:36,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:48:36,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:48:36,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:48:36,412 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:48:36,412 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:48:36,412 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 13:48:36,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:48:36,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:48:36,413 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:48:36,413 INFO L133 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_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/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 -> edfcf451b435e6b30ae37c75ee1e2f5c8348550f [2018-11-23 13:48:36,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:48:36,446 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:48:36,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:48:36,450 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:48:36,450 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:48:36,451 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-23 13:48:36,495 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/data/a32f6519a/19ba330a61ac455595dfe5214055cc13/FLAG6b7ea4726 [2018-11-23 13:48:36,905 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:48:36,905 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-23 13:48:36,911 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/data/a32f6519a/19ba330a61ac455595dfe5214055cc13/FLAG6b7ea4726 [2018-11-23 13:48:36,923 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/data/a32f6519a/19ba330a61ac455595dfe5214055cc13 [2018-11-23 13:48:36,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:48:36,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:48:36,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:48:36,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:48:36,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:48:36,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:48:36" (1/1) ... [2018-11-23 13:48:36,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e5f2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:36, skipping insertion in model container [2018-11-23 13:48:36,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:48:36" (1/1) ... [2018-11-23 13:48:36,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:48:36,965 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:48:37,093 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:48:37,095 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:48:37,114 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:48:37,122 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:48:37,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37 WrapperNode [2018-11-23 13:48:37,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:48:37,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:48:37,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:48:37,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:48:37,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... [2018-11-23 13:48:37,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... [2018-11-23 13:48:37,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:48:37,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:48:37,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:48:37,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:48:37,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... [2018-11-23 13:48:37,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... [2018-11-23 13:48:37,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... [2018-11-23 13:48:37,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... [2018-11-23 13:48:37,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... [2018-11-23 13:48:37,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... [2018-11-23 13:48:37,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... [2018-11-23 13:48:37,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:48:37,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:48:37,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:48:37,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:48:37,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/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 [2018-11-23 13:48:37,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:48:37,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:48:37,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:48:37,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:48:37,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:48:37,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:48:37,474 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:48:37,474 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:48:37,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:48:37 BoogieIcfgContainer [2018-11-23 13:48:37,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:48:37,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:48:37,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:48:37,477 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:48:37,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:48:36" (1/3) ... [2018-11-23 13:48:37,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b46bae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:48:37, skipping insertion in model container [2018-11-23 13:48:37,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:48:37" (2/3) ... [2018-11-23 13:48:37,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b46bae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:48:37, skipping insertion in model container [2018-11-23 13:48:37,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:48:37" (3/3) ... [2018-11-23 13:48:37,479 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-23 13:48:37,485 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:48:37,490 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-23 13:48:37,499 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-23 13:48:37,519 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:48:37,519 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:48:37,519 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:48:37,519 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:48:37,519 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:48:37,519 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:48:37,519 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:48:37,520 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:48:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-23 13:48:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:48:37,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:37,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:37,539 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:37,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-11-23 13:48:37,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:37,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:37,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:37,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:37,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:37,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:37,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:48:37,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:37,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:48:37,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:48:37,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:48:37,698 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-11-23 13:48:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:37,892 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-11-23 13:48:37,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:48:37,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:48:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:37,900 INFO L225 Difference]: With dead ends: 129 [2018-11-23 13:48:37,900 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 13:48:37,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:48:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 13:48:37,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-23 13:48:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:48:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 13:48:37,931 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-11-23 13:48:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:37,931 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 13:48:37,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:48:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 13:48:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:48:37,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:37,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:37,933 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:37,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:37,933 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-11-23 13:48:37,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:37,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:37,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:37,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:37,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:37,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:37,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:48:37,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:37,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:48:37,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:48:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:48:37,973 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-23 13:48:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:38,022 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 13:48:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:48:38,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 13:48:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:38,023 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:48:38,023 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:48:38,024 INFO L631 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 [2018-11-23 13:48:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:48:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 13:48:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:48:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 13:48:38,030 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2018-11-23 13:48:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:38,030 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 13:48:38,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:48:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:48:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:48:38,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:38,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:38,031 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:38,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:38,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-11-23 13:48:38,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:38,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:38,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:38,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:38,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:48:38,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:38,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:48:38,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:48:38,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:48:38,082 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-11-23 13:48:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:38,170 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-23 13:48:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:48:38,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:48:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:38,171 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:48:38,171 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 13:48:38,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:48:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 13:48:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-23 13:48:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:48:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-23 13:48:38,176 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2018-11-23 13:48:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:38,176 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-23 13:48:38,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:48:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 13:48:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:48:38,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:38,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:38,177 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:38,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:38,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-11-23 13:48:38,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:38,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:38,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:38,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:38,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:48:38,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:38,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:48:38,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:48:38,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:48:38,231 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-11-23 13:48:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:38,354 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-23 13:48:38,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:38,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:48:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:38,355 INFO L225 Difference]: With dead ends: 107 [2018-11-23 13:48:38,355 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 13:48:38,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:48:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 13:48:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-23 13:48:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:48:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-23 13:48:38,362 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-11-23 13:48:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:38,362 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-23 13:48:38,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:48:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 13:48:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:48:38,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:38,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:38,364 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-11-23 13:48:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:38,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:38,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:48:38,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:38,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:48:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:48:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:48:38,407 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-11-23 13:48:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:38,519 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 13:48:38,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:38,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:48:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:38,521 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:48:38,521 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:48:38,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:48:38,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:48:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 13:48:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:48:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-23 13:48:38,527 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2018-11-23 13:48:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:38,527 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-23 13:48:38,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:48:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-23 13:48:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:48:38,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:38,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:38,528 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:38,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:38,529 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-11-23 13:48:38,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:38,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:38,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:38,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:38,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:48:38,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:38,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:48:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:48:38,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:48:38,559 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-11-23 13:48:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:38,670 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-23 13:48:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:38,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:48:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:38,672 INFO L225 Difference]: With dead ends: 146 [2018-11-23 13:48:38,672 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 13:48:38,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:48:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 13:48:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2018-11-23 13:48:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:48:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-23 13:48:38,679 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2018-11-23 13:48:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:38,680 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-23 13:48:38,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:48:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 13:48:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:48:38,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:38,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:38,681 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:38,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-11-23 13:48:38,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:38,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:38,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:38,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:38,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:48:38,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:38,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:48:38,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:48:38,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:48:38,709 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-11-23 13:48:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:38,818 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-23 13:48:38,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:38,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:48:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:38,819 INFO L225 Difference]: With dead ends: 99 [2018-11-23 13:48:38,819 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 13:48:38,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:48:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 13:48:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2018-11-23 13:48:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:48:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-23 13:48:38,825 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2018-11-23 13:48:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:38,825 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-23 13:48:38,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:48:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 13:48:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:48:38,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:38,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:38,827 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:38,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-11-23 13:48:38,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:38,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:38,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:38,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:38,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:48:38,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:38,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:48:38,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:48:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:48:38,859 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-11-23 13:48:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:38,932 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 13:48:38,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:38,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:48:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:38,933 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:48:38,933 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:48:38,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:48:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:48:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-23 13:48:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:48:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-23 13:48:38,937 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2018-11-23 13:48:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:38,938 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-23 13:48:38,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:48:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 13:48:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:48:38,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:38,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:38,939 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:38,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-11-23 13:48:38,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:38,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:39,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:39,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:48:39,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:39,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:48:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:48:39,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:48:39,004 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-23 13:48:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:39,107 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-23 13:48:39,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:39,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-23 13:48:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:39,108 INFO L225 Difference]: With dead ends: 95 [2018-11-23 13:48:39,108 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 13:48:39,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:48:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 13:48:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2018-11-23 13:48:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:48:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-23 13:48:39,112 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2018-11-23 13:48:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:39,112 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-23 13:48:39,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:48:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 13:48:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:48:39,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:39,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:39,114 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:39,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-11-23 13:48:39,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:39,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:39,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:39,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:39,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:48:39,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:39,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:48:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:48:39,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:48:39,139 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-11-23 13:48:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:39,190 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-23 13:48:39,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:39,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:48:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:39,191 INFO L225 Difference]: With dead ends: 72 [2018-11-23 13:48:39,191 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:48:39,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:48:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:48:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-11-23 13:48:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:48:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-23 13:48:39,194 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2018-11-23 13:48:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:39,194 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 13:48:39,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:48:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 13:48:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:48:39,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:39,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:39,195 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:39,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-11-23 13:48:39,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:39,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:39,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:39,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:39,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:48:39,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:39,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:48:39,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:48:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:48:39,235 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-11-23 13:48:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:39,293 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-23 13:48:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:39,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:48:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:39,294 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:48:39,294 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:48:39,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:48:39,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:48:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 13:48:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:48:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-23 13:48:39,297 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-11-23 13:48:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:39,297 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-23 13:48:39,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:48:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 13:48:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:48:39,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:39,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:39,298 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:39,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-11-23 13:48:39,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:39,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:39,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:48:39,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:39,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:48:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:48:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:48:39,359 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-11-23 13:48:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:39,447 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 13:48:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:39,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 13:48:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:39,447 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:48:39,447 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:48:39,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:48:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:48:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-23 13:48:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:48:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 13:48:39,450 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-23 13:48:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:39,450 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 13:48:39,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:48:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 13:48:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:48:39,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:39,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:39,451 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:39,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:39,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-11-23 13:48:39,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:39,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:39,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:39,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:39,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:48:39,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:39,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:48:39,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:48:39,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:48:39,484 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-23 13:48:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:39,544 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-23 13:48:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:39,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 13:48:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:39,545 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:48:39,545 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:48:39,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:48:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:48:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-23 13:48:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:48:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 13:48:39,548 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-23 13:48:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:39,549 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 13:48:39,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:48:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 13:48:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:48:39,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:39,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:39,550 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:39,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-11-23 13:48:39,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:39,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:39,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:39,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:39,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:48:39,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:39,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:48:39,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:48:39,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:48:39,613 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2018-11-23 13:48:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:39,701 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-23 13:48:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:39,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:48:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:39,702 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:48:39,702 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:48:39,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:48:39,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:48:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-23 13:48:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:48:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 13:48:39,706 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2018-11-23 13:48:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:39,706 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 13:48:39,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:48:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 13:48:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:48:39,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:39,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:39,707 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:39,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-11-23 13:48:39,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:39,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:39,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:48:39,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:39,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:48:39,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:48:39,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:48:39,754 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-23 13:48:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:39,835 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 13:48:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:48:39,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:48:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:39,836 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:48:39,836 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:48:39,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:48:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:48:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 13:48:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:48:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 13:48:39,840 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-11-23 13:48:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:39,840 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 13:48:39,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:48:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 13:48:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:48:39,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:39,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:39,841 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:39,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-11-23 13:48:39,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:39,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:39,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:39,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:48:39,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:39,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:48:39,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:48:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:48:39,912 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 13:48:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:40,038 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 13:48:40,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:40,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 13:48:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:40,038 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:48:40,039 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:48:40,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:48:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:48:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-23 13:48:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:48:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 13:48:40,041 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-11-23 13:48:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:40,041 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 13:48:40,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:48:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 13:48:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:48:40,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:40,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:40,042 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:40,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:40,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-11-23 13:48:40,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:40,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:40,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:40,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:40,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:40,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:40,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:48:40,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:40,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:48:40,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:48:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:48:40,087 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-11-23 13:48:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:40,181 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 13:48:40,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:40,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 13:48:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:40,183 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:48:40,183 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:48:40,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:48:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:48:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-23 13:48:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:48:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 13:48:40,188 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-11-23 13:48:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:40,188 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 13:48:40,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:48:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:48:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:48:40,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:48:40,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:48:40,189 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:48:40,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:48:40,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-11-23 13:48:40,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:48:40,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:40,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:48:40,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:48:40,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:48:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:48:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:48:40,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:48:40,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:48:40,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:48:40,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:48:40,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:48:40,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:48:40,215 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-11-23 13:48:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:48:40,289 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:48:40,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:48:40,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:48:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:48:40,290 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:48:40,290 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:48:40,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:48:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:48:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:48:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:48:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:48:40,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 13:48:40,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:48:40,291 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:48:40,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:48:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:48:40,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:48:40,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:48:40,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:48:40,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:48:40,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:48:40,506 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:48:40,507 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:48:40,507 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:48:40,507 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:48:40,507 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:48:40,507 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:48:40,507 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:48:40,507 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-23 13:48:40,507 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-11-23 13:48:40,507 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2018-11-23 13:48:40,507 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-23 13:48:40,507 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-11-23 13:48:40,507 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-11-23 13:48:40,508 INFO L451 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L444 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~13)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0)) [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-11-23 13:48:40,509 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2018-11-23 13:48:40,509 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L444 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (= 1 main_~__VERIFIER_assert__cond~0) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-11-23 13:48:40,510 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-11-23 13:48:40,511 INFO L448 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-11-23 13:48:40,511 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-11-23 13:48:40,511 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-11-23 13:48:40,519 INFO L448 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-11-23 13:48:40,519 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-11-23 13:48:40,519 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-11-23 13:48:40,519 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-11-23 13:48:40,519 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-11-23 13:48:40,519 INFO L448 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-11-23 13:48:40,519 INFO L444 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-23 13:48:40,520 INFO L444 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-23 13:48:40,520 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-23 13:48:40,520 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-23 13:48:40,520 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-23 13:48:40,520 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-23 13:48:40,520 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-11-23 13:48:40,520 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-11-23 13:48:40,520 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-23 13:48:40,520 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-11-23 13:48:40,520 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-11-23 13:48:40,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:48:40 BoogieIcfgContainer [2018-11-23 13:48:40,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:48:40,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:48:40,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:48:40,535 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:48:40,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:48:37" (3/4) ... [2018-11-23 13:48:40,539 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:48:40,544 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:48:40,545 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:48:40,550 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:48:40,550 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:48:40,610 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_90555231-dcc2-43b4-a2a7-cc79f586703d/bin-2019/utaipan/witness.graphml [2018-11-23 13:48:40,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:48:40,611 INFO L168 Benchmark]: Toolchain (without parser) took 3685.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 959.1 MB in the beginning and 939.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 238.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:48:40,612 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:48:40,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.33 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:48:40,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.14 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:48:40,613 INFO L168 Benchmark]: Boogie Preprocessor took 52.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:48:40,613 INFO L168 Benchmark]: RCFGBuilder took 284.81 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: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:48:40,614 INFO L168 Benchmark]: TraceAbstraction took 3060.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 944.5 MB in the end (delta: 168.4 MB). Peak memory consumption was 231.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:48:40,614 INFO L168 Benchmark]: Witness Printer took 75.51 ms. Allocated memory is still 1.2 GB. Free memory was 944.5 MB in the beginning and 939.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:48:40,616 INFO L336 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.33 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.14 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 284.81 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: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3060.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 944.5 MB in the end (delta: 168.4 MB). Peak memory consumption was 231.3 MB. Max. memory is 11.5 GB. * Witness Printer took 75.51 ms. Allocated memory is still 1.2 GB. Free memory was 944.5 MB in the beginning and 939.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - 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: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 == __VERIFIER_assert__cond && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 3.0s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 1999 SDslu, 1410 SDs, 0 SdLazy, 1547 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 64 HoareAnnotationTreeSize, 9 FomulaSimplifications, 282676 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 11607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...