./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cbb495583d601bf9f19d9da57531415381b22d5a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:05:11,249 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:05:11,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:05:11,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:05:11,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:05:11,259 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:05:11,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:05:11,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:05:11,261 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:05:11,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:05:11,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:05:11,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:05:11,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:05:11,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:05:11,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:05:11,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:05:11,264 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:05:11,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:05:11,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:05:11,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:05:11,267 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:05:11,268 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:05:11,270 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:05:11,270 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:05:11,270 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:05:11,271 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:05:11,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:05:11,271 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:05:11,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:05:11,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:05:11,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:05:11,273 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:05:11,273 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:05:11,273 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:05:11,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:05:11,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:05:11,274 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 09:05:11,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:05:11,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:05:11,282 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:05:11,282 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:05:11,282 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:05:11,282 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:05:11,282 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:05:11,282 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:05:11,283 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:05:11,283 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:05:11,283 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:05:11,283 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:05:11,283 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:05:11,284 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:05:11,284 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:05:11,284 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:05:11,284 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:05:11,284 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:05:11,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:05:11,285 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:05:11,285 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:05:11,285 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:05:11,285 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:05:11,285 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 09:05:11,285 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:05:11,285 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:05:11,286 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:05:11,286 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:05:11,286 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:05:11,286 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:05:11,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:05:11,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:05:11,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:05:11,287 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:05:11,287 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:05:11,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:05:11,287 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_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> cbb495583d601bf9f19d9da57531415381b22d5a [2018-12-09 09:05:11,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:05:11,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:05:11,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:05:11,319 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:05:11,320 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:05:11,320 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:05:11,355 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/data/60909959f/319a1ec43fc74b81a786a044617a1486/FLAGd4bfb05ce [2018-12-09 09:05:11,774 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:05:11,775 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:05:11,781 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/data/60909959f/319a1ec43fc74b81a786a044617a1486/FLAGd4bfb05ce [2018-12-09 09:05:11,789 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/data/60909959f/319a1ec43fc74b81a786a044617a1486 [2018-12-09 09:05:11,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:05:11,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:05:11,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:05:11,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:05:11,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:05:11,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:05:11" (1/1) ... [2018-12-09 09:05:11,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e9f722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:11, skipping insertion in model container [2018-12-09 09:05:11,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:05:11" (1/1) ... [2018-12-09 09:05:11,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:05:11,818 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:05:11,956 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:05:11,962 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:05:12,021 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:05:12,050 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:05:12,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12 WrapperNode [2018-12-09 09:05:12,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:05:12,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:05:12,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:05:12,051 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:05:12,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... [2018-12-09 09:05:12,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... [2018-12-09 09:05:12,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:05:12,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:05:12,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:05:12,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:05:12,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... [2018-12-09 09:05:12,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... [2018-12-09 09:05:12,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... [2018-12-09 09:05:12,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... [2018-12-09 09:05:12,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... [2018-12-09 09:05:12,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... [2018-12-09 09:05:12,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... [2018-12-09 09:05:12,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:05:12,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:05:12,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:05:12,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:05:12,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/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 09:05:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:05:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 09:05:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-12-09 09:05:12,116 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-12-09 09:05:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:05:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:05:12,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:05:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:05:12,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:05:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:05:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:05:12,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:05:12,271 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:05:12,271 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 09:05:12,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:05:12 BoogieIcfgContainer [2018-12-09 09:05:12,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:05:12,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:05:12,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:05:12,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:05:12,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:05:11" (1/3) ... [2018-12-09 09:05:12,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1664cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:05:12, skipping insertion in model container [2018-12-09 09:05:12,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:05:12" (2/3) ... [2018-12-09 09:05:12,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1664cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:05:12, skipping insertion in model container [2018-12-09 09:05:12,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:05:12" (3/3) ... [2018-12-09 09:05:12,276 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:05:12,282 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:05:12,286 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 09:05:12,296 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 09:05:12,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:05:12,311 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:05:12,311 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:05:12,311 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:05:12,311 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:05:12,312 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:05:12,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:05:12,312 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:05:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-12-09 09:05:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:05:12,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:12,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:12,328 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:12,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:12,331 INFO L82 PathProgramCache]: Analyzing trace with hash 460461903, now seen corresponding path program 1 times [2018-12-09 09:05:12,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:12,429 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 09:05:12,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:12,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:05:12,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:12,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:05:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:05:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:05:12,443 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-12-09 09:05:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:12,478 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-12-09 09:05:12,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:05:12,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:05:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:12,485 INFO L225 Difference]: With dead ends: 44 [2018-12-09 09:05:12,485 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 09:05:12,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:05:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 09:05:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 09:05:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 09:05:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-12-09 09:05:12,507 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 10 [2018-12-09 09:05:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:12,507 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-12-09 09:05:12,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:05:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-12-09 09:05:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:05:12,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:12,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:12,508 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:12,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash 460461904, now seen corresponding path program 1 times [2018-12-09 09:05:12,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:12,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:12,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:12,546 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 09:05:12,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:12,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:05:12,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:12,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:05:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:05:12,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:05:12,547 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2018-12-09 09:05:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:12,561 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-09 09:05:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:05:12,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 09:05:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:12,561 INFO L225 Difference]: With dead ends: 40 [2018-12-09 09:05:12,562 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 09:05:12,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:05:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 09:05:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 09:05:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 09:05:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-09 09:05:12,564 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 10 [2018-12-09 09:05:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:12,565 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-09 09:05:12,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:05:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-09 09:05:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 09:05:12,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:12,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:12,565 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:12,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:12,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1389417133, now seen corresponding path program 1 times [2018-12-09 09:05:12,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:12,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:12,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:12,588 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 09:05:12,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:12,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:05:12,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:12,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:05:12,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:05:12,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:05:12,589 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2018-12-09 09:05:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:12,612 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-12-09 09:05:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:05:12,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 09:05:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:12,613 INFO L225 Difference]: With dead ends: 39 [2018-12-09 09:05:12,613 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 09:05:12,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:05:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 09:05:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 09:05:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 09:05:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-09 09:05:12,615 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2018-12-09 09:05:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:12,615 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-09 09:05:12,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:05:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-09 09:05:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 09:05:12,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:12,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:12,616 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:12,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1389417134, now seen corresponding path program 1 times [2018-12-09 09:05:12,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:12,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:12,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:12,653 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 09:05:12,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:12,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:05:12,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:12,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:05:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:05:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:05:12,654 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2018-12-09 09:05:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:12,675 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-09 09:05:12,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:05:12,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 09:05:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:12,675 INFO L225 Difference]: With dead ends: 38 [2018-12-09 09:05:12,676 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 09:05:12,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:05:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 09:05:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 09:05:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 09:05:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-09 09:05:12,678 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 11 [2018-12-09 09:05:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:12,678 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-09 09:05:12,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:05:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-09 09:05:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 09:05:12,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:12,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:12,678 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:12,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1526014239, now seen corresponding path program 1 times [2018-12-09 09:05:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:12,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:12,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:12,703 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 09:05:12,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:12,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:05:12,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:12,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:05:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:05:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:05:12,704 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-12-09 09:05:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:12,743 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-09 09:05:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:05:12,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 09:05:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:12,744 INFO L225 Difference]: With dead ends: 36 [2018-12-09 09:05:12,744 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 09:05:12,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:05:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 09:05:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 09:05:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 09:05:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-12-09 09:05:12,746 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2018-12-09 09:05:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:12,747 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-12-09 09:05:12,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:05:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-12-09 09:05:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 09:05:12,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:12,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:12,747 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:12,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1526014240, now seen corresponding path program 1 times [2018-12-09 09:05:12,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:12,793 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 09:05:12,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:12,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:05:12,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:12,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:05:12,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:05:12,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:05:12,794 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 7 states. [2018-12-09 09:05:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:12,860 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-12-09 09:05:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:05:12,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-09 09:05:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:12,862 INFO L225 Difference]: With dead ends: 50 [2018-12-09 09:05:12,862 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 09:05:12,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:05:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 09:05:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-12-09 09:05:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 09:05:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-09 09:05:12,865 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2018-12-09 09:05:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:12,865 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-09 09:05:12,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:05:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-09 09:05:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 09:05:12,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:12,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:12,866 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:12,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1915835104, now seen corresponding path program 1 times [2018-12-09 09:05:12,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:12,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:12,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:12,894 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 09:05:12,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:12,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:05:12,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:12,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:05:12,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:05:12,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:05:12,895 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 6 states. [2018-12-09 09:05:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:12,952 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-09 09:05:12,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:05:12,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 09:05:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:12,953 INFO L225 Difference]: With dead ends: 40 [2018-12-09 09:05:12,953 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 09:05:12,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:05:12,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 09:05:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 09:05:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 09:05:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 09:05:12,955 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 16 [2018-12-09 09:05:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:12,955 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 09:05:12,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:05:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 09:05:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 09:05:12,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:12,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:12,956 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:12,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1915835105, now seen corresponding path program 1 times [2018-12-09 09:05:12,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:12,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:12,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:12,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:13,022 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 09:05:13,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:13,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:05:13,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:13,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:05:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:05:13,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:05:13,024 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 8 states. [2018-12-09 09:05:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:13,088 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-09 09:05:13,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:05:13,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 09:05:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:13,089 INFO L225 Difference]: With dead ends: 40 [2018-12-09 09:05:13,089 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 09:05:13,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:05:13,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 09:05:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 09:05:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 09:05:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-09 09:05:13,091 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 16 [2018-12-09 09:05:13,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:13,091 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-09 09:05:13,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:05:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-09 09:05:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 09:05:13,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:13,092 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 09:05:13,092 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:13,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:13,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1423435423, now seen corresponding path program 1 times [2018-12-09 09:05:13,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:13,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:13,119 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 09:05:13,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:13,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:05:13,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:13,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:05:13,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:05:13,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:05:13,120 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-12-09 09:05:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:13,164 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-09 09:05:13,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:05:13,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 09:05:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:13,164 INFO L225 Difference]: With dead ends: 39 [2018-12-09 09:05:13,164 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 09:05:13,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:05:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 09:05:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 09:05:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 09:05:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-09 09:05:13,167 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-12-09 09:05:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:13,167 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 09:05:13,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:05:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-09 09:05:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 09:05:13,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:13,167 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 09:05:13,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:13,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1423435422, now seen corresponding path program 1 times [2018-12-09 09:05:13,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:13,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:13,222 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 09:05:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:13,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:05:13,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:13,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:05:13,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:05:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:05:13,223 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2018-12-09 09:05:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:13,270 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-09 09:05:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:05:13,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-09 09:05:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:13,272 INFO L225 Difference]: With dead ends: 48 [2018-12-09 09:05:13,272 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 09:05:13,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:05:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 09:05:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-12-09 09:05:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 09:05:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-09 09:05:13,275 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-12-09 09:05:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:13,276 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-09 09:05:13,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:05:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-09 09:05:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:05:13,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:13,276 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 09:05:13,277 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:13,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:13,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2121891282, now seen corresponding path program 1 times [2018-12-09 09:05:13,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:13,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:13,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:13,310 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 09:05:13,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:13,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:05:13,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:13,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:05:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:05:13,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:05:13,312 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-12-09 09:05:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:13,371 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-09 09:05:13,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:05:13,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 09:05:13,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:13,372 INFO L225 Difference]: With dead ends: 39 [2018-12-09 09:05:13,372 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 09:05:13,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:05:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 09:05:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 09:05:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 09:05:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-09 09:05:13,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2018-12-09 09:05:13,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:13,374 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 09:05:13,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:05:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-09 09:05:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:05:13,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:13,375 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 09:05:13,375 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:13,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash -2121891281, now seen corresponding path program 1 times [2018-12-09 09:05:13,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:13,447 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 09:05:13,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:13,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 09:05:13,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:13,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:05:13,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:05:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:05:13,448 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2018-12-09 09:05:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:13,555 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-12-09 09:05:13,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:05:13,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-09 09:05:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:13,556 INFO L225 Difference]: With dead ends: 47 [2018-12-09 09:05:13,556 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 09:05:13,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:05:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 09:05:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-12-09 09:05:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 09:05:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-09 09:05:13,559 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-12-09 09:05:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:13,559 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-09 09:05:13,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:05:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-09 09:05:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:05:13,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:13,560 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 09:05:13,560 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:13,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2121841552, now seen corresponding path program 1 times [2018-12-09 09:05:13,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:13,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:13,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 09:05:13,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:13,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:05:13,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:05:13,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:05:13,647 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2018-12-09 09:05:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:13,728 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-09 09:05:13,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:05:13,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-12-09 09:05:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:13,729 INFO L225 Difference]: With dead ends: 64 [2018-12-09 09:05:13,729 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 09:05:13,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:05:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 09:05:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-12-09 09:05:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 09:05:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-12-09 09:05:13,731 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 20 [2018-12-09 09:05:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:13,732 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-12-09 09:05:13,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:05:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-12-09 09:05:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:05:13,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:13,732 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 09:05:13,732 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:13,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:13,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1162008494, now seen corresponding path program 1 times [2018-12-09 09:05:13,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:13,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:13,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:13,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:13,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:13,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:13,856 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-09 09:05:13,857 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [10], [11], [18], [19], [25], [41], [46], [50], [54], [55], [58], [65], [66], [67], [69] [2018-12-09 09:05:13,878 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:13,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:14,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:14,010 INFO L272 AbstractInterpreter]: Visited 20 different actions 34 times. Merged at 7 different actions 14 times. Never widened. Performed 312 root evaluator evaluations with a maximum evaluation depth of 3. Performed 312 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-09 09:05:14,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:14,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:14,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:14,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:14,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:14,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:14,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:14,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:05:14,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:05:14,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 09:05:14,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-09 09:05:14,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-09 09:05:14,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-09 09:05:14,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,220 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-12-09 09:05:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:14,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:14,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 09:05:14,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 09:05:14,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-12-09 09:05:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:14,367 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:05:14,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [9] total 23 [2018-12-09 09:05:14,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:14,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:05:14,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:05:14,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-12-09 09:05:14,368 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 11 states. [2018-12-09 09:05:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:14,523 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-12-09 09:05:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:05:14,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-09 09:05:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:14,524 INFO L225 Difference]: With dead ends: 96 [2018-12-09 09:05:14,524 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 09:05:14,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2018-12-09 09:05:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 09:05:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 59. [2018-12-09 09:05:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 09:05:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-12-09 09:05:14,527 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 20 [2018-12-09 09:05:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:14,527 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-12-09 09:05:14,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:05:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-12-09 09:05:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:05:14,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:14,527 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 09:05:14,527 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:14,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash 575202480, now seen corresponding path program 1 times [2018-12-09 09:05:14,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:14,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:14,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:14,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:14,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:14,642 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-09 09:05:14,642 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [10], [11], [18], [19], [25], [41], [46], [52], [54], [55], [58], [65], [66], [67], [69] [2018-12-09 09:05:14,643 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:14,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:14,702 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:14,702 INFO L272 AbstractInterpreter]: Visited 20 different actions 41 times. Merged at 7 different actions 21 times. Widened at 1 different actions 1 times. Performed 394 root evaluator evaluations with a maximum evaluation depth of 3. Performed 394 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-09 09:05:14,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:14,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:14,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:14,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:14,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:14,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:14,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:14,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:05:14,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 09:05:14,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 09:05:14,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:05:14,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:05:14,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 09:05:14,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 09:05:14,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:05:14,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 09:05:14,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 09:05:14,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-09 09:05:14,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 09:05:14,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:14,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 09:05:14,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:14,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:14,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:14,935 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-09 09:05:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:14,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:15,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 09:05:15,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:15,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 09:05:15,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 09:05:15,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:15,139 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:15,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:15,146 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-09 09:05:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:15,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:05:15,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2018-12-09 09:05:15,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:05:15,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 09:05:15,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 09:05:15,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-12-09 09:05:15,175 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 17 states. [2018-12-09 09:05:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:15,874 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-12-09 09:05:15,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:05:15,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-12-09 09:05:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:15,876 INFO L225 Difference]: With dead ends: 77 [2018-12-09 09:05:15,876 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 09:05:15,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2018-12-09 09:05:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 09:05:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-12-09 09:05:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 09:05:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-12-09 09:05:15,881 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2018-12-09 09:05:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:15,881 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-12-09 09:05:15,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 09:05:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-12-09 09:05:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 09:05:15,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:15,882 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:15,883 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:15,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1281199503, now seen corresponding path program 1 times [2018-12-09 09:05:15,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:15,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:15,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:15,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:15,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:16,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:16,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:16,040 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 09:05:16,040 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [10], [11], [13], [18], [19], [25], [41], [46], [52], [54], [55], [58], [65], [66], [67], [69] [2018-12-09 09:05:16,041 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:16,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:16,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:16,076 INFO L272 AbstractInterpreter]: Visited 20 different actions 34 times. Merged at 7 different actions 14 times. Never widened. Performed 305 root evaluator evaluations with a maximum evaluation depth of 3. Performed 305 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-09 09:05:16,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:16,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:16,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:16,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:16,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:16,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:16,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:16,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 09:05:16,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:05:16,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:05:16,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 09:05:16,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-09 09:05:16,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-12-09 09:05:16,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:16,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-09 09:05:16,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 09:05:16,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-12-09 09:05:16,352 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:16,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:05:16,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:16,376 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-12-09 09:05:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:16,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:16,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 09:05:16,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-09 09:05:16,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-09 09:05:16,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-09 09:05:16,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-09 09:05:16,792 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:16,804 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-12-09 09:05:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:16,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:05:16,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2018-12-09 09:05:16,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:05:16,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 09:05:16,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 09:05:16,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2018-12-09 09:05:16,828 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 22 states. [2018-12-09 09:05:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:18,800 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-12-09 09:05:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 09:05:18,800 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-09 09:05:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:18,801 INFO L225 Difference]: With dead ends: 65 [2018-12-09 09:05:18,801 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 09:05:18,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 09:05:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 09:05:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 09:05:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 09:05:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-12-09 09:05:18,806 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2018-12-09 09:05:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:18,806 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-12-09 09:05:18,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 09:05:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-12-09 09:05:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 09:05:18,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:18,807 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, 1, 1] [2018-12-09 09:05:18,807 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:18,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1546966779, now seen corresponding path program 1 times [2018-12-09 09:05:18,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:18,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:18,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:18,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:18,845 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 09:05:18,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:05:18,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:05:18,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:18,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:05:18,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:05:18,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:05:18,845 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2018-12-09 09:05:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:18,873 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-12-09 09:05:18,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:05:18,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-09 09:05:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:18,873 INFO L225 Difference]: With dead ends: 64 [2018-12-09 09:05:18,873 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 09:05:18,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:05:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 09:05:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 09:05:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 09:05:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-09 09:05:18,874 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 23 [2018-12-09 09:05:18,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:18,875 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-09 09:05:18,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:05:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-09 09:05:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 09:05:18,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:18,875 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:18,875 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:18,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1422890226, now seen corresponding path program 1 times [2018-12-09 09:05:18,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:18,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:18,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:18,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:18,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:18,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:18,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:18,924 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 09:05:18,924 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [10], [11], [18], [19], [21], [25], [41], [46], [52], [54], [55], [58], [65], [66], [67], [69] [2018-12-09 09:05:18,925 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:18,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:18,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:18,956 INFO L272 AbstractInterpreter]: Visited 20 different actions 38 times. Merged at 7 different actions 18 times. Never widened. Performed 366 root evaluator evaluations with a maximum evaluation depth of 3. Performed 366 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-09 09:05:18,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:18,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:18,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:18,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:18,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:18,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:18,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:18,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:19,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-12-09 09:05:19,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-09 09:05:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:19,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:05:19,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-09 09:05:19,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:05:19,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:05:19,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:05:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:05:19,048 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 10 states. [2018-12-09 09:05:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:19,119 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-12-09 09:05:19,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:05:19,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-09 09:05:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:19,119 INFO L225 Difference]: With dead ends: 36 [2018-12-09 09:05:19,119 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 09:05:19,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:05:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 09:05:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-09 09:05:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 09:05:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-09 09:05:19,120 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2018-12-09 09:05:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:19,120 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-09 09:05:19,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:05:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-09 09:05:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:05:19,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:19,121 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:19,121 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:19,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1597856191, now seen corresponding path program 1 times [2018-12-09 09:05:19,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:19,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:19,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:19,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:19,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:19,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:19,176 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 09:05:19,176 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [10], [11], [16], [18], [19], [25], [29], [32], [35], [41], [46], [52], [54], [55], [58], [65], [66], [67], [69] [2018-12-09 09:05:19,177 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:05:19,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:05:19,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:05:19,236 INFO L272 AbstractInterpreter]: Visited 23 different actions 57 times. Merged at 10 different actions 32 times. Never widened. Performed 565 root evaluator evaluations with a maximum evaluation depth of 3. Performed 565 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-09 09:05:19,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:19,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:05:19,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:19,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:19,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:19,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:05:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:19,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:19,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:19,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-09 09:05:19,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2018-12-09 09:05:19,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:19,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:05:19,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-12-09 09:05:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:19,374 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:05:19,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 17 [2018-12-09 09:05:19,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:05:19,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:05:19,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:05:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-09 09:05:19,374 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 7 states. [2018-12-09 09:05:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:19,432 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-09 09:05:19,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:05:19,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 09:05:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:19,433 INFO L225 Difference]: With dead ends: 33 [2018-12-09 09:05:19,433 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 09:05:19,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-12-09 09:05:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 09:05:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 09:05:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 09:05:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-09 09:05:19,434 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-12-09 09:05:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:19,434 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-09 09:05:19,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:05:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-09 09:05:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:05:19,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:19,435 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:19,435 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:19,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:19,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1597905920, now seen corresponding path program 2 times [2018-12-09 09:05:19,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:19,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:19,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:05:19,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:19,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:19,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:19,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:19,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:05:19,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:05:19,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:19,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:19,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:05:19,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:05:19,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 09:05:19,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:05:19,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:19,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:05:19,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 09:05:19,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 09:05:19,651 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,666 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 09:05:19,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 09:05:19,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 09:05:19,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 09:05:19,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 09:05:19,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 09:05:19,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:05:19,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-09 09:05:19,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-09 09:05:19,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-09 09:05:19,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:19,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 09:05:19,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:19,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:19,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:19,864 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-12-09 09:05:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:19,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:20,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-09 09:05:20,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-09 09:05:20,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:20,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:20,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:20,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2018-12-09 09:05:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:20,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:05:20,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2018-12-09 09:05:20,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:05:20,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 09:05:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 09:05:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2018-12-09 09:05:20,144 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 22 states. [2018-12-09 09:05:23,583 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2018-12-09 09:05:25,191 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-12-09 09:05:27,222 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 09:05:28,112 WARN L180 SmtUtils]: Spent 856.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-09 09:05:28,978 WARN L180 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-12-09 09:05:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:29,037 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-09 09:05:29,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 09:05:29,037 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-12-09 09:05:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:29,037 INFO L225 Difference]: With dead ends: 38 [2018-12-09 09:05:29,037 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 09:05:29,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 09:05:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 09:05:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-12-09 09:05:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 09:05:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-09 09:05:29,039 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 26 [2018-12-09 09:05:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:29,039 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-09 09:05:29,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 09:05:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-09 09:05:29,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 09:05:29,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:29,040 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:29,040 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:29,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:29,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2010704447, now seen corresponding path program 2 times [2018-12-09 09:05:29,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:29,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:29,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:05:29,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:29,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:29,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:29,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:29,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:05:29,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:05:29,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:29,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:29,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:05:29,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:05:29,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 09:05:29,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:05:29,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:29,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 09:05:29,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 09:05:29,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:29,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:29,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:29,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:28 [2018-12-09 09:05:29,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 09:05:29,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:05:29,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:29,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:29,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:29,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 09:05:29,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-09 09:05:29,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-12-09 09:05:29,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:29,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2018-12-09 09:05:29,522 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:29,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-09 09:05:29,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:29,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:05:29,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:05:29,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:59 [2018-12-09 09:05:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:29,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:30,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-12-09 09:05:30,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-09 09:05:30,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:30,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 09:05:30,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:30,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-12-09 09:05:30,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:30,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:30,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:30,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:83 [2018-12-09 09:05:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:30,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:05:30,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2018-12-09 09:05:30,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:05:30,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 09:05:30,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 09:05:30,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 09:05:30,153 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2018-12-09 09:05:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:30,982 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-09 09:05:30,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:05:30,982 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2018-12-09 09:05:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:30,982 INFO L225 Difference]: With dead ends: 37 [2018-12-09 09:05:30,983 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 09:05:30,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=279, Invalid=2271, Unknown=0, NotChecked=0, Total=2550 [2018-12-09 09:05:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 09:05:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-09 09:05:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 09:05:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-09 09:05:30,984 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 28 [2018-12-09 09:05:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:30,984 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-09 09:05:30,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 09:05:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-09 09:05:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 09:05:30,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:30,984 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:30,984 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:30,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:30,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1327535952, now seen corresponding path program 3 times [2018-12-09 09:05:30,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:30,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:30,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:05:30,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:30,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 09:05:31,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:31,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:31,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:05:31,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:05:31,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:31,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:31,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:05:31,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:05:31,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:05:31,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:05:31,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:31,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 09:05:31,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 09:05:31,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:05:31,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 09:05:31,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 09:05:31,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:05:31,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 09:05:31,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 09:05:31,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 09:05:31,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:05:31,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 09:05:31,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-12-09 09:05:31,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-09 09:05:31,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-12-09 09:05:31,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:31,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:31,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:31,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-12-09 09:05:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:31,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:31,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-09 09:05:31,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-09 09:05:31,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:31,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:31,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-12-09 09:05:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:31,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:05:31,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 32 [2018-12-09 09:05:31,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:05:31,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 09:05:31,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 09:05:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 09:05:31,728 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 22 states. [2018-12-09 09:05:32,773 WARN L180 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2018-12-09 09:05:33,078 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-12-09 09:05:34,475 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2018-12-09 09:05:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:36,903 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-09 09:05:36,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:05:36,903 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-12-09 09:05:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:36,904 INFO L225 Difference]: With dead ends: 36 [2018-12-09 09:05:36,904 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 09:05:36,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 09:05:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 09:05:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-09 09:05:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 09:05:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-09 09:05:36,905 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-12-09 09:05:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:36,905 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-09 09:05:36,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 09:05:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-09 09:05:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 09:05:36,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:05:36,906 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:05:36,906 INFO L423 AbstractCegarLoop]: === Iteration 23 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 09:05:36,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:05:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash 156761361, now seen corresponding path program 3 times [2018-12-09 09:05:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:05:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:36,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:05:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:05:36,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:05:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:05:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 09:05:37,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:37,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:05:37,066 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:05:37,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:05:37,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:05:37,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:05:37,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:05:37,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:05:37,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:05:37,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:05:37,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:05:37,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 09:05:37,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 09:05:37,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:37,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:37,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:37,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 09:05:37,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 09:05:37,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:05:37,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:37,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:37,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:37,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 09:05:37,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-09 09:05:37,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-12-09 09:05:37,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:37,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-09 09:05:37,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:37,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2018-12-09 09:05:37,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 09:05:37,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:05:37,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:37,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-09 09:05:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:37,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:05:41,700 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-09 09:05:46,506 WARN L180 SmtUtils]: Spent 4.76 s on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 09:05:46,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-12-09 09:05:46,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-09 09:05:46,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:46,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-12-09 09:05:46,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:05:46,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:05:46,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:05:46,734 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:35 [2018-12-09 09:05:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:05:46,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:05:46,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 17] total 39 [2018-12-09 09:05:46,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:05:46,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 09:05:46,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 09:05:46,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1373, Unknown=1, NotChecked=0, Total=1560 [2018-12-09 09:05:46,791 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 24 states. [2018-12-09 09:05:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:05:47,522 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-09 09:05:47,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 09:05:47,522 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-12-09 09:05:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:05:47,522 INFO L225 Difference]: With dead ends: 35 [2018-12-09 09:05:47,523 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:05:47,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=712, Invalid=3193, Unknown=1, NotChecked=0, Total=3906 [2018-12-09 09:05:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:05:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:05:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:05:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:05:47,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-12-09 09:05:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:05:47,524 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:05:47,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 09:05:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:05:47,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:05:47,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:05:47 BoogieIcfgContainer [2018-12-09 09:05:47,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:05:47,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:05:47,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:05:47,528 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:05:47,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:05:12" (3/4) ... [2018-12-09 09:05:47,531 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:05:47,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:05:47,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2018-12-09 09:05:47,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:05:47,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-09 09:05:47,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 09:05:47,538 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 09:05:47,561 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e67c0f1d-e0b6-4c04-b8e7-3869507ef561/bin-2019/utaipan/witness.graphml [2018-12-09 09:05:47,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:05:47,561 INFO L168 Benchmark]: Toolchain (without parser) took 35769.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:05:47,562 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 970.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:05:47,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-09 09:05:47,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.97 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:05:47,562 INFO L168 Benchmark]: Boogie Preprocessor took 16.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:05:47,563 INFO L168 Benchmark]: RCFGBuilder took 186.88 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:05:47,563 INFO L168 Benchmark]: TraceAbstraction took 35256.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -59.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:05:47,563 INFO L168 Benchmark]: Witness Printer took 32.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 126.9 kB). Peak memory consumption was 126.9 kB. Max. memory is 11.5 GB. [2018-12-09 09:05:47,564 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 970.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.97 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 186.88 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35256.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -59.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Witness Printer took 32.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 126.9 kB). Peak memory consumption was 126.9 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 15 error locations. SAFE Result, 35.2s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 546 SDtfs, 837 SDslu, 2128 SDs, 0 SdLazy, 2771 SolverSat, 160 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 741 GetRequests, 329 SyntacticMatches, 13 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 29.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 85 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 685 NumberOfCodeBlocks, 683 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 876 ConstructedInterpolants, 89 QuantifiedInterpolants, 265780 SizeOfPredicates, 146 NumberOfNonLiveVariables, 1422 ConjunctsInSsa, 349 ConjunctsInUnsatCore, 41 InterpolantComputations, 18 PerfectInterpolantSequences, 73/247 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...