./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/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 75f71671f83387eb35a445031d63abe79f5c0c7c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:42:23,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:42:23,103 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:42:23,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:42:23,109 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:42:23,109 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:42:23,110 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:42:23,111 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:42:23,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:42:23,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:42:23,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:42:23,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:42:23,113 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:42:23,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:42:23,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:42:23,115 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:42:23,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:42:23,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:42:23,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:42:23,117 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:42:23,118 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:42:23,118 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:42:23,119 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:42:23,120 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:42:23,120 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:42:23,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:42:23,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:42:23,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:42:23,121 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:42:23,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:42:23,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:42:23,122 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:42:23,122 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:42:23,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:42:23,123 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:42:23,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:42:23,124 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:42:23,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:42:23,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:42:23,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:42:23,131 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:42:23,131 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:42:23,131 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:42:23,132 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:42:23,132 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:42:23,132 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:42:23,132 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:42:23,132 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:42:23,132 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:42:23,132 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:42:23,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:42:23,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:42:23,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:42:23,134 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:42:23,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:42:23,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:42:23,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:42:23,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:42:23,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:42:23,134 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:42:23,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:42:23,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:42:23,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:42:23,134 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_c496a6c5-0cd8-4f87-9db4-176d02d378bf/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 -> 75f71671f83387eb35a445031d63abe79f5c0c7c [2018-12-09 00:42:23,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:42:23,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:42:23,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:42:23,163 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:42:23,163 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:42:23,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-12-09 00:42:23,200 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/data/46bbab546/211fd2f450914ea487f30002d8746559/FLAG0e43b309d [2018-12-09 00:42:23,624 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:42:23,624 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-12-09 00:42:23,628 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/data/46bbab546/211fd2f450914ea487f30002d8746559/FLAG0e43b309d [2018-12-09 00:42:23,636 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/data/46bbab546/211fd2f450914ea487f30002d8746559 [2018-12-09 00:42:23,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:42:23,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:42:23,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:42:23,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:42:23,642 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:42:23,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2817da2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23, skipping insertion in model container [2018-12-09 00:42:23,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:42:23,665 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:42:23,771 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:42:23,774 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:42:23,793 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:42:23,801 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:42:23,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23 WrapperNode [2018-12-09 00:42:23,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:42:23,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:42:23,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:42:23,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:42:23,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:42:23,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:42:23,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:42:23,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:42:23,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... [2018-12-09 00:42:23,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:42:23,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:42:23,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:42:23,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:42:23,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/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-12-09 00:42:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:42:23,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:42:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:42:23,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:42:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:42:23,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:42:24,079 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:42:24,079 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 00:42:24,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:42:24 BoogieIcfgContainer [2018-12-09 00:42:24,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:42:24,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:42:24,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:42:24,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:42:24,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:42:23" (1/3) ... [2018-12-09 00:42:24,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb927e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:42:24, skipping insertion in model container [2018-12-09 00:42:24,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:23" (2/3) ... [2018-12-09 00:42:24,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb927e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:42:24, skipping insertion in model container [2018-12-09 00:42:24,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:42:24" (3/3) ... [2018-12-09 00:42:24,086 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-12-09 00:42:24,092 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:42:24,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-12-09 00:42:24,107 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-12-09 00:42:24,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:42:24,126 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:42:24,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:42:24,126 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:42:24,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:42:24,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:42:24,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:42:24,127 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:42:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-12-09 00:42:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 00:42:24,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:24,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:24,144 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:24,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:24,147 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2018-12-09 00:42:24,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:24,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:24,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:24,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:24,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:24,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:24,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:24,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:24,271 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2018-12-09 00:42:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:24,384 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2018-12-09 00:42:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:24,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-09 00:42:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:24,391 INFO L225 Difference]: With dead ends: 127 [2018-12-09 00:42:24,391 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 00:42:24,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:42:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 00:42:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2018-12-09 00:42:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 00:42:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-12-09 00:42:24,418 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2018-12-09 00:42:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:24,418 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-12-09 00:42:24,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-12-09 00:42:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 00:42:24,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:24,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:24,419 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:24,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2018-12-09 00:42:24,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:24,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:24,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:24,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:24,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:24,455 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2018-12-09 00:42:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:24,516 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-12-09 00:42:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:24,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-09 00:42:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:24,517 INFO L225 Difference]: With dead ends: 111 [2018-12-09 00:42:24,517 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 00:42:24,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:42:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 00:42:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2018-12-09 00:42:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-09 00:42:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-12-09 00:42:24,522 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2018-12-09 00:42:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:24,523 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-09 00:42:24,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-12-09 00:42:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:42:24,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:24,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:24,523 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:24,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2018-12-09 00:42:24,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:24,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:24,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:24,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:24,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:24,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:24,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:24,562 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-12-09 00:42:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:24,644 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-12-09 00:42:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:24,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 00:42:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:24,645 INFO L225 Difference]: With dead ends: 109 [2018-12-09 00:42:24,645 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 00:42:24,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 00:42:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2018-12-09 00:42:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 00:42:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-12-09 00:42:24,649 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2018-12-09 00:42:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:24,649 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-12-09 00:42:24,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-12-09 00:42:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:42:24,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:24,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:24,650 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:24,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2018-12-09 00:42:24,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:24,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:24,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:24,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:24,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:24,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:24,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:24,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:24,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:24,686 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-12-09 00:42:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:24,776 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-12-09 00:42:24,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:24,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 00:42:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:24,777 INFO L225 Difference]: With dead ends: 105 [2018-12-09 00:42:24,777 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 00:42:24,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 00:42:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 67. [2018-12-09 00:42:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 00:42:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-12-09 00:42:24,782 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2018-12-09 00:42:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:24,782 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-09 00:42:24,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-12-09 00:42:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 00:42:24,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:24,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:24,783 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:24,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:24,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2018-12-09 00:42:24,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:24,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:24,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:24,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-12-09 00:42:24,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:24,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:24,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:24,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:24,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:24,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:24,814 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-12-09 00:42:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:24,907 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-12-09 00:42:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:24,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 00:42:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:24,908 INFO L225 Difference]: With dead ends: 150 [2018-12-09 00:42:24,908 INFO L226 Difference]: Without dead ends: 148 [2018-12-09 00:42:24,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-09 00:42:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 65. [2018-12-09 00:42:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:42:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-09 00:42:24,912 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2018-12-09 00:42:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:24,912 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-09 00:42:24,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-09 00:42:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 00:42:24,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:24,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:24,914 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:24,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:24,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2018-12-09 00:42:24,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:24,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:24,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:24,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:24,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:24,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:24,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:24,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:24,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:24,944 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-12-09 00:42:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:25,009 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-12-09 00:42:25,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:25,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 00:42:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:25,009 INFO L225 Difference]: With dead ends: 101 [2018-12-09 00:42:25,010 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 00:42:25,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 00:42:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2018-12-09 00:42:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 00:42:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-09 00:42:25,014 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2018-12-09 00:42:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:25,014 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-09 00:42:25,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-12-09 00:42:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 00:42:25,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:25,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:25,016 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:25,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:25,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2018-12-09 00:42:25,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:25,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:25,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:25,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:25,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:25,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:25,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:25,046 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-12-09 00:42:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:25,136 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-12-09 00:42:25,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:25,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 00:42:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:25,137 INFO L225 Difference]: With dead ends: 99 [2018-12-09 00:42:25,137 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 00:42:25,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:42:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 00:42:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2018-12-09 00:42:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 00:42:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-12-09 00:42:25,142 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2018-12-09 00:42:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:25,142 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-12-09 00:42:25,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-12-09 00:42:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 00:42:25,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:25,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:25,143 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:25,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2018-12-09 00:42:25,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:25,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:25,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:25,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:25,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:25,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:25,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:25,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:25,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:25,187 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-12-09 00:42:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:25,264 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-12-09 00:42:25,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:25,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 00:42:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:25,265 INFO L225 Difference]: With dead ends: 93 [2018-12-09 00:42:25,265 INFO L226 Difference]: Without dead ends: 87 [2018-12-09 00:42:25,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:42:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-09 00:42:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2018-12-09 00:42:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 00:42:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-09 00:42:25,273 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2018-12-09 00:42:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:25,274 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-09 00:42:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-09 00:42:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:42:25,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:25,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:25,275 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:25,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:25,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2018-12-09 00:42:25,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:25,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:25,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:42:25,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:25,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:42:25,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:42:25,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:25,340 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 9 states. [2018-12-09 00:42:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:25,437 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-12-09 00:42:25,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:25,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-09 00:42:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:25,438 INFO L225 Difference]: With dead ends: 94 [2018-12-09 00:42:25,438 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 00:42:25,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:42:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 00:42:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2018-12-09 00:42:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 00:42:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-12-09 00:42:25,442 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2018-12-09 00:42:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:25,442 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-12-09 00:42:25,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:42:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-12-09 00:42:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:42:25,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:25,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:25,443 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:25,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2018-12-09 00:42:25,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:25,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:25,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:42:25,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:25,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:42:25,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:42:25,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:25,497 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 9 states. [2018-12-09 00:42:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:25,591 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-12-09 00:42:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:25,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-09 00:42:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:25,592 INFO L225 Difference]: With dead ends: 85 [2018-12-09 00:42:25,592 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 00:42:25,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:42:25,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 00:42:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2018-12-09 00:42:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 00:42:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-12-09 00:42:25,595 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-12-09 00:42:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:25,596 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-09 00:42:25,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:42:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-12-09 00:42:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:42:25,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:25,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:25,596 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:25,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2018-12-09 00:42:25,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:25,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:25,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:25,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:25,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:25,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:25,619 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-12-09 00:42:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:25,689 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-12-09 00:42:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:25,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-09 00:42:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:25,689 INFO L225 Difference]: With dead ends: 115 [2018-12-09 00:42:25,689 INFO L226 Difference]: Without dead ends: 113 [2018-12-09 00:42:25,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-09 00:42:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 49. [2018-12-09 00:42:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 00:42:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-12-09 00:42:25,693 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2018-12-09 00:42:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:25,693 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-12-09 00:42:25,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:25,693 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-12-09 00:42:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:42:25,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:25,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:25,693 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:25,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:25,694 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2018-12-09 00:42:25,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:25,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:25,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:25,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:25,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:25,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:25,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:25,717 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-12-09 00:42:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:25,773 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-12-09 00:42:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:25,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-09 00:42:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:25,773 INFO L225 Difference]: With dead ends: 77 [2018-12-09 00:42:25,773 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 00:42:25,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 00:42:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 47. [2018-12-09 00:42:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 00:42:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-12-09 00:42:25,777 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-12-09 00:42:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:25,777 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-12-09 00:42:25,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-12-09 00:42:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:42:25,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:25,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:25,777 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:25,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2018-12-09 00:42:25,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:25,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:25,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:25,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:25,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:25,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:25,804 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-12-09 00:42:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:25,882 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-12-09 00:42:25,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:25,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 00:42:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:25,882 INFO L225 Difference]: With dead ends: 113 [2018-12-09 00:42:25,882 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 00:42:25,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 00:42:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 45. [2018-12-09 00:42:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 00:42:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-09 00:42:25,885 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-12-09 00:42:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:25,886 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-09 00:42:25,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-09 00:42:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:42:25,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:25,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:25,886 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:25,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2018-12-09 00:42:25,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:25,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:25,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:25,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:42:25,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:25,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:42:25,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:42:25,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:25,931 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 9 states. [2018-12-09 00:42:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:26,009 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-12-09 00:42:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:26,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-09 00:42:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:26,010 INFO L225 Difference]: With dead ends: 60 [2018-12-09 00:42:26,010 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 00:42:26,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:42:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 00:42:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2018-12-09 00:42:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 00:42:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-09 00:42:26,014 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-12-09 00:42:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:26,014 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-09 00:42:26,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:42:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-09 00:42:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:42:26,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:26,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:26,015 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:26,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2018-12-09 00:42:26,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:26,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:26,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:26,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:26,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:26,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:42:26,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:26,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:42:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:42:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:26,066 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-12-09 00:42:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:26,149 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-09 00:42:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:26,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-09 00:42:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:26,150 INFO L225 Difference]: With dead ends: 44 [2018-12-09 00:42:26,150 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 00:42:26,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:42:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 00:42:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-12-09 00:42:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 00:42:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-09 00:42:26,153 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-12-09 00:42:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:26,153 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 00:42:26,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:42:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-09 00:42:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:42:26,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:26,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:26,154 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:26,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2018-12-09 00:42:26,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:26,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:26,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:26,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:26,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:42:26,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:26,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:42:26,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:42:26,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:42:26,205 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-12-09 00:42:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:26,300 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-12-09 00:42:26,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:26,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-12-09 00:42:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:26,301 INFO L225 Difference]: With dead ends: 55 [2018-12-09 00:42:26,301 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 00:42:26,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:42:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 00:42:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-12-09 00:42:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 00:42:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-09 00:42:26,304 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2018-12-09 00:42:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:26,305 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-09 00:42:26,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:42:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-12-09 00:42:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:42:26,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:26,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:26,305 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:26,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2018-12-09 00:42:26,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:26,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:26,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:26,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:26,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:42:26,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:26,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:42:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:42:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:42:26,334 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2018-12-09 00:42:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:26,396 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-12-09 00:42:26,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:26,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-09 00:42:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:26,397 INFO L225 Difference]: With dead ends: 53 [2018-12-09 00:42:26,397 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 00:42:26,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:42:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 00:42:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-12-09 00:42:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 00:42:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-09 00:42:26,402 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2018-12-09 00:42:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:26,402 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-09 00:42:26,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:42:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-09 00:42:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:42:26,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:26,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:26,403 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:26,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:26,403 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2018-12-09 00:42:26,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:26,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:26,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:26,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:26,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:26,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:26,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:26,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:26,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:26,426 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-12-09 00:42:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:26,508 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-09 00:42:26,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:26,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 00:42:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:26,509 INFO L225 Difference]: With dead ends: 49 [2018-12-09 00:42:26,509 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:42:26,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:42:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:42:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:42:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:42:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:42:26,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-09 00:42:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:26,509 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:42:26,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:42:26,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:42:26,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:42:26,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:26,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:26,726 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 13 [2018-12-09 00:42:26,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:42:26,728 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:42:26,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:42:26,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:42:26,728 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 00:42:26,728 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:42:26,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:42:26,728 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2018-12-09 00:42:26,728 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L451 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2018-12-09 00:42:26,729 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L444 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2018-12-09 00:42:26,730 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-12-09 00:42:26,731 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L444 ceAbstractionStarter]: At program point L379(lines 277 386) 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-12-09 00:42:26,732 INFO L444 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (or (<= 1 main_~main__t~0) (= main_~__VERIFIER_assert__cond~0 1)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2018-12-09 00:42:26,732 INFO L448 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L444 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2018-12-09 00:42:26,733 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-09 00:42:26,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:42:26 BoogieIcfgContainer [2018-12-09 00:42:26,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:42:26,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:42:26,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:42:26,744 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:42:26,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:42:24" (3/4) ... [2018-12-09 00:42:26,746 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:42:26,751 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:42:26,751 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:42:26,756 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 00:42:26,756 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 00:42:26,809 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c496a6c5-0cd8-4f87-9db4-176d02d378bf/bin-2019/utaipan/witness.graphml [2018-12-09 00:42:26,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:42:26,810 INFO L168 Benchmark]: Toolchain (without parser) took 3172.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 952.4 MB in the beginning and 976.0 MB in the end (delta: -23.6 MB). Peak memory consumption was 112.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:42:26,811 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:42:26,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:42:26,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.10 ms. Allocated memory is still 1.0 GB. Free memory is still 936.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:42:26,811 INFO L168 Benchmark]: Boogie Preprocessor took 51.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:42:26,812 INFO L168 Benchmark]: RCFGBuilder took 210.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:42:26,812 INFO L168 Benchmark]: TraceAbstraction took 2663.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 982.2 MB in the end (delta: 76.0 MB). Peak memory consumption was 124.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:42:26,812 INFO L168 Benchmark]: Witness Printer took 66.26 ms. Allocated memory is still 1.2 GB. Free memory was 982.2 MB in the beginning and 976.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:42:26,814 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.10 ms. Allocated memory is still 1.0 GB. Free memory is still 936.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 210.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2663.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 982.2 MB in the end (delta: 76.0 MB). Peak memory consumption was 124.2 MB. Max. memory is 11.5 GB. * Witness Printer took 66.26 ms. Allocated memory is still 1.2 GB. Free memory was 982.2 MB in the beginning and 976.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((1 <= main__t || __VERIFIER_assert__cond == 1) && main__t + 1 <= main__tagbuf_len) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. SAFE Result, 2.6s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 872 SDtfs, 2467 SDslu, 1673 SDs, 0 SdLazy, 1819 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred 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, 614 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 54 HoareAnnotationTreeSize, 9 FomulaSimplifications, 9989709 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 16618 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 11454 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...