./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/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_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/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-1dbac8b [2018-11-10 11:00:04,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:00:04,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:00:04,406 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:00:04,406 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:00:04,407 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:00:04,408 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:00:04,409 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:00:04,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:00:04,411 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:00:04,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:00:04,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:00:04,412 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:00:04,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:00:04,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:00:04,414 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:00:04,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:00:04,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:00:04,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:00:04,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:00:04,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:00:04,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:00:04,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:00:04,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:00:04,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:00:04,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:00:04,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:00:04,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:00:04,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:00:04,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:00:04,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:00:04,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:00:04,425 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:00:04,425 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:00:04,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:00:04,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:00:04,427 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 11:00:04,437 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:00:04,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:00:04,438 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:00:04,438 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:00:04,438 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:00:04,438 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:00:04,438 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:00:04,438 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:00:04,438 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:00:04,439 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:00:04,439 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:00:04,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:00:04,439 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:00:04,440 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:00:04,440 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:00:04,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:00:04,440 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:00:04,440 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:00:04,440 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:00:04,440 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:00:04,441 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:00:04,441 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:00:04,441 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:00:04,441 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:00:04,441 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:00:04,441 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:00:04,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:00:04,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:00:04,442 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:00:04,442 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:00:04,442 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:00:04,442 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:00:04,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:00:04,442 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:00:04,443 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_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/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-10 11:00:04,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:00:04,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:00:04,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:00:04,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:00:04,480 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:00:04,480 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-10 11:00:04,514 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/data/ed41afe2e/47a892e88ad441d0aae6098a2219ad3d/FLAGd1a7dd5d2 [2018-11-10 11:00:04,911 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:00:04,911 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-10 11:00:04,915 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/data/ed41afe2e/47a892e88ad441d0aae6098a2219ad3d/FLAGd1a7dd5d2 [2018-11-10 11:00:04,925 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/data/ed41afe2e/47a892e88ad441d0aae6098a2219ad3d [2018-11-10 11:00:04,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:00:04,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:00:04,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:00:04,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:00:04,930 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:00:04,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:00:04" (1/1) ... [2018-11-10 11:00:04,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12305cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:04, skipping insertion in model container [2018-11-10 11:00:04,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:00:04" (1/1) ... [2018-11-10 11:00:04,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:00:04,957 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:00:05,077 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:00:05,081 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:00:05,101 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:00:05,109 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:00:05,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05 WrapperNode [2018-11-10 11:00:05,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:00:05,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:00:05,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:00:05,110 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:00:05,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... [2018-11-10 11:00:05,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... [2018-11-10 11:00:05,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:00:05,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:00:05,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:00:05,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:00:05,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... [2018-11-10 11:00:05,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... [2018-11-10 11:00:05,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... [2018-11-10 11:00:05,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... [2018-11-10 11:00:05,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... [2018-11-10 11:00:05,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... [2018-11-10 11:00:05,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... [2018-11-10 11:00:05,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:00:05,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:00:05,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:00:05,149 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:00:05,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/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-10 11:00:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:00:05,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:00:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:00:05,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:00:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:00:05,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:00:05,459 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:00:05,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:00:05 BoogieIcfgContainer [2018-11-10 11:00:05,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:00:05,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:00:05,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:00:05,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:00:05,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:00:04" (1/3) ... [2018-11-10 11:00:05,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f08471c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:00:05, skipping insertion in model container [2018-11-10 11:00:05,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:05" (2/3) ... [2018-11-10 11:00:05,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f08471c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:00:05, skipping insertion in model container [2018-11-10 11:00:05,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:00:05" (3/3) ... [2018-11-10 11:00:05,468 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-10 11:00:05,476 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:00:05,482 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-10 11:00:05,495 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-10 11:00:05,516 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:00:05,516 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:00:05,516 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:00:05,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:00:05,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:00:05,517 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:00:05,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:00:05,517 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:00:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-10 11:00:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 11:00:05,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:05,532 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:05,535 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:05,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-11-10 11:00:05,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:05,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:05,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:05,706 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-10 11:00:05,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:05,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:00:05,707 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:05,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:00:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:00:05,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:00:05,720 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-11-10 11:00:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:05,860 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-11-10 11:00:05,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:00:05,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-10 11:00:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:05,867 INFO L225 Difference]: With dead ends: 129 [2018-11-10 11:00:05,867 INFO L226 Difference]: Without dead ends: 113 [2018-11-10 11:00:05,869 INFO L605 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-10 11:00:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-10 11:00:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-10 11:00:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 11:00:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-10 11:00:05,894 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-11-10 11:00:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:05,894 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-10 11:00:05,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:00:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-10 11:00:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 11:00:05,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:05,894 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:05,895 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:05,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:05,895 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-11-10 11:00:05,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:05,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:05,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:05,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:05,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:05,925 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-10 11:00:05,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:05,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:00:05,926 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:05,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:00:05,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:00:05,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:00:05,928 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-10 11:00:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:05,995 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-10 11:00:05,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:00:05,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-10 11:00:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:05,997 INFO L225 Difference]: With dead ends: 69 [2018-11-10 11:00:05,997 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 11:00:05,998 INFO L605 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-10 11:00:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 11:00:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-10 11:00:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 11:00:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-10 11:00:06,003 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2018-11-10 11:00:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:06,004 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-10 11:00:06,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:00:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-10 11:00:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 11:00:06,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:06,004 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:06,005 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:06,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-11-10 11:00:06,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:06,064 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-10 11:00:06,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:06,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:00:06,065 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:06,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:00:06,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:00:06,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:00:06,065 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-11-10 11:00:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:06,140 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-10 11:00:06,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:00:06,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 11:00:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:06,142 INFO L225 Difference]: With dead ends: 73 [2018-11-10 11:00:06,142 INFO L226 Difference]: Without dead ends: 71 [2018-11-10 11:00:06,142 INFO L605 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-10 11:00:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-10 11:00:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-10 11:00:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 11:00:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-10 11:00:06,150 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2018-11-10 11:00:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:06,150 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-10 11:00:06,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:00:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-10 11:00:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 11:00:06,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:06,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:06,151 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:06,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-11-10 11:00:06,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:06,208 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-10 11:00:06,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:06,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:00:06,208 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:06,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:00:06,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:00:06,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:00:06,209 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-11-10 11:00:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:06,301 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-10 11:00:06,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:06,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-10 11:00:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:06,303 INFO L225 Difference]: With dead ends: 107 [2018-11-10 11:00:06,303 INFO L226 Difference]: Without dead ends: 105 [2018-11-10 11:00:06,303 INFO L605 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-10 11:00:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-10 11:00:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-10 11:00:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 11:00:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-10 11:00:06,312 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-11-10 11:00:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:06,312 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-10 11:00:06,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:00:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-10 11:00:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 11:00:06,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:06,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:06,313 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:06,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:06,314 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-11-10 11:00:06,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:06,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:06,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:06,358 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-10 11:00:06,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:06,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:00:06,358 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:06,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:00:06,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:00:06,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:00:06,359 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-11-10 11:00:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:06,460 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-10 11:00:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:06,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-10 11:00:06,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:06,462 INFO L225 Difference]: With dead ends: 69 [2018-11-10 11:00:06,462 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 11:00:06,462 INFO L605 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-10 11:00:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 11:00:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-10 11:00:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 11:00:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-10 11:00:06,467 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2018-11-10 11:00:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:06,467 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-10 11:00:06,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:00:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-10 11:00:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 11:00:06,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:06,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:06,468 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:06,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:06,469 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-11-10 11:00:06,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:06,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:06,511 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-10 11:00:06,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:06,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:00:06,511 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:06,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:00:06,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:00:06,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:00:06,512 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-11-10 11:00:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:06,605 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-10 11:00:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:06,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-10 11:00:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:06,607 INFO L225 Difference]: With dead ends: 146 [2018-11-10 11:00:06,607 INFO L226 Difference]: Without dead ends: 144 [2018-11-10 11:00:06,607 INFO L605 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-10 11:00:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-10 11:00:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2018-11-10 11:00:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 11:00:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-10 11:00:06,613 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2018-11-10 11:00:06,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:06,613 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-10 11:00:06,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:00:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-10 11:00:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 11:00:06,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:06,614 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:06,615 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:06,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-11-10 11:00:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:06,643 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-10 11:00:06,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:06,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:00:06,644 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:06,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:00:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:00:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:00:06,645 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-11-10 11:00:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:06,740 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-10 11:00:06,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:06,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-10 11:00:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:06,741 INFO L225 Difference]: With dead ends: 99 [2018-11-10 11:00:06,742 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 11:00:06,742 INFO L605 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-10 11:00:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 11:00:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2018-11-10 11:00:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 11:00:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-10 11:00:06,747 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2018-11-10 11:00:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:06,747 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-10 11:00:06,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:00:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-10 11:00:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 11:00:06,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:06,748 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:06,749 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:06,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-11-10 11:00:06,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:06,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:06,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:06,789 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-10 11:00:06,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:06,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:00:06,790 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:06,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:00:06,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:00:06,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:00:06,790 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-11-10 11:00:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:06,876 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-10 11:00:06,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:06,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-10 11:00:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:06,877 INFO L225 Difference]: With dead ends: 61 [2018-11-10 11:00:06,877 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 11:00:06,877 INFO L605 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-10 11:00:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 11:00:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-10 11:00:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 11:00:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-10 11:00:06,881 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2018-11-10 11:00:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:06,881 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-10 11:00:06,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:00:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-10 11:00:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 11:00:06,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:06,882 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:06,883 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:06,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:06,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-11-10 11:00:06,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:06,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:06,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:06,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:06,945 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-10 11:00:06,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:06,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 11:00:06,945 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:06,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:00:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:00:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:00:06,946 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-10 11:00:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:07,061 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-10 11:00:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:07,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-10 11:00:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:07,062 INFO L225 Difference]: With dead ends: 95 [2018-11-10 11:00:07,062 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 11:00:07,062 INFO L605 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-10 11:00:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 11:00:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2018-11-10 11:00:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 11:00:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-10 11:00:07,066 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2018-11-10 11:00:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:07,066 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-10 11:00:07,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:00:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-10 11:00:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 11:00:07,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:07,067 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:07,070 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:07,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-11-10 11:00:07,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,071 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:07,100 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-10 11:00:07,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:07,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:00:07,100 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:07,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:00:07,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:00:07,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:00:07,101 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-11-10 11:00:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:07,163 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-10 11:00:07,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:07,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-10 11:00:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:07,164 INFO L225 Difference]: With dead ends: 72 [2018-11-10 11:00:07,165 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 11:00:07,165 INFO L605 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-10 11:00:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 11:00:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-11-10 11:00:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 11:00:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-10 11:00:07,169 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2018-11-10 11:00:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:07,169 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-10 11:00:07,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:00:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-10 11:00:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 11:00:07,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:07,170 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:07,170 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:07,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:07,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-11-10 11:00:07,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:07,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:07,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:07,213 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-10 11:00:07,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:07,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:00:07,213 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:07,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:00:07,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:00:07,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:00:07,214 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-11-10 11:00:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:07,258 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-10 11:00:07,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:07,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-10 11:00:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:07,259 INFO L225 Difference]: With dead ends: 53 [2018-11-10 11:00:07,259 INFO L226 Difference]: Without dead ends: 51 [2018-11-10 11:00:07,259 INFO L605 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-10 11:00:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-10 11:00:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-10 11:00:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 11:00:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-10 11:00:07,262 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-11-10 11:00:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:07,263 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-10 11:00:07,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:00:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-10 11:00:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 11:00:07,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:07,263 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:07,264 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:07,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:07,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-11-10 11:00:07,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:07,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:07,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:07,349 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-10 11:00:07,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:07,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 11:00:07,349 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:07,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:00:07,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:00:07,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:00:07,350 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-11-10 11:00:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:07,432 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-10 11:00:07,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:07,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-10 11:00:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:07,433 INFO L225 Difference]: With dead ends: 51 [2018-11-10 11:00:07,433 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 11:00:07,434 INFO L605 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-10 11:00:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 11:00:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-10 11:00:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 11:00:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-10 11:00:07,436 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-10 11:00:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:07,437 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-10 11:00:07,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:00:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-10 11:00:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 11:00:07,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:07,437 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:07,438 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:07,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-11-10 11:00:07,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:07,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:07,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:07,469 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-10 11:00:07,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:07,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:00:07,469 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:07,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:00:07,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:00:07,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:00:07,470 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-10 11:00:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:07,529 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-10 11:00:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:07,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-10 11:00:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:07,531 INFO L225 Difference]: With dead ends: 69 [2018-11-10 11:00:07,531 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 11:00:07,531 INFO L605 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-10 11:00:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 11:00:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-10 11:00:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 11:00:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-10 11:00:07,534 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-10 11:00:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:07,535 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-10 11:00:07,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:00:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-10 11:00:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 11:00:07,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:07,535 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:07,536 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:07,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:07,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-11-10 11:00:07,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:07,609 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-10 11:00:07,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:07,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 11:00:07,609 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:07,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:00:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:00:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:00:07,610 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2018-11-10 11:00:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:07,726 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-10 11:00:07,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:07,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-10 11:00:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:07,727 INFO L225 Difference]: With dead ends: 57 [2018-11-10 11:00:07,727 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 11:00:07,727 INFO L605 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-10 11:00:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 11:00:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-10 11:00:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 11:00:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-10 11:00:07,730 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2018-11-10 11:00:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:07,730 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-10 11:00:07,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:00:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-10 11:00:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 11:00:07,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:07,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:07,731 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:07,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:07,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-11-10 11:00:07,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:07,813 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-10 11:00:07,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:07,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 11:00:07,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:07,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:00:07,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:00:07,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:00:07,815 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-10 11:00:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:07,913 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-10 11:00:07,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:00:07,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-10 11:00:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:07,914 INFO L225 Difference]: With dead ends: 41 [2018-11-10 11:00:07,914 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 11:00:07,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:00:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 11:00:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-10 11:00:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 11:00:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 11:00:07,920 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-11-10 11:00:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:07,920 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 11:00:07,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:00:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 11:00:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 11:00:07,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:07,921 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:00:07,921 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:07,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-11-10 11:00:07,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:07,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:07,966 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-10 11:00:07,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:07,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 11:00:07,966 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:07,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:00:07,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:00:07,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:00:07,967 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-10 11:00:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:08,079 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-10 11:00:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:08,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-10 11:00:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:08,079 INFO L225 Difference]: With dead ends: 52 [2018-11-10 11:00:08,080 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 11:00:08,080 INFO L605 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-10 11:00:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 11:00:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-10 11:00:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 11:00:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-10 11:00:08,083 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-11-10 11:00:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:08,083 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 11:00:08,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:00:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-10 11:00:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 11:00:08,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:08,084 INFO L375 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-10 11:00:08,085 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:08,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-11-10 11:00:08,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:08,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:08,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:08,111 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-10 11:00:08,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:08,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 11:00:08,112 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:08,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:00:08,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:00:08,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:00:08,112 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-11-10 11:00:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:08,165 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-10 11:00:08,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:08,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-10 11:00:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:08,165 INFO L225 Difference]: With dead ends: 39 [2018-11-10 11:00:08,166 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 11:00:08,166 INFO L605 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-10 11:00:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 11:00:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-10 11:00:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 11:00:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-10 11:00:08,169 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-11-10 11:00:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:08,170 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-10 11:00:08,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:00:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-10 11:00:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 11:00:08,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:00:08,170 INFO L375 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-10 11:00:08,171 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:00:08,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:00:08,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-11-10 11:00:08,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:00:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:08,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:00:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:00:08,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:00:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:00:08,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-10 11:00:08,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:00:08,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:00:08,214 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:00:08,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:00:08,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:00:08,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:00:08,215 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-11-10 11:00:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:00:08,270 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-10 11:00:08,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:00:08,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-10 11:00:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:00:08,270 INFO L225 Difference]: With dead ends: 37 [2018-11-10 11:00:08,270 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:00:08,270 INFO L605 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-10 11:00:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:00:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:00:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:00:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:00:08,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-10 11:00:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:00:08,271 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:00:08,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:00:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:00:08,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:00:08,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:00:08,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:00:08,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:00:08,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:00:08,467 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:00:08,467 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 11:00:08,468 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-11-10 11:00:08,468 INFO L425 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L428 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-11-10 11:00:08,469 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L421 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-10 11:00:08,470 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2018-11-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L421 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-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-10 11:00:08,470 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-11-10 11:00:08,471 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-11-10 11:00:08,471 INFO L425 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-11-10 11:00:08,471 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-11-10 11:00:08,471 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-11-10 11:00:08,471 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-11-10 11:00:08,472 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L421 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-10 11:00:08,473 INFO L421 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-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-10 11:00:08,473 INFO L425 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-10 11:00:08,474 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-11-10 11:00:08,474 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-11-10 11:00:08,474 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-10 11:00:08,474 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-11-10 11:00:08,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:00:08 BoogieIcfgContainer [2018-11-10 11:00:08,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:00:08,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:00:08,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:00:08,490 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:00:08,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:00:05" (3/4) ... [2018-11-10 11:00:08,493 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:00:08,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:00:08,499 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:00:08,504 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 11:00:08,504 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 11:00:08,557 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c5e7e28-c5a7-4d43-9b11-cbdca881ce28/bin-2019/utaipan/witness.graphml [2018-11-10 11:00:08,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:00:08,558 INFO L168 Benchmark]: Toolchain (without parser) took 3631.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 953.8 MB in the beginning and 929.7 MB in the end (delta: 24.1 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:00:08,559 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:00:08,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.68 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:00:08,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.00 ms. Allocated memory is still 1.0 GB. Free memory is still 940.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:00:08,560 INFO L168 Benchmark]: Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.0 GB. Free memory was 940.4 MB in the beginning and 937.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:00:08,560 INFO L168 Benchmark]: RCFGBuilder took 311.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:00:08,560 INFO L168 Benchmark]: TraceAbstraction took 3028.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 940.4 MB in the end (delta: 164.8 MB). Peak memory consumption was 230.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:00:08,561 INFO L168 Benchmark]: Witness Printer took 68.11 ms. Allocated memory is still 1.2 GB. Free memory was 940.4 MB in the beginning and 929.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:00:08,562 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.68 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.4 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 18.00 ms. Allocated memory is still 1.0 GB. Free memory is still 940.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.0 GB. Free memory was 940.4 MB in the beginning and 937.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3028.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 940.4 MB in the end (delta: 164.8 MB). Peak memory consumption was 230.4 MB. Max. memory is 11.5 GB. * Witness Printer took 68.11 ms. Allocated memory is still 1.2 GB. Free memory was 940.4 MB in the beginning and 929.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: 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: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: 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: 110]: 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: 80]: 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: 334]: 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: 184]: 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: 138]: 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: 150]: 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 - 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, 2.9s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s 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...