./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-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_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/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 0b29929f70f48b1f1b1180a065dc51df3698b29b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:10:01,425 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:10:01,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:10:01,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:10:01,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:10:01,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:10:01,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:10:01,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:10:01,435 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:10:01,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:10:01,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:10:01,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:10:01,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:10:01,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:10:01,438 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:10:01,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:10:01,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:10:01,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:10:01,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:10:01,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:10:01,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:10:01,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:10:01,443 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:10:01,443 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:10:01,444 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:10:01,444 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:10:01,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:10:01,445 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:10:01,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:10:01,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:10:01,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:10:01,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:10:01,446 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:10:01,446 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:10:01,447 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:10:01,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:10:01,447 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 08:10:01,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:10:01,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:10:01,455 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:10:01,456 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 08:10:01,456 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 08:10:01,456 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 08:10:01,456 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 08:10:01,456 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 08:10:01,456 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 08:10:01,456 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 08:10:01,456 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 08:10:01,456 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 08:10:01,456 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 08:10:01,457 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 08:10:01,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 08:10:01,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:10:01,457 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:10:01,457 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 08:10:01,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:10:01,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:10:01,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:10:01,457 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 08:10:01,457 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 08:10:01,458 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 08:10:01,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:10:01,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:10:01,458 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:10:01,458 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:10:01,458 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:10:01,458 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 08:10:01,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:10:01,458 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:10:01,458 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:10:01,458 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 08:10:01,459 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:10:01,459 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 08:10:01,459 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_72785e70-68ca-47b6-998b-cac944788aa1/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 -> 0b29929f70f48b1f1b1180a065dc51df3698b29b [2018-12-09 08:10:01,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:10:01,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:10:01,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:10:01,486 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:10:01,486 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:10:01,486 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 08:10:01,523 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/data/67d9729c9/e3c1430e097c474583554938510ad314/FLAGa9e1d4946 [2018-12-09 08:10:01,960 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:10:01,960 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 08:10:01,966 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/data/67d9729c9/e3c1430e097c474583554938510ad314/FLAGa9e1d4946 [2018-12-09 08:10:01,974 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/data/67d9729c9/e3c1430e097c474583554938510ad314 [2018-12-09 08:10:01,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:10:01,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:10:01,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:10:01,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:10:01,979 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:10:01,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:10:01" (1/1) ... [2018-12-09 08:10:01,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c26117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:01, skipping insertion in model container [2018-12-09 08:10:01,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:10:01" (1/1) ... [2018-12-09 08:10:01,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:10:02,002 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:10:02,150 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:10:02,157 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:10:02,224 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:10:02,250 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:10:02,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02 WrapperNode [2018-12-09 08:10:02,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:10:02,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:10:02,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:10:02,252 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:10:02,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... [2018-12-09 08:10:02,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... [2018-12-09 08:10:02,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:10:02,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:10:02,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:10:02,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:10:02,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... [2018-12-09 08:10:02,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... [2018-12-09 08:10:02,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... [2018-12-09 08:10:02,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... [2018-12-09 08:10:02,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... [2018-12-09 08:10:02,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... [2018-12-09 08:10:02,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... [2018-12-09 08:10:02,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:10:02,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:10:02,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:10:02,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:10:02,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/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 08:10:02,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:10:02,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 08:10:02,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:10:02,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 08:10:02,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 08:10:02,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 08:10:02,318 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 08:10:02,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 08:10:02,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 08:10:02,319 INFO L130 BoogieDeclarations]: Found specification of procedure cstpncpy [2018-12-09 08:10:02,319 INFO L138 BoogieDeclarations]: Found implementation of procedure cstpncpy [2018-12-09 08:10:02,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:10:02,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:10:02,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:10:02,510 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:10:02,510 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 08:10:02,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:10:02 BoogieIcfgContainer [2018-12-09 08:10:02,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:10:02,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 08:10:02,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 08:10:02,513 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 08:10:02,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:10:01" (1/3) ... [2018-12-09 08:10:02,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c27c164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:10:02, skipping insertion in model container [2018-12-09 08:10:02,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:10:02" (2/3) ... [2018-12-09 08:10:02,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c27c164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:10:02, skipping insertion in model container [2018-12-09 08:10:02,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:10:02" (3/3) ... [2018-12-09 08:10:02,516 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 08:10:02,522 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 08:10:02,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-09 08:10:02,536 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-09 08:10:02,552 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 08:10:02,553 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 08:10:02,553 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 08:10:02,553 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:10:02,553 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:10:02,553 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 08:10:02,553 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:10:02,553 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 08:10:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-12-09 08:10:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 08:10:02,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:02,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:02,573 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:02,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:02,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1596257140, now seen corresponding path program 1 times [2018-12-09 08:10:02,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:02,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:02,680 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 08:10:02,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:02,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 08:10:02,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:02,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:10:02,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:10:02,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:10:02,694 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-12-09 08:10:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:02,745 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-12-09 08:10:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:10:02,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 08:10:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:02,752 INFO L225 Difference]: With dead ends: 60 [2018-12-09 08:10:02,752 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 08:10:02,753 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 08:10:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 08:10:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-09 08:10:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 08:10:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-12-09 08:10:02,778 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 10 [2018-12-09 08:10:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:02,778 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-12-09 08:10:02,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:10:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-12-09 08:10:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 08:10:02,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:02,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:02,779 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:02,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:02,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1596257139, now seen corresponding path program 1 times [2018-12-09 08:10:02,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:02,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:02,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:02,835 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 08:10:02,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:02,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:10:02,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:02,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:10:02,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:10:02,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:10:02,837 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 4 states. [2018-12-09 08:10:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:02,850 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-12-09 08:10:02,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:10:02,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 08:10:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:02,851 INFO L225 Difference]: With dead ends: 56 [2018-12-09 08:10:02,852 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 08:10:02,852 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 08:10:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 08:10:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-09 08:10:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 08:10:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-12-09 08:10:02,856 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 10 [2018-12-09 08:10:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:02,857 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-12-09 08:10:02,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:10:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-12-09 08:10:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 08:10:02,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:02,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:02,857 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:02,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash -218487363, now seen corresponding path program 1 times [2018-12-09 08:10:02,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:02,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:02,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:02,888 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 08:10:02,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:02,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 08:10:02,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:02,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:10:02,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:10:02,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:10:02,889 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 3 states. [2018-12-09 08:10:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:02,920 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-12-09 08:10:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:10:02,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 08:10:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:02,921 INFO L225 Difference]: With dead ends: 50 [2018-12-09 08:10:02,921 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 08:10:02,921 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 08:10:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 08:10:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-09 08:10:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 08:10:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-09 08:10:02,925 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-12-09 08:10:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:02,926 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-09 08:10:02,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:10:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-12-09 08:10:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 08:10:02,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:02,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:02,926 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:02,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:02,927 INFO L82 PathProgramCache]: Analyzing trace with hash -218487362, now seen corresponding path program 1 times [2018-12-09 08:10:02,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:02,957 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 08:10:02,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:02,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 08:10:02,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:02,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:10:02,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:10:02,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:10:02,959 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 3 states. [2018-12-09 08:10:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:02,984 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-09 08:10:02,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:10:02,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 08:10:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:02,985 INFO L225 Difference]: With dead ends: 44 [2018-12-09 08:10:02,985 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 08:10:02,985 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 08:10:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 08:10:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 08:10:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 08:10:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 08:10:02,988 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-12-09 08:10:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:02,988 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 08:10:02,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:10:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 08:10:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 08:10:02,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:02,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:02,989 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:02,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1112925276, now seen corresponding path program 1 times [2018-12-09 08:10:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:02,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:03,029 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 08:10:03,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:03,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:10:03,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:03,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:10:03,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:10:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:10:03,030 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 6 states. [2018-12-09 08:10:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:03,059 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-12-09 08:10:03,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:10:03,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 08:10:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:03,059 INFO L225 Difference]: With dead ends: 59 [2018-12-09 08:10:03,059 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 08:10:03,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:10:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 08:10:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2018-12-09 08:10:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 08:10:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-09 08:10:03,062 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2018-12-09 08:10:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:03,062 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-09 08:10:03,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:10:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-09 08:10:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 08:10:03,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:03,063 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] [2018-12-09 08:10:03,063 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:03,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash -713272887, now seen corresponding path program 1 times [2018-12-09 08:10:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:03,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:03,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:03,151 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 08:10:03,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:03,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 08:10:03,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:03,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 08:10:03,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 08:10:03,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 08:10:03,152 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 10 states. [2018-12-09 08:10:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:03,239 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-09 08:10:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:10:03,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-09 08:10:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:03,240 INFO L225 Difference]: With dead ends: 43 [2018-12-09 08:10:03,240 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 08:10:03,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-09 08:10:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 08:10:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 08:10:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 08:10:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-09 08:10:03,242 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 22 [2018-12-09 08:10:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:03,243 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-09 08:10:03,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 08:10:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-09 08:10:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 08:10:03,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:03,243 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] [2018-12-09 08:10:03,243 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:03,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash -713272886, now seen corresponding path program 1 times [2018-12-09 08:10:03,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:03,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:03,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:03,324 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 08:10:03,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:03,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 08:10:03,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:03,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 08:10:03,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 08:10:03,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 08:10:03,325 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 10 states. [2018-12-09 08:10:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:03,471 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-09 08:10:03,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:10:03,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-09 08:10:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:03,472 INFO L225 Difference]: With dead ends: 49 [2018-12-09 08:10:03,472 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 08:10:03,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-09 08:10:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 08:10:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-09 08:10:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 08:10:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-09 08:10:03,474 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2018-12-09 08:10:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:03,475 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-09 08:10:03,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 08:10:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-09 08:10:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 08:10:03,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:03,475 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 08:10:03,475 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:03,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:03,476 INFO L82 PathProgramCache]: Analyzing trace with hash -636622995, now seen corresponding path program 1 times [2018-12-09 08:10:03,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:03,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:03,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:03,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:03,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:03,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:03,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 08:10:03,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:03,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 08:10:03,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 08:10:03,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 08:10:03,559 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 9 states. [2018-12-09 08:10:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:03,692 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-12-09 08:10:03,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:10:03,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-09 08:10:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:03,693 INFO L225 Difference]: With dead ends: 51 [2018-12-09 08:10:03,693 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 08:10:03,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-12-09 08:10:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 08:10:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-12-09 08:10:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 08:10:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-09 08:10:03,695 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 23 [2018-12-09 08:10:03,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:03,695 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-09 08:10:03,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 08:10:03,695 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-09 08:10:03,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 08:10:03,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:03,696 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 08:10:03,696 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:03,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:03,696 INFO L82 PathProgramCache]: Analyzing trace with hash -636622994, now seen corresponding path program 1 times [2018-12-09 08:10:03,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:03,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:03,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:03,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:03,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:03,885 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 08:10:03,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:03,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 08:10:03,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:03,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 08:10:03,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 08:10:03,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:10:03,885 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 11 states. [2018-12-09 08:10:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:04,041 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-09 08:10:04,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 08:10:04,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-09 08:10:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:04,041 INFO L225 Difference]: With dead ends: 46 [2018-12-09 08:10:04,041 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 08:10:04,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-12-09 08:10:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 08:10:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-09 08:10:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 08:10:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-09 08:10:04,043 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 23 [2018-12-09 08:10:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:04,043 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-09 08:10:04,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 08:10:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-09 08:10:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 08:10:04,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:04,044 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, 1, 1, 1, 1, 1] [2018-12-09 08:10:04,044 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:04,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:04,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1360294422, now seen corresponding path program 1 times [2018-12-09 08:10:04,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:04,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:04,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:04,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:04,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:04,079 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 08:10:04,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:04,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:10:04,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:04,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:10:04,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:10:04,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:10:04,080 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2018-12-09 08:10:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:04,125 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-09 08:10:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:10:04,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-09 08:10:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:04,126 INFO L225 Difference]: With dead ends: 44 [2018-12-09 08:10:04,126 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 08:10:04,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:10:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 08:10:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 08:10:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 08:10:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-09 08:10:04,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 28 [2018-12-09 08:10:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:04,129 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-09 08:10:04,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:10:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-09 08:10:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 08:10:04,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:04,130 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, 1, 1, 1, 1, 1] [2018-12-09 08:10:04,130 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:04,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1360294423, now seen corresponding path program 1 times [2018-12-09 08:10:04,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:04,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:04,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:04,513 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 08:10:04,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:04,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 08:10:04,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:04,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 08:10:04,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 08:10:04,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-09 08:10:04,514 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 17 states. [2018-12-09 08:10:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:05,131 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-12-09 08:10:05,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 08:10:05,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-09 08:10:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:05,132 INFO L225 Difference]: With dead ends: 51 [2018-12-09 08:10:05,132 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 08:10:05,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-12-09 08:10:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 08:10:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-09 08:10:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 08:10:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-12-09 08:10:05,135 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 28 [2018-12-09 08:10:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:05,136 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-12-09 08:10:05,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 08:10:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-12-09 08:10:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 08:10:05,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:05,137 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 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 08:10:05,137 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:05,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1381316555, now seen corresponding path program 1 times [2018-12-09 08:10:05,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:05,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:05,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:05,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 08:10:05,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:05,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 08:10:05,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 08:10:05,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:10:05,250 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 12 states. [2018-12-09 08:10:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:05,411 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-12-09 08:10:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 08:10:05,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-09 08:10:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:05,412 INFO L225 Difference]: With dead ends: 82 [2018-12-09 08:10:05,412 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 08:10:05,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-12-09 08:10:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 08:10:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-09 08:10:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 08:10:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-09 08:10:05,416 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2018-12-09 08:10:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:05,416 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-09 08:10:05,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 08:10:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-09 08:10:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 08:10:05,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:05,417 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 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 08:10:05,417 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:05,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1600171273, now seen corresponding path program 1 times [2018-12-09 08:10:05,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:05,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:05,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:05,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:05,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:05,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:05,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:10:05,575 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-09 08:10:05,576 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [26], [27], [30], [33], [34], [37], [38], [41], [44], [48], [49], [51], [52], [79], [81], [86], [98], [99], [100], [102] [2018-12-09 08:10:05,597 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:10:05,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:10:05,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 08:10:05,738 INFO L272 AbstractInterpreter]: Visited 27 different actions 46 times. Merged at 7 different actions 19 times. Never widened. Performed 452 root evaluator evaluations with a maximum evaluation depth of 4. Performed 452 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-09 08:10:05,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:05,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 08:10:05,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:05,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/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 08:10:05,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:05,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 08:10:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:05,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:10:05,803 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 08:10:05,805 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 08:10:05,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:05,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:05,816 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 08:10:05,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-09 08:10:05,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:05,871 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 14 treesize of output 17 [2018-12-09 08:10:05,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:05,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:05,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:05,884 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 08:10:05,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:05,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:05,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2018-12-09 08:10:05,920 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 26 treesize of output 27 [2018-12-09 08:10:05,922 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 1 [2018-12-09 08:10:05,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:05,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:05,931 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 08:10:05,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-12-09 08:10:05,995 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 26 treesize of output 27 [2018-12-09 08:10:05,997 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 1 [2018-12-09 08:10:05,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:05,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:06,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-12-09 08:10:06,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 16 [2018-12-09 08:10:06,085 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 08:10:06,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 08:10:06,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:10:06,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 08:10:06,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-12-09 08:10:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:06,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:10:06,344 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:06,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:06,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:06,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-12-09 08:10:06,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:06,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:06,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-12-09 08:10:06,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:123 [2018-12-09 08:10:06,734 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:06,734 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:06,735 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-09 08:10:06,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,743 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 15 treesize of output 11 [2018-12-09 08:10:06,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-12-09 08:10:06,763 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 08:10:06,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 17 [2018-12-09 08:10:06,772 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-09 08:10:06,773 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,774 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:06,780 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:78, output treesize:7 [2018-12-09 08:10:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:06,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:10:06,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2018-12-09 08:10:06,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:10:06,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 08:10:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 08:10:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 08:10:06,802 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 24 states. [2018-12-09 08:10:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:08,042 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-12-09 08:10:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 08:10:08,042 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-09 08:10:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:08,044 INFO L225 Difference]: With dead ends: 89 [2018-12-09 08:10:08,044 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 08:10:08,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 08:10:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 08:10:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2018-12-09 08:10:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 08:10:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-09 08:10:08,047 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 28 [2018-12-09 08:10:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:08,047 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-09 08:10:08,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 08:10:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-09 08:10:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 08:10:08,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:08,048 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:08,048 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:08,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1934298097, now seen corresponding path program 1 times [2018-12-09 08:10:08,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:08,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:08,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:08,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:08,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:08,348 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 08:10:08,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:08,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:10:08,348 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-09 08:10:08,348 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [26], [27], [30], [33], [34], [37], [38], [41], [44], [48], [49], [52], [54], [79], [81], [86], [98], [99], [100], [102] [2018-12-09 08:10:08,349 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:10:08,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:10:08,424 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 08:10:08,425 INFO L272 AbstractInterpreter]: Visited 27 different actions 46 times. Merged at 7 different actions 19 times. Never widened. Performed 456 root evaluator evaluations with a maximum evaluation depth of 4. Performed 456 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-09 08:10:08,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:08,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 08:10:08,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:08,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/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 08:10:08,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:08,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 08:10:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:08,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:10:08,466 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 08:10:08,469 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 08:10:08,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:08,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 27 [2018-12-09 08:10:08,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 08:10:08,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-09 08:10:08,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:08,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:08,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:08,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 08:10:08,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 08:10:08,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-12-09 08:10:08,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-09 08:10:08,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 08:10:08,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-09 08:10:08,600 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 08:10:08,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,608 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-12-09 08:10:08,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 25 [2018-12-09 08:10:08,657 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-09 08:10:08,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-09 08:10:08,669 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 11 treesize of output 3 [2018-12-09 08:10:08,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:08,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:08,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-12-09 08:10:08,901 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 08:10:08,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:10:09,372 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 08:10:09,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:10:09,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 41 [2018-12-09 08:10:09,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:10:09,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 08:10:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 08:10:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1580, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 08:10:09,388 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 29 states. [2018-12-09 08:10:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:11,175 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-12-09 08:10:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 08:10:11,175 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-09 08:10:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:11,176 INFO L225 Difference]: With dead ends: 84 [2018-12-09 08:10:11,176 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 08:10:11,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=400, Invalid=2906, Unknown=0, NotChecked=0, Total=3306 [2018-12-09 08:10:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 08:10:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-12-09 08:10:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 08:10:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-12-09 08:10:11,180 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 29 [2018-12-09 08:10:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:11,180 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-12-09 08:10:11,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 08:10:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-12-09 08:10:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 08:10:11,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:11,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:11,181 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:11,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash -287965233, now seen corresponding path program 1 times [2018-12-09 08:10:11,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:11,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:11,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:11,558 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 08:10:11,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:11,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:10:11,558 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-09 08:10:11,559 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [26], [27], [30], [33], [34], [37], [38], [41], [44], [48], [49], [52], [57], [58], [65], [70], [71], [73], [74], [98], [99], [100], [102] [2018-12-09 08:10:11,560 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:10:11,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:10:11,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 08:10:11,581 INFO L272 AbstractInterpreter]: Visited 30 different actions 31 times. Merged at 1 different actions 1 times. Never widened. Performed 270 root evaluator evaluations with a maximum evaluation depth of 4. Performed 270 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 40 variables. [2018-12-09 08:10:11,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:11,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 08:10:11,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:11,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/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 08:10:11,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:11,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 08:10:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:11,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:10:11,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:11,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 27 [2018-12-09 08:10:11,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 08:10:11,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,629 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 08:10:11,632 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 08:10:11,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:11,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-12-09 08:10:11,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:11,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 08:10:11,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:11,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:11,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:11,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 08:10:11,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-09 08:10:11,736 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 11 treesize of output 8 [2018-12-09 08:10:11,738 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 08:10:11,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,746 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 11 treesize of output 8 [2018-12-09 08:10:11,748 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 08:10:11,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-09 08:10:11,796 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 25 treesize of output 19 [2018-12-09 08:10:11,798 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 19 treesize of output 10 [2018-12-09 08:10:11,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-09 08:10:11,809 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 11 treesize of output 3 [2018-12-09 08:10:11,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:11,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:11,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-09 08:10:12,128 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 08:10:12,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:10:12,669 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 08:10:12,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:10:12,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 46 [2018-12-09 08:10:12,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:10:12,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-09 08:10:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 08:10:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 08:10:12,685 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 33 states. [2018-12-09 08:10:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:14,661 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2018-12-09 08:10:14,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 08:10:14,661 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-09 08:10:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:14,662 INFO L225 Difference]: With dead ends: 127 [2018-12-09 08:10:14,662 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 08:10:14,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=711, Invalid=5451, Unknown=0, NotChecked=0, Total=6162 [2018-12-09 08:10:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 08:10:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 90. [2018-12-09 08:10:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 08:10:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2018-12-09 08:10:14,665 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 32 [2018-12-09 08:10:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:14,665 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2018-12-09 08:10:14,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-09 08:10:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2018-12-09 08:10:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 08:10:14,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:14,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:14,666 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:14,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash 459693359, now seen corresponding path program 1 times [2018-12-09 08:10:14,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:14,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:14,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:14,831 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 08:10:14,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:10:14,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 08:10:14,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:10:14,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 08:10:14,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 08:10:14,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:10:14,832 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 11 states. [2018-12-09 08:10:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:14,929 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-12-09 08:10:14,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 08:10:14,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-09 08:10:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:14,930 INFO L225 Difference]: With dead ends: 103 [2018-12-09 08:10:14,930 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 08:10:14,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-09 08:10:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 08:10:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-12-09 08:10:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 08:10:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-12-09 08:10:14,931 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-12-09 08:10:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:14,931 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-12-09 08:10:14,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 08:10:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-12-09 08:10:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 08:10:14,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:14,932 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:14,932 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:14,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:14,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1146019306, now seen corresponding path program 1 times [2018-12-09 08:10:14,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:14,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:14,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:14,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:14,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:15,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:15,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:10:15,286 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-09 08:10:15,286 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [26], [27], [30], [33], [34], [37], [38], [41], [44], [48], [49], [52], [57], [58], [65], [70], [73], [79], [81], [86], [98], [99], [100], [102] [2018-12-09 08:10:15,287 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:10:15,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:10:15,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 08:10:15,328 INFO L272 AbstractInterpreter]: Visited 31 different actions 58 times. Merged at 11 different actions 26 times. Never widened. Performed 564 root evaluator evaluations with a maximum evaluation depth of 4. Performed 564 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 41 variables. [2018-12-09 08:10:15,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:15,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 08:10:15,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:15,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/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 08:10:15,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:15,336 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 08:10:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:15,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:10:15,367 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 08:10:15,371 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 08:10:15,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:15,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 27 [2018-12-09 08:10:15,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 08:10:15,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:15,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-12-09 08:10:15,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:15,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 08:10:15,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:15,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:15,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:15,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 08:10:15,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-09 08:10:15,510 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 11 treesize of output 8 [2018-12-09 08:10:15,511 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 08:10:15,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,519 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 11 treesize of output 8 [2018-12-09 08:10:15,520 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 08:10:15,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-09 08:10:15,570 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 25 treesize of output 19 [2018-12-09 08:10:15,572 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 19 treesize of output 10 [2018-12-09 08:10:15,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-09 08:10:15,581 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 11 treesize of output 3 [2018-12-09 08:10:15,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:15,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:15,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-09 08:10:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:15,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:10:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:16,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:10:16,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 45 [2018-12-09 08:10:16,333 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:10:16,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 08:10:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 08:10:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1904, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 08:10:16,334 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 32 states. [2018-12-09 08:10:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:17,700 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-09 08:10:17,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 08:10:17,700 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-12-09 08:10:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:17,700 INFO L225 Difference]: With dead ends: 52 [2018-12-09 08:10:17,700 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 08:10:17,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=536, Invalid=4020, Unknown=0, NotChecked=0, Total=4556 [2018-12-09 08:10:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 08:10:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-09 08:10:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 08:10:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-09 08:10:17,702 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-09 08:10:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:17,702 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-09 08:10:17,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 08:10:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-09 08:10:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 08:10:17,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:17,703 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:17,703 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:17,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:17,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1124997174, now seen corresponding path program 2 times [2018-12-09 08:10:17,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:17,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:17,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:10:17,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:17,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:18,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:18,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:10:18,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 08:10:18,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 08:10:18,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:18,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/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 08:10:18,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 08:10:18,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 08:10:18,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 08:10:18,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:10:18,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:10:18,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:18,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 27 [2018-12-09 08:10:18,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 08:10:18,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,069 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 08:10:18,072 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 08:10:18,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-09 08:10:18,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, 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 08:10:18,110 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 08:10:18,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-09 08:10:18,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:18,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:18,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:18,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 08:10:18,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-09 08:10:18,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-12-09 08:10:18,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-09 08:10:18,226 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 08:10:18,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 08:10:18,249 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 1 [2018-12-09 08:10:18,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-09 08:10:18,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 08:10:18,263 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,264 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,272 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:70, output treesize:48 [2018-12-09 08:10:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 08:10:18,329 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-09 08:10:18,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-09 08:10:18,342 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 11 treesize of output 3 [2018-12-09 08:10:18,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:36 [2018-12-09 08:10:18,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-09 08:10:18,413 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 1 [2018-12-09 08:10:18,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:18,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-12-09 08:10:18,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-09 08:10:18,486 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 08:10:18,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:18,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:35 [2018-12-09 08:10:18,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 15 [2018-12-09 08:10:18,562 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 08:10:18,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 08:10:18,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:10:18,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 08:10:18,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-12-09 08:10:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:18,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:10:18,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:18,978 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:18,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:18,983 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:18,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:18,990 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:18,995 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,051 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,056 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,056 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,061 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,062 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,066 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-12-09 08:10:19,113 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:95, output treesize:219 [2018-12-09 08:10:19,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,622 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,626 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,627 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,632 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,713 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,718 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,719 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,724 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,725 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,730 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:19,793 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,797 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:19,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-12-09 08:10:19,846 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:175, output treesize:225 [2018-12-09 08:10:20,261 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-12-09 08:10:20,284 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 08:10:20,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:20,293 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 21 treesize of output 17 [2018-12-09 08:10:20,294 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-09 08:10:20,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:20,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:20,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:20,346 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2018-12-09 08:10:20,366 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 08:10:20,366 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:20,376 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 21 treesize of output 17 [2018-12-09 08:10:20,377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-09 08:10:20,377 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:20,378 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:20,384 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:20,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-09 08:10:20,415 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:268, output treesize:159 [2018-12-09 08:10:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:20,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:10:20,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 47 [2018-12-09 08:10:20,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:10:20,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-09 08:10:20,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 08:10:20,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2089, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 08:10:20,529 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 33 states. [2018-12-09 08:10:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:21,477 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-09 08:10:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 08:10:21,477 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2018-12-09 08:10:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:21,477 INFO L225 Difference]: With dead ends: 45 [2018-12-09 08:10:21,477 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 08:10:21,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=352, Invalid=3308, Unknown=0, NotChecked=0, Total=3660 [2018-12-09 08:10:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 08:10:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-09 08:10:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 08:10:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-09 08:10:21,479 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 34 [2018-12-09 08:10:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:21,479 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-09 08:10:21,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-09 08:10:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-09 08:10:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 08:10:21,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:21,479 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:21,480 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:21,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash -515174034, now seen corresponding path program 2 times [2018-12-09 08:10:21,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:21,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:21,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:10:21,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:21,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:21,842 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 08:10:21,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:21,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:10:21,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 08:10:21,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 08:10:21,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:21,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/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 08:10:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 08:10:21,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 08:10:21,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 08:10:21,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:10:21,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:10:21,903 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 08:10:21,907 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 08:10:21,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:21,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:21,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:21,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 treesize of output 27 [2018-12-09 08:10:21,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 08:10:21,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:21,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:21,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:21,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-09 08:10:21,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:21,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 08:10:21,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:22,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:22,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:22,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 08:10:22,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-09 08:10:22,032 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 11 treesize of output 8 [2018-12-09 08:10:22,033 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 08:10:22,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,041 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 11 treesize of output 8 [2018-12-09 08:10:22,042 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 08:10:22,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-09 08:10:22,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 25 treesize of output 19 [2018-12-09 08:10:22,095 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 19 treesize of output 10 [2018-12-09 08:10:22,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-09 08:10:22,104 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 11 treesize of output 3 [2018-12-09 08:10:22,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:22,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:22,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-09 08:10:22,385 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 08:10:22,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:10:23,402 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 08:10:23,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:10:23,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 48 [2018-12-09 08:10:23,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:10:23,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-09 08:10:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 08:10:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2176, Unknown=0, NotChecked=0, Total=2352 [2018-12-09 08:10:23,429 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 34 states. [2018-12-09 08:10:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:10:24,707 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-09 08:10:24,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 08:10:24,707 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2018-12-09 08:10:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:10:24,707 INFO L225 Difference]: With dead ends: 43 [2018-12-09 08:10:24,707 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 08:10:24,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=528, Invalid=4302, Unknown=0, NotChecked=0, Total=4830 [2018-12-09 08:10:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 08:10:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-12-09 08:10:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 08:10:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-09 08:10:24,709 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2018-12-09 08:10:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:10:24,709 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-09 08:10:24,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-09 08:10:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-09 08:10:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 08:10:24,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:10:24,710 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:10:24,710 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION]=== [2018-12-09 08:10:24,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:10:24,710 INFO L82 PathProgramCache]: Analyzing trace with hash -188592693, now seen corresponding path program 3 times [2018-12-09 08:10:24,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:10:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:24,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:10:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:10:24,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:10:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:10:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 08:10:24,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:24,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:10:24,936 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 08:10:24,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 08:10:24,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:10:24,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/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 08:10:24,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 08:10:24,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 08:10:24,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 08:10:24,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:10:24,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:10:24,989 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 08:10:24,991 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 08:10:24,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:24,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,000 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 08:10:25,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,008 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-09 08:10:25,024 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 08:10:25,025 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 08:10:25,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,031 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 08:10:25,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 08:10:25,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:25,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 08:10:25,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:25,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:25,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 08:10:25,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-12-09 08:10:25,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-09 08:10:25,094 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 1 [2018-12-09 08:10:25,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,104 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 11 treesize of output 8 [2018-12-09 08:10:25,105 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 08:10:25,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,115 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2018-12-09 08:10:25,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 08:10:25,153 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 12 treesize of output 4 [2018-12-09 08:10:25,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:25 [2018-12-09 08:10:25,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-09 08:10:25,202 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 1 [2018-12-09 08:10:25,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:25,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-12-09 08:10:25,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-09 08:10:25,293 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 08:10:25,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:25,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2018-12-09 08:10:25,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-09 08:10:25,392 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 08:10:25,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:25,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:49 [2018-12-09 08:10:25,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 44 treesize of output 38 [2018-12-09 08:10:25,697 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 9 treesize of output 1 [2018-12-09 08:10:25,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:25,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:10:25,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-12-09 08:10:25,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 08:10:25,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:10:25,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 08:10:25,739 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:74 [2018-12-09 08:10:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:10:25,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:10:26,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,812 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,817 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,817 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,824 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,824 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,830 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:26,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 33 dim-0 vars, and 8 xjuncts. [2018-12-09 08:10:26,877 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:81, output treesize:657 [2018-12-09 08:10:27,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:27,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:27,729 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:27,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:27,737 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:27,744 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:27,745 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:27,751 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:27,752 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:27,760 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:10:27,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 5 xjuncts. [2018-12-09 08:10:27,814 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:159, output treesize:260 [2018-12-09 08:10:28,096 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-09 08:10:28,411 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 08:10:28,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,499 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 161 [2018-12-09 08:10:28,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,539 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,539 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,539 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 117 [2018-12-09 08:10:28,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,607 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 85 [2018-12-09 08:10:28,639 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 08:10:28,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 22 [2018-12-09 08:10:28,653 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-12-09 08:10:28,654 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,657 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,739 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 107 [2018-12-09 08:10:28,741 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 08:10:28,741 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,756 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2018-12-09 08:10:28,770 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 9 treesize of output 8 [2018-12-09 08:10:28,770 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-12-09 08:10:28,786 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 36 [2018-12-09 08:10:28,802 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 08:10:28,803 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,805 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,806 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 08:10:28,806 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,807 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 14 [2018-12-09 08:10:28,808 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,826 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,826 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,827 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-12-09 08:10:28,828 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,829 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,830 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:10:28,830 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 08:10:28,830 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,839 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:10:28,844 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 6 treesize of output 1 [2018-12-09 08:10:28,844 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 08:10:28,847 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:10:28,849 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:10:28,858 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:10:28,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 08:10:28,896 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 22 variables, input treesize:393, output treesize:176 [2018-12-09 08:11:01,195 WARN L180 SmtUtils]: Spent 32.21 s on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-12-09 08:11:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:11:01,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:11:01,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 58 [2018-12-09 08:11:01,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:11:01,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-09 08:11:01,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-09 08:11:01,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3191, Unknown=0, NotChecked=0, Total=3422 [2018-12-09 08:11:01,227 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 39 states. [2018-12-09 08:11:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:11:02,885 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-09 08:11:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 08:11:02,885 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2018-12-09 08:11:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:11:02,885 INFO L225 Difference]: With dead ends: 42 [2018-12-09 08:11:02,886 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 08:11:02,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2018-12-09 08:11:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 08:11:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 08:11:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 08:11:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 08:11:02,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-12-09 08:11:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:11:02,887 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:11:02,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-09 08:11:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 08:11:02,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 08:11:02,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:11:02 BoogieIcfgContainer [2018-12-09 08:11:02,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 08:11:02,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:11:02,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:11:02,892 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:11:02,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:10:02" (3/4) ... [2018-12-09 08:11:02,895 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 08:11:02,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 08:11:02,900 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 08:11:02,900 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstpncpy [2018-12-09 08:11:02,903 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-09 08:11:02,903 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 08:11:02,903 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 08:11:02,932 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_72785e70-68ca-47b6-998b-cac944788aa1/bin-2019/utaipan/witness.graphml [2018-12-09 08:11:02,933 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:11:02,933 INFO L168 Benchmark]: Toolchain (without parser) took 60957.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 948.1 MB in the beginning and 808.7 MB in the end (delta: 139.3 MB). Peak memory consumption was 468.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:11:02,934 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:11:02,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -119.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:11:02,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.93 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:11:02,934 INFO L168 Benchmark]: Boogie Preprocessor took 17.84 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 08:11:02,934 INFO L168 Benchmark]: RCFGBuilder took 224.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:11:02,935 INFO L168 Benchmark]: TraceAbstraction took 60380.00 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.0 GB in the beginning and 808.7 MB in the end (delta: 228.3 MB). Peak memory consumption was 478.9 MB. Max. memory is 11.5 GB. [2018-12-09 08:11:02,935 INFO L168 Benchmark]: Witness Printer took 41.17 ms. Allocated memory is still 1.4 GB. Free memory is still 808.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:11:02,936 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -119.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.93 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.84 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 224.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60380.00 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.0 GB in the beginning and 808.7 MB in the end (delta: 228.3 MB). Peak memory consumption was 478.9 MB. Max. memory is 11.5 GB. * Witness Printer took 41.17 ms. Allocated memory is still 1.4 GB. Free memory is still 808.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 551]: 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: 551]: 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: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: 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: 556]: 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: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 21 error locations. SAFE Result, 60.3s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 607 SDtfs, 1146 SDslu, 3953 SDs, 0 SdLazy, 4850 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 857 GetRequests, 281 SyntacticMatches, 8 SemanticMatches, 568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6356 ImplicationChecksByTransitivity, 52.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred 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, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 85 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 47.3s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 935 ConstructedInterpolants, 186 QuantifiedInterpolants, 632488 SizeOfPredicates, 197 NumberOfNonLiveVariables, 1561 ConjunctsInSsa, 478 ConjunctsInUnsatCore, 34 InterpolantComputations, 13 PerfectInterpolantSequences, 4/176 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...