./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_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_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/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 bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:03:43,997 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:03:43,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:03:44,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:03:44,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:03:44,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:03:44,005 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:03:44,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:03:44,007 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:03:44,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:03:44,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:03:44,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:03:44,009 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:03:44,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:03:44,010 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:03:44,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:03:44,011 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:03:44,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:03:44,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:03:44,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:03:44,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:03:44,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:03:44,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:03:44,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:03:44,016 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:03:44,017 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:03:44,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:03:44,018 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:03:44,018 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:03:44,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:03:44,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:03:44,019 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:03:44,019 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:03:44,019 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:03:44,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:03:44,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:03:44,020 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 09:03:44,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:03:44,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:03:44,028 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:03:44,028 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:03:44,029 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:03:44,029 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:03:44,029 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:03:44,029 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:03:44,029 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:03:44,029 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:03:44,029 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:03:44,029 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:03:44,030 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:03:44,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:03:44,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:03:44,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:03:44,030 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:03:44,030 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:03:44,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:03:44,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:03:44,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:03:44,031 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:03:44,031 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:03:44,031 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 09:03:44,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:03:44,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:03:44,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:03:44,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:03:44,032 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:03:44,032 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:03:44,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:03:44,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:03:44,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:03:44,032 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:03:44,033 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:03:44,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:03:44,033 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_3567745a-49d0-411e-8f7e-9ec68ef336b5/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 -> bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 [2018-12-09 09:03:44,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:03:44,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:03:44,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:03:44,062 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:03:44,063 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:03:44,063 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:03:44,102 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/data/30335787a/b72aae8228004fa0aac49b08d12283a1/FLAG9263ce4dd [2018-12-09 09:03:44,412 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:03:44,412 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:03:44,418 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/data/30335787a/b72aae8228004fa0aac49b08d12283a1/FLAG9263ce4dd [2018-12-09 09:03:44,426 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/data/30335787a/b72aae8228004fa0aac49b08d12283a1 [2018-12-09 09:03:44,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:03:44,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:03:44,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:03:44,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:03:44,431 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:03:44,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e809d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44, skipping insertion in model container [2018-12-09 09:03:44,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:03:44,454 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:03:44,596 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:03:44,603 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:03:44,657 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:03:44,676 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:03:44,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44 WrapperNode [2018-12-09 09:03:44,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:03:44,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:03:44,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:03:44,677 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:03:44,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:03:44,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:03:44,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:03:44,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:03:44,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... [2018-12-09 09:03:44,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:03:44,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:03:44,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:03:44,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:03:44,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:03:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:03:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 09:03:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:03:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:03:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:03:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-12-09 09:03:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-12-09 09:03:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:03:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:03:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:03:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:03:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:03:44,879 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:03:44,879 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 09:03:44,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:03:44 BoogieIcfgContainer [2018-12-09 09:03:44,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:03:44,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:03:44,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:03:44,882 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:03:44,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:03:44" (1/3) ... [2018-12-09 09:03:44,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca3d0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:03:44, skipping insertion in model container [2018-12-09 09:03:44,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:03:44" (2/3) ... [2018-12-09 09:03:44,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca3d0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:03:44, skipping insertion in model container [2018-12-09 09:03:44,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:03:44" (3/3) ... [2018-12-09 09:03:44,884 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:03:44,890 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:03:44,895 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 09:03:44,903 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 09:03:44,917 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:03:44,918 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:03:44,918 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:03:44,918 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:03:44,918 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:03:44,918 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:03:44,918 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:03:44,918 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:03:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-12-09 09:03:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:03:44,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:44,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:44,933 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:44,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:44,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1518390578, now seen corresponding path program 1 times [2018-12-09 09:03:44,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:44,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:44,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:44,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:44,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:45,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:45,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:03:45,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:45,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:03:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:03:45,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:03:45,042 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-12-09 09:03:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:45,077 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-09 09:03:45,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:03:45,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:03:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:45,083 INFO L225 Difference]: With dead ends: 39 [2018-12-09 09:03:45,083 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 09:03:45,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:03:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 09:03:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 09:03:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 09:03:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-09 09:03:45,105 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2018-12-09 09:03:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:45,105 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-09 09:03:45,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:03:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-09 09:03:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:03:45,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:45,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:45,106 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:45,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:45,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1518390579, now seen corresponding path program 1 times [2018-12-09 09:03:45,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:45,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:45,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:45,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:45,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:03:45,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:45,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:03:45,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:03:45,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:03:45,143 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2018-12-09 09:03:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:45,159 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-09 09:03:45,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:03:45,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 09:03:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:45,160 INFO L225 Difference]: With dead ends: 35 [2018-12-09 09:03:45,160 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 09:03:45,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:03:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 09:03:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-09 09:03:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 09:03:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-12-09 09:03:45,163 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 10 [2018-12-09 09:03:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:45,163 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-12-09 09:03:45,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:03:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-12-09 09:03:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:03:45,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:45,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:45,163 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:45,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1594508645, now seen corresponding path program 1 times [2018-12-09 09:03:45,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:45,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:45,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:03:45,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:45,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:03:45,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:03:45,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:03:45,213 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2018-12-09 09:03:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:45,288 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-09 09:03:45,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:03:45,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-09 09:03:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:45,291 INFO L225 Difference]: With dead ends: 37 [2018-12-09 09:03:45,291 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 09:03:45,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:03:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 09:03:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-12-09 09:03:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 09:03:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-09 09:03:45,294 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 15 [2018-12-09 09:03:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:45,294 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-09 09:03:45,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:03:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-09 09:03:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:03:45,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:45,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:45,295 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:45,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:45,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1594508646, now seen corresponding path program 1 times [2018-12-09 09:03:45,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:45,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:45,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:45,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:45,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:03:45,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:45,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:03:45,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:03:45,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:03:45,383 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 9 states. [2018-12-09 09:03:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:45,451 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-12-09 09:03:45,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:03:45,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-09 09:03:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:45,452 INFO L225 Difference]: With dead ends: 40 [2018-12-09 09:03:45,452 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 09:03:45,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:03:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 09:03:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-09 09:03:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 09:03:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-09 09:03:45,456 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 15 [2018-12-09 09:03:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:45,456 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-09 09:03:45,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:03:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-09 09:03:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 09:03:45,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:45,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:45,457 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:45,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:45,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2109839576, now seen corresponding path program 1 times [2018-12-09 09:03:45,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:45,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:45,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:03:45,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:45,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:03:45,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:03:45,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:03:45,515 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2018-12-09 09:03:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:45,571 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-12-09 09:03:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:03:45,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 09:03:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:45,572 INFO L225 Difference]: With dead ends: 38 [2018-12-09 09:03:45,572 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 09:03:45,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:03:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 09:03:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-12-09 09:03:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 09:03:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-12-09 09:03:45,574 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2018-12-09 09:03:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:45,574 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-12-09 09:03:45,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:03:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-12-09 09:03:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 09:03:45,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:45,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:45,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:45,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2109839575, now seen corresponding path program 1 times [2018-12-09 09:03:45,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:45,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:45,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:45,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:45,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:03:45,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:45,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:03:45,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:03:45,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:03:45,637 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 8 states. [2018-12-09 09:03:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:45,702 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-09 09:03:45,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:03:45,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 09:03:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:45,702 INFO L225 Difference]: With dead ends: 37 [2018-12-09 09:03:45,702 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 09:03:45,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:03:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 09:03:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-09 09:03:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 09:03:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-09 09:03:45,705 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2018-12-09 09:03:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:45,705 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-09 09:03:45,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:03:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-09 09:03:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 09:03:45,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:45,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:45,706 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:45,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash 968522564, now seen corresponding path program 1 times [2018-12-09 09:03:45,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:45,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:45,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:45,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:45,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:03:45,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:45,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:03:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:03:45,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:03:45,730 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2018-12-09 09:03:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:45,756 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-12-09 09:03:45,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:03:45,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 09:03:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:45,757 INFO L225 Difference]: With dead ends: 48 [2018-12-09 09:03:45,757 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 09:03:45,758 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-09 09:03:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 09:03:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-12-09 09:03:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 09:03:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-09 09:03:45,763 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 18 [2018-12-09 09:03:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:45,763 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-09 09:03:45,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:03:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-09 09:03:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 09:03:45,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:45,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:45,764 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:45,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:45,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1669587142, now seen corresponding path program 1 times [2018-12-09 09:03:45,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:45,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:45,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:45,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:45,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:03:45,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:45,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:03:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:03:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:03:45,800 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 4 states. [2018-12-09 09:03:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:45,837 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-12-09 09:03:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:03:45,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 09:03:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:45,838 INFO L225 Difference]: With dead ends: 41 [2018-12-09 09:03:45,838 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 09:03:45,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:03:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 09:03:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-12-09 09:03:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 09:03:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-09 09:03:45,840 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-12-09 09:03:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:45,840 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-09 09:03:45,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:03:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-09 09:03:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:03:45,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:45,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:45,841 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:45,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -522185810, now seen corresponding path program 1 times [2018-12-09 09:03:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:45,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:45,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:45,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:03:45,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:45,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:03:45,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:03:45,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:03:45,863 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-12-09 09:03:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:45,898 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-09 09:03:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:03:45,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 09:03:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:45,899 INFO L225 Difference]: With dead ends: 29 [2018-12-09 09:03:45,899 INFO L226 Difference]: Without dead ends: 29 [2018-12-09 09:03:45,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:03:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-09 09:03:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-09 09:03:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 09:03:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-09 09:03:45,901 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2018-12-09 09:03:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:45,901 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-09 09:03:45,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:03:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-09 09:03:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:03:45,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:45,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:45,902 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:45,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:45,903 INFO L82 PathProgramCache]: Analyzing trace with hash -522185809, now seen corresponding path program 1 times [2018-12-09 09:03:45,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:45,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:45,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:45,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:46,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:46,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:03:46,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:46,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:03:46,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:03:46,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:03:46,031 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2018-12-09 09:03:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:46,078 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-09 09:03:46,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:03:46,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-09 09:03:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:46,079 INFO L225 Difference]: With dead ends: 63 [2018-12-09 09:03:46,079 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 09:03:46,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:03:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 09:03:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2018-12-09 09:03:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 09:03:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-09 09:03:46,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-12-09 09:03:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:46,081 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-09 09:03:46,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:03:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-09 09:03:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:03:46,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:46,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:46,082 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:46,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1108991823, now seen corresponding path program 1 times [2018-12-09 09:03:46,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:46,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:46,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:03:46,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:46,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:03:46,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:03:46,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:03:46,177 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2018-12-09 09:03:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:46,331 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-09 09:03:46,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:03:46,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-09 09:03:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:46,332 INFO L225 Difference]: With dead ends: 44 [2018-12-09 09:03:46,332 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 09:03:46,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-12-09 09:03:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 09:03:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-09 09:03:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 09:03:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-09 09:03:46,334 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-12-09 09:03:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:46,334 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-09 09:03:46,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:03:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-09 09:03:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 09:03:46,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:46,335 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:46,335 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:46,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1010147364, now seen corresponding path program 1 times [2018-12-09 09:03:46,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:46,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:46,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:03:46,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:46,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:03:46,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:03:46,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:03:46,407 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-12-09 09:03:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:46,455 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-12-09 09:03:46,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:03:46,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-09 09:03:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:46,455 INFO L225 Difference]: With dead ends: 44 [2018-12-09 09:03:46,456 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 09:03:46,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:03:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 09:03:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 09:03:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 09:03:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-09 09:03:46,458 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-12-09 09:03:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:46,458 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-09 09:03:46,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:03:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-09 09:03:46,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 09:03:46,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:46,459 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:46,459 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:46,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:46,460 INFO L82 PathProgramCache]: Analyzing trace with hash -969886, now seen corresponding path program 1 times [2018-12-09 09:03:46,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:46,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:46,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:46,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:03:46,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:03:46,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:03:46,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:03:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:03:46,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:03:46,543 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2018-12-09 09:03:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:46,629 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-12-09 09:03:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:03:46,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-09 09:03:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:46,630 INFO L225 Difference]: With dead ends: 51 [2018-12-09 09:03:46,630 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 09:03:46,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:03:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 09:03:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-12-09 09:03:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 09:03:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-09 09:03:46,632 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2018-12-09 09:03:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:46,632 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-09 09:03:46,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:03:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-09 09:03:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 09:03:46,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:46,633 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:46,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:46,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:46,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1280833564, now seen corresponding path program 1 times [2018-12-09 09:03:46,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:46,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:46,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:46,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:46,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:46,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:46,767 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-09 09:03:46,768 INFO L205 CegarAbsIntRunner]: [0], [3], [7], [8], [10], [11], [35], [37], [42], [51], [52], [56], [61], [67], [69], [70], [77], [78], [79], [81] [2018-12-09 09:03:46,789 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:46,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:46,936 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:03:46,937 INFO L272 AbstractInterpreter]: Visited 20 different actions 46 times. Merged at 7 different actions 26 times. Never widened. Performed 450 root evaluator evaluations with a maximum evaluation depth of 4. Performed 450 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-09 09:03:46,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:46,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:03:46,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:46,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:03:46,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:46,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:03:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:46,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:03:47,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 09:03:47,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:03:47,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:47,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:47,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:03:47,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 09:03:47,128 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-09 09:03:47,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 09:03:47,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:03:47,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:03:47,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:03:47,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-09 09:03:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:47,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:03:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 09:03:47,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:47,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 09:03:47,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 09:03:47,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:47,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:47,403 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-09 09:03:47,403 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 09:03:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:47,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:03:47,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2018-12-09 09:03:47,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:03:47,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 09:03:47,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 09:03:47,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-12-09 09:03:47,425 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 18 states. [2018-12-09 09:03:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:48,480 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-12-09 09:03:48,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:03:48,480 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-09 09:03:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:48,481 INFO L225 Difference]: With dead ends: 50 [2018-12-09 09:03:48,481 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 09:03:48,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 09:03:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 09:03:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-09 09:03:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 09:03:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-12-09 09:03:48,483 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 21 [2018-12-09 09:03:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:48,483 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-12-09 09:03:48,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 09:03:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-12-09 09:03:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 09:03:48,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:48,484 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:48,484 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:48,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:48,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1051134869, now seen corresponding path program 1 times [2018-12-09 09:03:48,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:48,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:48,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:48,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:48,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:48,614 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 09:03:48,614 INFO L205 CegarAbsIntRunner]: [0], [3], [7], [8], [11], [13], [35], [37], [42], [51], [52], [56], [61], [67], [69], [70], [77], [78], [79], [81] [2018-12-09 09:03:48,615 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:48,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:48,664 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:03:48,665 INFO L272 AbstractInterpreter]: Visited 20 different actions 46 times. Merged at 7 different actions 26 times. Never widened. Performed 454 root evaluator evaluations with a maximum evaluation depth of 4. Performed 454 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-09 09:03:48,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:48,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:03:48,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:48,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:03:48,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:48,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:03:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:48,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:03:48,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:03:48,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:48,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 09:03:48,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 09:03:48,707 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:48,718 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:48,722 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-09 09:03:48,722 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 09:03:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:48,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:03:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:49,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:03:49,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2018-12-09 09:03:49,107 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:03:49,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 09:03:49,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 09:03:49,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-12-09 09:03:49,108 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 21 states. [2018-12-09 09:03:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:49,518 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-09 09:03:49,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:03:49,519 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2018-12-09 09:03:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:49,520 INFO L225 Difference]: With dead ends: 49 [2018-12-09 09:03:49,520 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 09:03:49,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=1213, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 09:03:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 09:03:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-09 09:03:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 09:03:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-12-09 09:03:49,524 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 22 [2018-12-09 09:03:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:49,524 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-12-09 09:03:49,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 09:03:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-12-09 09:03:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 09:03:49,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:49,525 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:49,526 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:49,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:49,526 INFO L82 PathProgramCache]: Analyzing trace with hash 663103081, now seen corresponding path program 1 times [2018-12-09 09:03:49,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:49,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:49,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:49,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:49,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:49,668 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 09:03:49,668 INFO L205 CegarAbsIntRunner]: [0], [3], [7], [8], [11], [16], [21], [26], [27], [29], [30], [51], [52], [56], [59], [67], [69], [70], [77], [78], [79], [81] [2018-12-09 09:03:49,669 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:49,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:49,690 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:03:49,691 INFO L272 AbstractInterpreter]: Visited 22 different actions 23 times. Merged at 1 different actions 1 times. Never widened. Performed 184 root evaluator evaluations with a maximum evaluation depth of 4. Performed 184 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-09 09:03:49,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:49,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:03:49,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:49,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:03:49,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:49,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:03:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:49,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:03:49,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 09:03:49,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 09:03:49,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:49,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:49,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:03:49,742 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:49,745 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-09 09:03:49,745 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 09:03:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:49,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:03:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:50,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:03:50,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2018-12-09 09:03:50,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:03:50,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 09:03:50,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 09:03:50,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-12-09 09:03:50,131 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 20 states. [2018-12-09 09:03:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:51,392 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-12-09 09:03:51,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 09:03:51,392 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-09 09:03:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:51,393 INFO L225 Difference]: With dead ends: 57 [2018-12-09 09:03:51,393 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 09:03:51,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=307, Invalid=1949, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 09:03:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 09:03:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 09:03:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 09:03:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-09 09:03:51,395 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2018-12-09 09:03:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:51,396 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-09 09:03:51,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 09:03:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-09 09:03:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:03:51,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:51,396 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:51,397 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:51,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash -913428495, now seen corresponding path program 1 times [2018-12-09 09:03:51,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:51,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:51,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:51,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:51,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:51,534 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 09:03:51,534 INFO L205 CegarAbsIntRunner]: [0], [3], [7], [8], [11], [16], [21], [26], [29], [35], [37], [42], [51], [52], [56], [61], [67], [69], [70], [77], [78], [79], [81] [2018-12-09 09:03:51,535 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:03:51,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:03:51,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:03:51,570 INFO L272 AbstractInterpreter]: Visited 23 different actions 43 times. Merged at 10 different actions 20 times. Never widened. Performed 370 root evaluator evaluations with a maximum evaluation depth of 4. Performed 370 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-12-09 09:03:51,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:51,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:03:51,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:51,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:03:51,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:51,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:03:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:51,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:03:51,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:03:51,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:51,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 09:03:51,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 09:03:51,629 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:51,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:51,644 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-09 09:03:51,645 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 09:03:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:51,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:03:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:52,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:03:52,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2018-12-09 09:03:52,088 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:03:52,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 09:03:52,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 09:03:52,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-12-09 09:03:52,089 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2018-12-09 09:03:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:52,662 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-09 09:03:52,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:03:52,662 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-12-09 09:03:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:52,662 INFO L225 Difference]: With dead ends: 38 [2018-12-09 09:03:52,662 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 09:03:52,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=284, Invalid=1878, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 09:03:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 09:03:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-09 09:03:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 09:03:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-09 09:03:52,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-12-09 09:03:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:52,665 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-09 09:03:52,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 09:03:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-09 09:03:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 09:03:52,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:52,665 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:52,666 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:52,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1766525986, now seen corresponding path program 2 times [2018-12-09 09:03:52,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:52,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:52,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:03:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:52,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:52,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:52,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:52,912 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:03:52,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:03:52,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:52,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:03:52,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:03:52,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:03:52,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 09:03:52,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:03:52,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:03:52,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 09:03:52,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 09:03:52,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:52,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:52,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:03:52,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:52,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:52,961 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-09 09:03:52,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 09:03:52,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:03:52,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:52,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:52,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:52,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 09:03:53,055 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 23 treesize of output 24 [2018-12-09 09:03:53,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:03:53,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:53,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:53,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:53,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-12-09 09:03:53,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 09:03:53,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-12-09 09:03:53,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:03:53,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:03:53,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:03:53,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-09 09:03:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:03:53,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:03:53,468 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 39 treesize of output 30 [2018-12-09 09:03:53,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:03:53,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:53,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 09:03:53,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-09 09:03:53,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:53,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:53,495 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 20 [2018-12-09 09:03:53,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-09 09:03:53,496 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:53,499 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:53,507 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-09 09:03:53,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 09:03:53,522 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-12-09 09:03:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:53,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:03:53,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 34 [2018-12-09 09:03:53,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:03:53,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 09:03:53,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 09:03:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 09:03:53,592 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 24 states. [2018-12-09 09:03:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:54,217 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-09 09:03:54,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 09:03:54,217 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2018-12-09 09:03:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:54,217 INFO L225 Difference]: With dead ends: 30 [2018-12-09 09:03:54,217 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 09:03:54,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 09:03:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 09:03:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-09 09:03:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 09:03:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-09 09:03:54,219 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-09 09:03:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:54,219 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-09 09:03:54,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 09:03:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-09 09:03:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 09:03:54,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:03:54,220 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:03:54,220 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 09:03:54,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:03:54,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1072269331, now seen corresponding path program 2 times [2018-12-09 09:03:54,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:03:54,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:54,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:03:54,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:03:54,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:03:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:03:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:54,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:54,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:03:54,361 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:03:54,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:03:54,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:03:54,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:03:54,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:03:54,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:03:54,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 09:03:54,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:03:54,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:03:54,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:03:54,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:54,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 09:03:54,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 09:03:54,405 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:03:54,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:03:54,418 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-09 09:03:54,418 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 09:03:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:54,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:03:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:03:54,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:03:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2018-12-09 09:03:54,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:03:54,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 09:03:54,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 09:03:54,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2018-12-09 09:03:54,816 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 21 states. [2018-12-09 09:03:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:03:55,355 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-09 09:03:55,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 09:03:55,355 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-12-09 09:03:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:03:55,355 INFO L225 Difference]: With dead ends: 35 [2018-12-09 09:03:55,355 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:03:55,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=1887, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 09:03:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:03:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:03:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:03:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:03:55,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-12-09 09:03:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:03:55,356 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:03:55,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 09:03:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:03:55,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:03:55,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:03:55 BoogieIcfgContainer [2018-12-09 09:03:55,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:03:55,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:03:55,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:03:55,359 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:03:55,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:03:44" (3/4) ... [2018-12-09 09:03:55,362 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:03:55,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2018-12-09 09:03:55,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:03:55,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:03:55,368 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-09 09:03:55,368 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 09:03:55,368 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 09:03:55,392 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3567745a-49d0-411e-8f7e-9ec68ef336b5/bin-2019/utaipan/witness.graphml [2018-12-09 09:03:55,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:03:55,393 INFO L168 Benchmark]: Toolchain (without parser) took 10965.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 355.5 MB). Free memory was 947.0 MB in the beginning and 923.9 MB in the end (delta: 23.1 MB). Peak memory consumption was 378.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:03:55,394 INFO L168 Benchmark]: CDTParser took 0.13 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-09 09:03:55,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:03:55,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:03:55,395 INFO L168 Benchmark]: Boogie Preprocessor took 15.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:03:55,395 INFO L168 Benchmark]: RCFGBuilder took 170.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:03:55,395 INFO L168 Benchmark]: TraceAbstraction took 10478.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 169.2 MB). Peak memory consumption was 380.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:03:55,395 INFO L168 Benchmark]: Witness Printer took 33.54 ms. Allocated memory is still 1.4 GB. Free memory was 933.7 MB in the beginning and 923.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2018-12-09 09:03:55,396 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.13 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 247.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10478.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 169.2 MB). Peak memory consumption was 380.0 MB. Max. memory is 11.5 GB. * Witness Printer took 33.54 ms. Allocated memory is still 1.4 GB. Free memory was 933.7 MB in the beginning and 923.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: 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, 40 locations, 9 error locations. SAFE Result, 10.4s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 454 SDtfs, 668 SDslu, 2139 SDs, 0 SdLazy, 2147 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 549 GetRequests, 197 SyntacticMatches, 10 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 60 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 633 ConstructedInterpolants, 24 QuantifiedInterpolants, 154450 SizeOfPredicates, 109 NumberOfNonLiveVariables, 976 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 5/106 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...