./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncpy-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_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/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 a42c021ebd0de645918b065980a1f8d912cba85d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 15:47:54,648 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 15:47:54,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 15:47:54,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 15:47:54,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 15:47:54,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 15:47:54,656 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 15:47:54,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 15:47:54,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 15:47:54,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 15:47:54,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 15:47:54,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 15:47:54,660 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 15:47:54,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 15:47:54,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 15:47:54,662 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 15:47:54,662 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 15:47:54,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 15:47:54,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 15:47:54,666 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 15:47:54,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 15:47:54,667 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 15:47:54,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 15:47:54,669 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 15:47:54,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 15:47:54,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 15:47:54,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 15:47:54,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 15:47:54,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 15:47:54,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 15:47:54,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 15:47:54,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 15:47:54,673 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 15:47:54,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 15:47:54,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 15:47:54,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 15:47:54,674 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-08 15:47:54,683 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 15:47:54,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 15:47:54,684 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 15:47:54,684 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 15:47:54,685 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 15:47:54,685 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 15:47:54,685 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 15:47:54,685 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 15:47:54,685 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 15:47:54,685 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 15:47:54,685 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 15:47:54,686 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 15:47:54,686 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 15:47:54,686 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 15:47:54,686 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 15:47:54,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 15:47:54,687 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 15:47:54,687 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 15:47:54,687 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 15:47:54,687 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 15:47:54,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 15:47:54,687 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 15:47:54,688 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 15:47:54,688 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 15:47:54,688 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 15:47:54,688 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 15:47:54,688 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 15:47:54,688 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 15:47:54,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 15:47:54,689 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 15:47:54,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 15:47:54,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 15:47:54,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 15:47:54,689 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 15:47:54,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 15:47:54,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 15:47:54,690 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_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/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 -> a42c021ebd0de645918b065980a1f8d912cba85d [2018-12-08 15:47:54,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 15:47:54,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 15:47:54,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 15:47:54,722 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 15:47:54,722 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 15:47:54,722 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-08 15:47:54,757 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/data/ad7e15da7/96297698e9ab4e128074d627d5a7d269/FLAG7706b4ef0 [2018-12-08 15:47:55,177 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 15:47:55,177 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-08 15:47:55,183 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/data/ad7e15da7/96297698e9ab4e128074d627d5a7d269/FLAG7706b4ef0 [2018-12-08 15:47:55,580 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/data/ad7e15da7/96297698e9ab4e128074d627d5a7d269 [2018-12-08 15:47:55,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 15:47:55,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 15:47:55,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 15:47:55,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 15:47:55,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 15:47:55,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630eb73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55, skipping insertion in model container [2018-12-08 15:47:55,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 15:47:55,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 15:47:55,752 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:47:55,759 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 15:47:55,799 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:47:55,822 INFO L195 MainTranslator]: Completed translation [2018-12-08 15:47:55,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55 WrapperNode [2018-12-08 15:47:55,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 15:47:55,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 15:47:55,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 15:47:55,823 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 15:47:55,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 15:47:55,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 15:47:55,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 15:47:55,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 15:47:55,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... [2018-12-08 15:47:55,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 15:47:55,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 15:47:55,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 15:47:55,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 15:47:55,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/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-08 15:47:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 15:47:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 15:47:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 15:47:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 15:47:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 15:47:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-12-08 15:47:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-12-08 15:47:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 15:47:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 15:47:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 15:47:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 15:47:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 15:47:56,059 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 15:47:56,059 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 15:47:56,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:47:56 BoogieIcfgContainer [2018-12-08 15:47:56,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 15:47:56,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 15:47:56,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 15:47:56,062 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 15:47:56,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 03:47:55" (1/3) ... [2018-12-08 15:47:56,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e08550a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:47:56, skipping insertion in model container [2018-12-08 15:47:56,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:47:55" (2/3) ... [2018-12-08 15:47:56,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e08550a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:47:56, skipping insertion in model container [2018-12-08 15:47:56,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:47:56" (3/3) ... [2018-12-08 15:47:56,064 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-08 15:47:56,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 15:47:56,076 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-08 15:47:56,085 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-08 15:47:56,101 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 15:47:56,101 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 15:47:56,101 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 15:47:56,101 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 15:47:56,101 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 15:47:56,102 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 15:47:56,102 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 15:47:56,102 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 15:47:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-08 15:47:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 15:47:56,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:56,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:56,117 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:56,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:56,121 INFO L82 PathProgramCache]: Analyzing trace with hash 565921843, now seen corresponding path program 1 times [2018-12-08 15:47:56,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:56,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:56,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:56,235 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-08 15:47:56,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:56,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 15:47:56,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:56,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:47:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:47:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:47:56,249 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 4 states. [2018-12-08 15:47:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:56,273 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-08 15:47:56,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:47:56,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-08 15:47:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:56,279 INFO L225 Difference]: With dead ends: 36 [2018-12-08 15:47:56,280 INFO L226 Difference]: Without dead ends: 33 [2018-12-08 15:47:56,280 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-08 15:47:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-08 15:47:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-08 15:47:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 15:47:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-08 15:47:56,300 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 10 [2018-12-08 15:47:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:56,301 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-08 15:47:56,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:47:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-08 15:47:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 15:47:56,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:56,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:56,301 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:56,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash 565921842, now seen corresponding path program 1 times [2018-12-08 15:47:56,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:56,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:56,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:56,322 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-08 15:47:56,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:56,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 15:47:56,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:56,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 15:47:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:47:56,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:47:56,324 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-12-08 15:47:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:56,346 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-08 15:47:56,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:47:56,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 15:47:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:56,346 INFO L225 Difference]: With dead ends: 32 [2018-12-08 15:47:56,346 INFO L226 Difference]: Without dead ends: 32 [2018-12-08 15:47:56,347 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-08 15:47:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-08 15:47:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-08 15:47:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 15:47:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-08 15:47:56,349 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2018-12-08 15:47:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:56,349 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-08 15:47:56,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 15:47:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-08 15:47:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 15:47:56,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:56,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:56,350 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:56,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:56,350 INFO L82 PathProgramCache]: Analyzing trace with hash -978651158, now seen corresponding path program 1 times [2018-12-08 15:47:56,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:56,394 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-08 15:47:56,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:56,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 15:47:56,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:56,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:47:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:47:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:47:56,394 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-12-08 15:47:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:56,440 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-08 15:47:56,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:47:56,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-08 15:47:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:56,441 INFO L225 Difference]: With dead ends: 31 [2018-12-08 15:47:56,441 INFO L226 Difference]: Without dead ends: 31 [2018-12-08 15:47:56,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:47:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-08 15:47:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-08 15:47:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-08 15:47:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-08 15:47:56,444 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 14 [2018-12-08 15:47:56,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:56,445 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-08 15:47:56,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:47:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-08 15:47:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 15:47:56,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:56,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:56,446 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:56,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:56,446 INFO L82 PathProgramCache]: Analyzing trace with hash -978651157, now seen corresponding path program 1 times [2018-12-08 15:47:56,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:56,514 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-08 15:47:56,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:56,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 15:47:56,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:56,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:47:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:47:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:47:56,515 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2018-12-08 15:47:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:56,576 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-12-08 15:47:56,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:47:56,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-08 15:47:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:56,578 INFO L225 Difference]: With dead ends: 40 [2018-12-08 15:47:56,579 INFO L226 Difference]: Without dead ends: 40 [2018-12-08 15:47:56,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-08 15:47:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-08 15:47:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-12-08 15:47:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 15:47:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-08 15:47:56,582 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2018-12-08 15:47:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:56,582 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-08 15:47:56,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:47:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-08 15:47:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 15:47:56,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:56,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:56,583 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:56,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash -273414843, now seen corresponding path program 1 times [2018-12-08 15:47:56,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:56,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:56,623 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-08 15:47:56,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:56,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 15:47:56,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:56,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 15:47:56,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 15:47:56,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 15:47:56,624 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 7 states. [2018-12-08 15:47:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:56,672 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-12-08 15:47:56,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:47:56,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-08 15:47:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:56,672 INFO L225 Difference]: With dead ends: 32 [2018-12-08 15:47:56,673 INFO L226 Difference]: Without dead ends: 32 [2018-12-08 15:47:56,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:47:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-08 15:47:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-08 15:47:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 15:47:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-08 15:47:56,676 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 15 [2018-12-08 15:47:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:56,676 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-08 15:47:56,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 15:47:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-08 15:47:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 15:47:56,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:56,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:56,677 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:56,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash -273414842, now seen corresponding path program 1 times [2018-12-08 15:47:56,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:56,736 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-08 15:47:56,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:56,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 15:47:56,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:56,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 15:47:56,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 15:47:56,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 15:47:56,737 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2018-12-08 15:47:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:56,784 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-08 15:47:56,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:47:56,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-08 15:47:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:56,785 INFO L225 Difference]: With dead ends: 37 [2018-12-08 15:47:56,785 INFO L226 Difference]: Without dead ends: 37 [2018-12-08 15:47:56,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:47:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-08 15:47:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-08 15:47:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 15:47:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-08 15:47:56,788 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 15 [2018-12-08 15:47:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:56,788 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-08 15:47:56,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 15:47:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-08 15:47:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 15:47:56,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:56,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:56,789 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:56,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2071316372, now seen corresponding path program 1 times [2018-12-08 15:47:56,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:56,808 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-08 15:47:56,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:56,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 15:47:56,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:56,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:47:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:47:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 15:47:56,809 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 5 states. [2018-12-08 15:47:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:56,826 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-08 15:47:56,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:47:56,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-08 15:47:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:56,826 INFO L225 Difference]: With dead ends: 36 [2018-12-08 15:47:56,827 INFO L226 Difference]: Without dead ends: 33 [2018-12-08 15:47:56,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:47:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-08 15:47:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-08 15:47:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 15:47:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-08 15:47:56,829 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2018-12-08 15:47:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:56,829 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-08 15:47:56,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:47:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-08 15:47:56,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 15:47:56,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:56,830 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:56,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:56,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2043588540, now seen corresponding path program 1 times [2018-12-08 15:47:56,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:56,855 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-08 15:47:56,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:56,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 15:47:56,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:56,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:47:56,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:47:56,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:47:56,856 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-12-08 15:47:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:56,883 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-12-08 15:47:56,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:47:56,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-08 15:47:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:56,884 INFO L225 Difference]: With dead ends: 57 [2018-12-08 15:47:56,884 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 15:47:56,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:47:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 15:47:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-12-08 15:47:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-08 15:47:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-12-08 15:47:56,889 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 18 [2018-12-08 15:47:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:56,889 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-12-08 15:47:56,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:47:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-12-08 15:47:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 15:47:56,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:56,890 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:56,890 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:56,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:56,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1342523962, now seen corresponding path program 1 times [2018-12-08 15:47:56,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:56,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:56,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:56,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:56,986 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-08 15:47:56,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:56,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 15:47:56,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:56,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 15:47:56,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 15:47:56,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:47:56,987 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 9 states. [2018-12-08 15:47:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:57,058 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-12-08 15:47:57,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 15:47:57,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-08 15:47:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:57,059 INFO L225 Difference]: With dead ends: 85 [2018-12-08 15:47:57,059 INFO L226 Difference]: Without dead ends: 85 [2018-12-08 15:47:57,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:47:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-08 15:47:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2018-12-08 15:47:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-08 15:47:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-12-08 15:47:57,063 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 18 [2018-12-08 15:47:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:57,064 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-12-08 15:47:57,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 15:47:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-12-08 15:47:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 15:47:57,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:57,065 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:57,065 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:57,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:57,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1084358524, now seen corresponding path program 1 times [2018-12-08 15:47:57,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:57,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:57,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:57,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:57,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:57,199 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-08 15:47:57,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:57,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:47:57,200 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-08 15:47:57,202 INFO L205 CegarAbsIntRunner]: [0], [9], [10], [12], [13], [37], [43], [44], [48], [53], [59], [61], [62], [69], [70], [71], [73] [2018-12-08 15:47:57,224 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:47:57,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:47:57,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:47:57,324 INFO L272 AbstractInterpreter]: Visited 17 different actions 18 times. Merged at 1 different actions 1 times. Never widened. Performed 194 root evaluator evaluations with a maximum evaluation depth of 3. Performed 194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-12-08 15:47:57,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:57,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:47:57,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:57,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/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-08 15:47:57,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:57,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:47:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:57,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:47:57,393 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-08 15:47:57,395 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-08 15:47:57,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:57,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:57,402 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-08 15:47:57,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-08 15:47:57,505 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 20 treesize of output 16 [2018-12-08 15:47:57,511 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-08 15:47:57,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 15:47:57,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:47:57,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:47:57,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-08 15:47:57,560 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-08 15:47:57,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:47:57,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-08 15:47:57,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:57,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-08 15:47:57,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-08 15:47:57,731 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:57,732 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:57,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:57,737 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-08 15:47:57,742 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-08 15:47:57,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:47:57,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2018-12-08 15:47:57,757 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:47:57,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 15:47:57,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 15:47:57,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-12-08 15:47:57,758 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 16 states. [2018-12-08 15:47:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:58,075 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-12-08 15:47:58,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 15:47:58,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-08 15:47:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:58,076 INFO L225 Difference]: With dead ends: 77 [2018-12-08 15:47:58,076 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 15:47:58,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-12-08 15:47:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 15:47:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2018-12-08 15:47:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 15:47:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-12-08 15:47:58,080 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 18 [2018-12-08 15:47:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:58,081 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-08 15:47:58,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 15:47:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-12-08 15:47:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 15:47:58,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:58,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:58,081 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:58,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1072712651, now seen corresponding path program 1 times [2018-12-08 15:47:58,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:58,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:58,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:58,109 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-08 15:47:58,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:58,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 15:47:58,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:58,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:47:58,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:47:58,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:47:58,110 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 6 states. [2018-12-08 15:47:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:58,155 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-12-08 15:47:58,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:47:58,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 15:47:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:58,156 INFO L225 Difference]: With dead ends: 73 [2018-12-08 15:47:58,156 INFO L226 Difference]: Without dead ends: 73 [2018-12-08 15:47:58,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:47:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-08 15:47:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2018-12-08 15:47:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-08 15:47:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-12-08 15:47:58,159 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 19 [2018-12-08 15:47:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:58,159 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-12-08 15:47:58,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:47:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-12-08 15:47:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 15:47:58,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:58,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:58,160 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:58,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:58,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1072712652, now seen corresponding path program 1 times [2018-12-08 15:47:58,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:58,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:58,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:58,218 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-08 15:47:58,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:58,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 15:47:58,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:58,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:47:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:47:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:47:58,219 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 8 states. [2018-12-08 15:47:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:58,283 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-12-08 15:47:58,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 15:47:58,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-08 15:47:58,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:58,283 INFO L225 Difference]: With dead ends: 81 [2018-12-08 15:47:58,284 INFO L226 Difference]: Without dead ends: 81 [2018-12-08 15:47:58,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-08 15:47:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-08 15:47:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-12-08 15:47:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 15:47:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-08 15:47:58,287 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-12-08 15:47:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:58,287 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-08 15:47:58,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:47:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-08 15:47:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 15:47:58,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:58,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:58,288 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:58,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:58,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1330878090, now seen corresponding path program 1 times [2018-12-08 15:47:58,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:58,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:58,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:58,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:58,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:58,370 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-08 15:47:58,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:58,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 15:47:58,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:58,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 15:47:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 15:47:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 15:47:58,371 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 10 states. [2018-12-08 15:47:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:58,537 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2018-12-08 15:47:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 15:47:58,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-12-08 15:47:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:58,538 INFO L225 Difference]: With dead ends: 86 [2018-12-08 15:47:58,538 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 15:47:58,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-12-08 15:47:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 15:47:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-12-08 15:47:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-08 15:47:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2018-12-08 15:47:58,542 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 19 [2018-12-08 15:47:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:58,542 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2018-12-08 15:47:58,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 15:47:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-12-08 15:47:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 15:47:58,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:58,542 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:58,542 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:58,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:58,543 INFO L82 PathProgramCache]: Analyzing trace with hash 744624077, now seen corresponding path program 1 times [2018-12-08 15:47:58,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:58,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:58,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:58,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:58,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:58,607 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-08 15:47:58,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:58,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:47:58,607 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-08 15:47:58,607 INFO L205 CegarAbsIntRunner]: [0], [9], [10], [13], [15], [37], [43], [44], [48], [53], [59], [61], [62], [69], [70], [71], [73] [2018-12-08 15:47:58,608 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:47:58,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:47:58,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:47:58,644 INFO L272 AbstractInterpreter]: Visited 17 different actions 18 times. Merged at 1 different actions 1 times. Never widened. Performed 194 root evaluator evaluations with a maximum evaluation depth of 3. Performed 194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-12-08 15:47:58,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:58,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:47:58,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:58,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/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-08 15:47:58,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:58,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:47:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:58,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:47:58,682 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-08 15:47:58,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:58,690 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-08 15:47:58,693 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-08 15:47:58,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:58,698 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:58,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:58,702 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-08 15:47:58,762 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-08 15:47:58,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:47:58,847 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-08 15:47:58,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:47:58,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2018-12-08 15:47:58,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:47:58,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 15:47:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 15:47:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-12-08 15:47:58,863 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 14 states. [2018-12-08 15:47:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:59,035 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2018-12-08 15:47:59,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 15:47:59,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-12-08 15:47:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:59,035 INFO L225 Difference]: With dead ends: 96 [2018-12-08 15:47:59,036 INFO L226 Difference]: Without dead ends: 96 [2018-12-08 15:47:59,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2018-12-08 15:47:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-08 15:47:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2018-12-08 15:47:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 15:47:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2018-12-08 15:47:59,039 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 19 [2018-12-08 15:47:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:59,039 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2018-12-08 15:47:59,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 15:47:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-12-08 15:47:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 15:47:59,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:59,040 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-08 15:47:59,040 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:59,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash 841906179, now seen corresponding path program 1 times [2018-12-08 15:47:59,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:59,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:59,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:59,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:59,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 15:47:59,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:47:59,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 15:47:59,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:47:59,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:47:59,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:47:59,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:47:59,078 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 4 states. [2018-12-08 15:47:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:47:59,113 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-12-08 15:47:59,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:47:59,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-08 15:47:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:47:59,114 INFO L225 Difference]: With dead ends: 82 [2018-12-08 15:47:59,114 INFO L226 Difference]: Without dead ends: 47 [2018-12-08 15:47:59,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:47:59,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-08 15:47:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-12-08 15:47:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-08 15:47:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-08 15:47:59,117 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 22 [2018-12-08 15:47:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:47:59,118 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-08 15:47:59,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:47:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-08 15:47:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 15:47:59,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:47:59,118 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:47:59,119 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:47:59,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:47:59,119 INFO L82 PathProgramCache]: Analyzing trace with hash -410229667, now seen corresponding path program 2 times [2018-12-08 15:47:59,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:47:59,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:59,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:47:59,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:47:59,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:47:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:47:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:47:59,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:59,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:47:59,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:47:59,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:47:59,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:47:59,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/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-08 15:47:59,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:47:59,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:47:59,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 15:47:59,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:47:59,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:47:59,373 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-08 15:47:59,375 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-08 15:47:59,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,385 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-08 15:47:59,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,391 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-08 15:47:59,391 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-08 15:47:59,406 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-08 15:47:59,408 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-08 15:47:59,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-08 15:47:59,489 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 24 treesize of output 25 [2018-12-08 15:47:59,491 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-08 15:47:59,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,502 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-08 15:47:59,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2018-12-08 15:47:59,566 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 22 treesize of output 18 [2018-12-08 15:47:59,571 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 18 treesize of output 15 [2018-12-08 15:47:59,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 15:47:59,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:47:59,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:47:59,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:47 [2018-12-08 15:47:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:47:59,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:47:59,932 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 63 treesize of output 53 [2018-12-08 15:47:59,954 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-08 15:47:59,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,979 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 20 treesize of output 18 [2018-12-08 15:47:59,981 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-08 15:47:59,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,986 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 19 treesize of output 15 [2018-12-08 15:47:59,988 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 15 treesize of output 10 [2018-12-08 15:47:59,988 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 15:47:59,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:48:00,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 15:48:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-12-08 15:48:00,057 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-08 15:48:00,057 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 15:48:00,071 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 19 treesize of output 15 [2018-12-08 15:48:00,073 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 15 treesize of output 10 [2018-12-08 15:48:00,073 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 15:48:00,075 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:48:00,076 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 20 treesize of output 18 [2018-12-08 15:48:00,078 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-08 15:48:00,078 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 15:48:00,080 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:48:00,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 15:48:00,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 15:48:00,142 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-12-08 15:48:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:00,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:00,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2018-12-08 15:48:00,252 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:00,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 15:48:00,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 15:48:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2018-12-08 15:48:00,252 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 21 states. [2018-12-08 15:48:00,763 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2018-12-08 15:48:01,204 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2018-12-08 15:48:01,527 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-12-08 15:48:02,158 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-12-08 15:48:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:02,200 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-08 15:48:02,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 15:48:02,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2018-12-08 15:48:02,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:02,201 INFO L225 Difference]: With dead ends: 49 [2018-12-08 15:48:02,201 INFO L226 Difference]: Without dead ends: 49 [2018-12-08 15:48:02,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=224, Invalid=1582, Unknown=0, NotChecked=0, Total=1806 [2018-12-08 15:48:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-08 15:48:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-12-08 15:48:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 15:48:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-08 15:48:02,203 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-12-08 15:48:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:02,203 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-08 15:48:02,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 15:48:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-08 15:48:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 15:48:02,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:48:02,204 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] [2018-12-08 15:48:02,204 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:48:02,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:02,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1222379454, now seen corresponding path program 1 times [2018-12-08 15:48:02,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:48:02,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:02,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:02,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:02,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:48:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:02,307 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-08 15:48:02,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:02,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:48:02,307 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-08 15:48:02,307 INFO L205 CegarAbsIntRunner]: [0], [9], [10], [13], [18], [23], [28], [29], [31], [32], [43], [44], [48], [51], [59], [61], [62], [69], [70], [71], [73] [2018-12-08 15:48:02,309 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:48:02,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:48:02,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:48:02,338 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 184 root evaluator evaluations with a maximum evaluation depth of 3. Performed 184 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-12-08 15:48:02,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:02,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:48:02,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:02,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/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-08 15:48:02,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:02,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:48:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:02,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:02,370 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-08 15:48:02,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:48:02,375 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-08 15:48:02,377 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-08 15:48:02,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:48:02,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:48:02,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:48:02,387 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-08 15:48:02,542 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-08 15:48:02,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:48:02,761 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-08 15:48:02,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:48:02,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2018-12-08 15:48:02,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:48:02,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-08 15:48:02,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-08 15:48:02,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2018-12-08 15:48:02,777 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 23 states. [2018-12-08 15:48:03,539 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-08 15:48:04,074 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-08 15:48:04,360 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-12-08 15:48:04,642 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-12-08 15:48:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:04,653 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-12-08 15:48:04,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 15:48:04,655 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-08 15:48:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:48:04,656 INFO L225 Difference]: With dead ends: 50 [2018-12-08 15:48:04,656 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 15:48:04,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=412, Invalid=2344, Unknown=0, NotChecked=0, Total=2756 [2018-12-08 15:48:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 15:48:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 15:48:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 15:48:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 15:48:04,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-12-08 15:48:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:48:04,660 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 15:48:04,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-08 15:48:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 15:48:04,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 15:48:04,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 03:48:04 BoogieIcfgContainer [2018-12-08 15:48:04,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 15:48:04,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 15:48:04,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 15:48:04,671 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 15:48:04,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:47:56" (3/4) ... [2018-12-08 15:48:04,675 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 15:48:04,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2018-12-08 15:48:04,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 15:48:04,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 15:48:04,685 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-08 15:48:04,685 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-08 15:48:04,685 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 15:48:04,713 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4126afaf-bb36-4bf4-a289-7e60cd8a0d2b/bin-2019/utaipan/witness.graphml [2018-12-08 15:48:04,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 15:48:04,714 INFO L168 Benchmark]: Toolchain (without parser) took 9130.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 947.0 MB in the beginning and 729.4 MB in the end (delta: 217.6 MB). Peak memory consumption was 420.5 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:04,714 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:48:04,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.30 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 974.0 MB in the end (delta: -27.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:04,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.85 ms. Allocated memory is still 1.0 GB. Free memory was 974.0 MB in the beginning and 1.0 GB in the end (delta: -30.8 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. [2018-12-08 15:48:04,715 INFO L168 Benchmark]: Boogie Preprocessor took 16.67 ms. Allocated memory is still 1.0 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:48:04,715 INFO L168 Benchmark]: RCFGBuilder took 178.34 ms. Allocated memory is still 1.0 GB. Free memory was 1.0 GB in the beginning and 981.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:04,715 INFO L168 Benchmark]: TraceAbstraction took 8609.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 981.3 MB in the beginning and 737.9 MB in the end (delta: 243.3 MB). Peak memory consumption was 446.2 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:04,715 INFO L168 Benchmark]: Witness Printer took 43.13 ms. Allocated memory is still 1.2 GB. Free memory was 737.9 MB in the beginning and 729.4 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:04,716 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 238.30 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 974.0 MB in the end (delta: -27.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.85 ms. Allocated memory is still 1.0 GB. Free memory was 974.0 MB in the beginning and 1.0 GB in the end (delta: -30.8 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.67 ms. Allocated memory is still 1.0 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 178.34 ms. Allocated memory is still 1.0 GB. Free memory was 1.0 GB in the beginning and 981.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8609.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 981.3 MB in the beginning and 737.9 MB in the end (delta: 243.3 MB). Peak memory consumption was 446.2 MB. Max. memory is 11.5 GB. * Witness Printer took 43.13 ms. Allocated memory is still 1.2 GB. Free memory was 737.9 MB in the beginning and 729.4 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 552]: 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: 552]: 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: 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 - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 9 error locations. SAFE Result, 8.5s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 429 SDtfs, 536 SDslu, 1822 SDs, 0 SdLazy, 1460 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 95 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 432 ConstructedInterpolants, 21 QuantifiedInterpolants, 72070 SizeOfPredicates, 79 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 6/53 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...