./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/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 83897956e392064e8b9522b11a8bf4c25fb2a6e3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:33:46,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:33:46,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:33:46,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:33:46,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:33:46,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:33:46,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:33:46,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:33:46,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:33:46,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:33:46,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:33:46,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:33:46,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:33:46,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:33:46,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:33:46,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:33:46,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:33:46,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:33:46,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:33:46,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:33:46,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:33:46,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:33:46,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:33:46,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:33:46,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:33:46,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:33:46,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:33:46,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:33:46,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:33:46,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:33:46,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:33:46,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:33:46,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:33:46,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:33:46,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:33:46,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:33:46,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:33:46,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:33:46,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:33:46,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:33:46,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:33:46,804 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 11:33:46,814 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:33:46,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:33:46,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:33:46,815 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:33:46,815 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:33:46,815 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:33:46,815 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:33:46,816 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:33:46,816 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:33:46,816 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:33:46,816 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:33:46,816 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:33:46,816 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:33:46,816 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:33:46,817 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:33:46,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:33:46,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:33:46,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:33:46,818 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:33:46,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:33:46,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:33:46,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:33:46,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:33:46,818 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:33:46,818 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:33:46,818 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:33:46,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:33:46,819 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:33:46,819 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:33:46,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:33:46,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:33:46,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:33:46,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:33:46,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:33:46,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:33:46,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:33:46,820 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:33:46,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:33:46,820 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:33:46,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:33:46,821 INFO L138 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/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/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 -> 83897956e392064e8b9522b11a8bf4c25fb2a6e3 [2019-12-07 11:33:46,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:33:46,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:33:46,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:33:46,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:33:46,932 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:33:46,933 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2019-12-07 11:33:46,969 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/data/04eb55189/b992692fb279435c9dc8c420db7dd368/FLAG2fa9fa99a [2019-12-07 11:33:47,333 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:33:47,334 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2019-12-07 11:33:47,343 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/data/04eb55189/b992692fb279435c9dc8c420db7dd368/FLAG2fa9fa99a [2019-12-07 11:33:47,352 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/data/04eb55189/b992692fb279435c9dc8c420db7dd368 [2019-12-07 11:33:47,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:33:47,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:33:47,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:33:47,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:33:47,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:33:47,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362cd1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47, skipping insertion in model container [2019-12-07 11:33:47,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:33:47,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:33:47,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:33:47,618 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:33:47,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:33:47,685 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:33:47,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47 WrapperNode [2019-12-07 11:33:47,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:33:47,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:33:47,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:33:47,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:33:47,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:33:47,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:33:47,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:33:47,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:33:47,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... [2019-12-07 11:33:47,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:33:47,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:33:47,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:33:47,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:33:47,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/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 [2019-12-07 11:33:47,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:33:47,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:33:47,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:33:47,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:33:47,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:33:47,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:33:48,016 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:33:48,016 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:33:48,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:33:48 BoogieIcfgContainer [2019-12-07 11:33:48,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:33:48,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:33:48,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:33:48,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:33:48,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:33:47" (1/3) ... [2019-12-07 11:33:48,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c00d4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:33:48, skipping insertion in model container [2019-12-07 11:33:48,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:47" (2/3) ... [2019-12-07 11:33:48,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c00d4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:33:48, skipping insertion in model container [2019-12-07 11:33:48,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:33:48" (3/3) ... [2019-12-07 11:33:48,022 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2019-12-07 11:33:48,029 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:33:48,033 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-12-07 11:33:48,040 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-07 11:33:48,053 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:33:48,053 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:33:48,054 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:33:48,054 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:33:48,054 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:33:48,054 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:33:48,054 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:33:48,054 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:33:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-12-07 11:33:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:33:48,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:48,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:33:48,068 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash 104379, now seen corresponding path program 1 times [2019-12-07 11:33:48,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:48,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869378221] [2019-12-07 11:33:48,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869378221] [2019-12-07 11:33:48,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:48,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:33:48,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726947522] [2019-12-07 11:33:48,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:48,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:48,184 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-12-07 11:33:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:48,214 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-12-07 11:33:48,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:48,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:33:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:48,222 INFO L225 Difference]: With dead ends: 22 [2019-12-07 11:33:48,222 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 11:33:48,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 11:33:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 11:33:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 11:33:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 11:33:48,245 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 3 [2019-12-07 11:33:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:48,245 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 11:33:48,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 11:33:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:33:48,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:48,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:33:48,246 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash 3237988, now seen corresponding path program 1 times [2019-12-07 11:33:48,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:48,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414539137] [2019-12-07 11:33:48,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414539137] [2019-12-07 11:33:48,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:48,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:33:48,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563900914] [2019-12-07 11:33:48,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:48,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:48,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:48,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:48,288 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2019-12-07 11:33:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:48,306 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-12-07 11:33:48,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:48,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 11:33:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:48,307 INFO L225 Difference]: With dead ends: 18 [2019-12-07 11:33:48,307 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 11:33:48,308 INFO L630 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 [2019-12-07 11:33:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 11:33:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-12-07 11:33:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 11:33:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-12-07 11:33:48,310 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 4 [2019-12-07 11:33:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:48,311 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-12-07 11:33:48,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-12-07 11:33:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:33:48,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:48,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:33:48,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:48,312 INFO L82 PathProgramCache]: Analyzing trace with hash 3237989, now seen corresponding path program 1 times [2019-12-07 11:33:48,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:48,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883248720] [2019-12-07 11:33:48,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883248720] [2019-12-07 11:33:48,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:48,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:33:48,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995088847] [2019-12-07 11:33:48,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:33:48,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:33:48,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:48,366 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-12-07 11:33:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:48,386 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-12-07 11:33:48,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:33:48,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 11:33:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:48,387 INFO L225 Difference]: With dead ends: 17 [2019-12-07 11:33:48,387 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 11:33:48,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 11:33:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 11:33:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 11:33:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 11:33:48,389 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 4 [2019-12-07 11:33:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:48,389 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 11:33:48,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:33:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 11:33:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:33:48,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:48,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:33:48,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash 3236554, now seen corresponding path program 1 times [2019-12-07 11:33:48,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:48,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525443567] [2019-12-07 11:33:48,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525443567] [2019-12-07 11:33:48,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:48,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:33:48,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803377108] [2019-12-07 11:33:48,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:33:48,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:33:48,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:48,426 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 4 states. [2019-12-07 11:33:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:48,465 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-12-07 11:33:48,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:33:48,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 11:33:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:48,466 INFO L225 Difference]: With dead ends: 31 [2019-12-07 11:33:48,466 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 11:33:48,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:33:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 11:33:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2019-12-07 11:33:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 11:33:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-12-07 11:33:48,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 4 [2019-12-07 11:33:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:48,469 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-12-07 11:33:48,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:33:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-12-07 11:33:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:33:48,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:48,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:33:48,470 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:48,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1183228633, now seen corresponding path program 1 times [2019-12-07 11:33:48,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:48,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728839397] [2019-12-07 11:33:48,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728839397] [2019-12-07 11:33:48,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:48,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:33:48,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113454085] [2019-12-07 11:33:48,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:33:48,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:48,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:33:48,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:33:48,517 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 5 states. [2019-12-07 11:33:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:48,560 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-12-07 11:33:48,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:33:48,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 11:33:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:48,561 INFO L225 Difference]: With dead ends: 26 [2019-12-07 11:33:48,561 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 11:33:48,561 INFO L630 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 [2019-12-07 11:33:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 11:33:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-12-07 11:33:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 11:33:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-12-07 11:33:48,564 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2019-12-07 11:33:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:48,564 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-12-07 11:33:48,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:33:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-12-07 11:33:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:33:48,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:48,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:33:48,565 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1183228634, now seen corresponding path program 1 times [2019-12-07 11:33:48,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:48,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241601545] [2019-12-07 11:33:48,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241601545] [2019-12-07 11:33:48,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:48,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:33:48,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671194673] [2019-12-07 11:33:48,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:33:48,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:48,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:33:48,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:48,595 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 4 states. [2019-12-07 11:33:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:48,620 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-12-07 11:33:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:33:48,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 11:33:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:48,621 INFO L225 Difference]: With dead ends: 20 [2019-12-07 11:33:48,621 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 11:33:48,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:33:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 11:33:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 11:33:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 11:33:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-12-07 11:33:48,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 6 [2019-12-07 11:33:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:48,624 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-12-07 11:33:48,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:33:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-12-07 11:33:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:33:48,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:48,625 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 11:33:48,625 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1184597673, now seen corresponding path program 1 times [2019-12-07 11:33:48,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:48,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110016763] [2019-12-07 11:33:48,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110016763] [2019-12-07 11:33:48,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789810065] [2019-12-07 11:33:48,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:48,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:33:48,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:48,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:48,753 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 11:33:48,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:48,774 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 11:33:48,776 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:48,776 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 11:33:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,796 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:48,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:48,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [455362159] [2019-12-07 11:33:48,860 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 11:33:48,860 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:33:48,863 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:33:48,868 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:33:48,868 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:33:49,028 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:33:49,036 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:33:49,172 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:33:49,523 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:33:49,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:33:49,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-12-07 11:33:49,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505726037] [2019-12-07 11:33:49,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:33:49,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:33:49,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:33:49,524 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 9 states. [2019-12-07 11:33:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:49,630 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-12-07 11:33:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:33:49,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-12-07 11:33:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:49,631 INFO L225 Difference]: With dead ends: 46 [2019-12-07 11:33:49,631 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 11:33:49,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:33:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 11:33:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 17. [2019-12-07 11:33:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 11:33:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 11:33:49,634 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 6 [2019-12-07 11:33:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:49,634 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 11:33:49,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:33:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 11:33:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:33:49,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:49,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:49,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:49,835 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:49,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1974618029, now seen corresponding path program 1 times [2019-12-07 11:33:49,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:49,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335593155] [2019-12-07 11:33:49,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:49,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335593155] [2019-12-07 11:33:49,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:49,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:33:49,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662072030] [2019-12-07 11:33:49,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:33:49,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:49,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:33:49,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:33:49,940 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 5 states. [2019-12-07 11:33:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:50,014 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-12-07 11:33:50,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:33:50,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 11:33:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:50,015 INFO L225 Difference]: With dead ends: 16 [2019-12-07 11:33:50,015 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 11:33:50,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:33:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 11:33:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 11:33:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 11:33:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-12-07 11:33:50,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 7 [2019-12-07 11:33:50,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:50,017 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-12-07 11:33:50,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:33:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-12-07 11:33:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:33:50,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:50,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:50,018 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1974618030, now seen corresponding path program 1 times [2019-12-07 11:33:50,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:50,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992602685] [2019-12-07 11:33:50,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:50,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992602685] [2019-12-07 11:33:50,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:50,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:33:50,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250763690] [2019-12-07 11:33:50,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:33:50,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:50,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:33:50,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:33:50,057 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 5 states. [2019-12-07 11:33:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:50,095 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-12-07 11:33:50,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:33:50,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 11:33:50,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:50,095 INFO L225 Difference]: With dead ends: 18 [2019-12-07 11:33:50,095 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 11:33:50,096 INFO L630 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 [2019-12-07 11:33:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 11:33:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-12-07 11:33:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 11:33:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 11:33:50,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 7 [2019-12-07 11:33:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:50,097 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 11:33:50,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:33:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 11:33:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:33:50,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:50,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:50,098 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1973640198, now seen corresponding path program 1 times [2019-12-07 11:33:50,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:50,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475972549] [2019-12-07 11:33:50,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:50,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475972549] [2019-12-07 11:33:50,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:50,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:33:50,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719719937] [2019-12-07 11:33:50,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:33:50,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:50,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:33:50,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:50,127 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 4 states. [2019-12-07 11:33:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:50,139 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-12-07 11:33:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:33:50,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 11:33:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:50,140 INFO L225 Difference]: With dead ends: 16 [2019-12-07 11:33:50,140 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 11:33:50,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 11:33:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 11:33:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 11:33:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-12-07 11:33:50,142 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-12-07 11:33:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:50,143 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-12-07 11:33:50,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:33:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-12-07 11:33:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:33:50,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:50,143 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:50,143 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:50,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:50,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1973641391, now seen corresponding path program 1 times [2019-12-07 11:33:50,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:50,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709883778] [2019-12-07 11:33:50,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:50,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709883778] [2019-12-07 11:33:50,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:50,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:33:50,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426511787] [2019-12-07 11:33:50,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:33:50,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:50,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:33:50,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:33:50,212 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2019-12-07 11:33:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:50,268 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 11:33:50,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:33:50,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 11:33:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:50,269 INFO L225 Difference]: With dead ends: 21 [2019-12-07 11:33:50,269 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 11:33:50,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:33:50,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 11:33:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-12-07 11:33:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 11:33:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-12-07 11:33:50,271 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2019-12-07 11:33:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:50,271 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-12-07 11:33:50,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:33:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-12-07 11:33:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:33:50,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:50,272 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:50,272 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash 679254396, now seen corresponding path program 1 times [2019-12-07 11:33:50,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:50,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158403984] [2019-12-07 11:33:50,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:50,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158403984] [2019-12-07 11:33:50,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235923340] [2019-12-07 11:33:50,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:50,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 11:33:50,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:50,428 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:50,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [812230340] [2019-12-07 11:33:50,507 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 11:33:50,507 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:33:50,507 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:33:50,507 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:33:50,507 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:33:50,587 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:33:50,878 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:33:51,058 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-12-07 11:33:51,715 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 127 [2019-12-07 11:33:51,903 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 11:33:52,111 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-12-07 11:33:52,345 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-12-07 11:33:52,346 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:33:52,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:33:52,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2019-12-07 11:33:52,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549352313] [2019-12-07 11:33:52,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:33:52,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:33:52,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:33:52,347 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 17 states. [2019-12-07 11:33:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:52,557 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 11:33:52,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:33:52,557 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-12-07 11:33:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:52,558 INFO L225 Difference]: With dead ends: 21 [2019-12-07 11:33:52,558 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 11:33:52,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:33:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 11:33:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-12-07 11:33:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 11:33:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-12-07 11:33:52,560 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2019-12-07 11:33:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:52,560 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-12-07 11:33:52,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:33:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-12-07 11:33:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:33:52,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:52,560 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:52,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:52,761 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:52,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:52,762 INFO L82 PathProgramCache]: Analyzing trace with hash -417950215, now seen corresponding path program 1 times [2019-12-07 11:33:52,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:52,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190777446] [2019-12-07 11:33:52,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:52,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190777446] [2019-12-07 11:33:52,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830177279] [2019-12-07 11:33:52,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:52,872 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 11:33:52,874 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:53,028 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:53,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [787558241] [2019-12-07 11:33:53,144 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 11:33:53,144 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:33:53,144 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:33:53,144 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:33:53,145 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:33:53,386 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:33:53,403 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:33:53,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 11:33:53,811 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 11:33:53,926 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:33:54,156 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-12-07 11:33:54,457 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-12-07 11:33:56,866 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-12-07 11:33:57,121 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 11:33:57,433 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-12-07 11:33:57,772 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-12-07 11:33:57,773 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:33:57,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:33:57,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2019-12-07 11:33:57,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603810039] [2019-12-07 11:33:57,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 11:33:57,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:33:57,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 11:33:57,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2019-12-07 11:33:57,775 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 21 states. [2019-12-07 11:33:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:58,216 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-12-07 11:33:58,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:33:58,217 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 13 [2019-12-07 11:33:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:58,217 INFO L225 Difference]: With dead ends: 20 [2019-12-07 11:33:58,217 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 11:33:58,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=185, Invalid=1147, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 11:33:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 11:33:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-12-07 11:33:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 11:33:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-12-07 11:33:58,219 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2019-12-07 11:33:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:58,219 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-12-07 11:33:58,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 11:33:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-12-07 11:33:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:33:58,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:58,219 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:58,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:58,421 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:33:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash -44668284, now seen corresponding path program 2 times [2019-12-07 11:33:58,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:33:58,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086630061] [2019-12-07 11:33:58,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:58,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086630061] [2019-12-07 11:33:58,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876474055] [2019-12-07 11:33:58,608 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:58,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 11:33:58,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:33:58,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 11:33:58,649 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:33:58,876 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:33:59,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2055066744] [2019-12-07 11:33:59,219 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 11:33:59,219 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:33:59,220 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:33:59,220 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:33:59,220 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:33:59,297 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:33:59,303 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:33:59,543 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:33:59,763 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-12-07 11:34:00,224 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 11:34:00,630 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 127 [2019-12-07 11:34:00,854 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 11:34:01,100 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-12-07 11:34:01,405 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-12-07 11:34:01,406 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:34:01,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:34:01,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2019-12-07 11:34:01,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310957391] [2019-12-07 11:34:01,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 11:34:01,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:34:01,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 11:34:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 11:34:01,408 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-12-07 11:34:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:02,367 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 11:34:02,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:34:02,367 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 16 [2019-12-07 11:34:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:02,367 INFO L225 Difference]: With dead ends: 30 [2019-12-07 11:34:02,367 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 11:34:02,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=388, Invalid=2368, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 11:34:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 11:34:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-12-07 11:34:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 11:34:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 11:34:02,370 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-12-07 11:34:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:02,370 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 11:34:02,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 11:34:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 11:34:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:34:02,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:02,370 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 11:34:02,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:02,572 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:34:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash 899652740, now seen corresponding path program 2 times [2019-12-07 11:34:02,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:34:02,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155318492] [2019-12-07 11:34:02,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:02,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155318492] [2019-12-07 11:34:02,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436608468] [2019-12-07 11:34:02,667 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:02,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 11:34:02,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:34:02,705 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 72 conjunts are in the unsatisfiable core [2019-12-07 11:34:02,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:34:02,835 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:34:02,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [138620304] [2019-12-07 11:34:02,974 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 11:34:02,974 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:34:02,974 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:34:02,974 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:34:02,974 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:34:03,049 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:34:03,053 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:34:03,281 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:34:03,517 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-12-07 11:34:04,191 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 127 [2019-12-07 11:34:04,383 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 11:34:04,612 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-12-07 11:34:04,863 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-12-07 11:34:04,864 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:34:04,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:34:04,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2019-12-07 11:34:04,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150851838] [2019-12-07 11:34:04,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:34:04,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:34:04,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:34:04,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:34:04,865 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 23 states. [2019-12-07 11:34:05,415 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 11:34:05,838 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-12-07 11:34:06,123 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-12-07 11:34:06,825 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-07 11:34:07,054 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-07 11:34:07,276 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 11:34:07,474 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 11:34:07,663 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 11:34:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:07,711 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 11:34:07,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 11:34:07,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-12-07 11:34:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:07,714 INFO L225 Difference]: With dead ends: 36 [2019-12-07 11:34:07,714 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 11:34:07,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=423, Invalid=2127, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 11:34:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 11:34:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 11:34:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 11:34:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-12-07 11:34:07,721 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 19 [2019-12-07 11:34:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:07,722 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-12-07 11:34:07,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:34:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-12-07 11:34:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 11:34:07,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:07,724 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 11:34:07,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:07,925 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:34:07,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:07,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1777598052, now seen corresponding path program 3 times [2019-12-07 11:34:07,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:34:07,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552331503] [2019-12-07 11:34:07,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:34:08,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552331503] [2019-12-07 11:34:08,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922238447] [2019-12-07 11:34:08,128 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:08,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:34:08,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:34:08,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 11:34:08,173 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:34:08,339 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:34:08,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [803982564] [2019-12-07 11:34:08,502 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 11:34:08,502 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:34:08,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:34:08,503 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:34:08,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:34:08,586 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:34:08,591 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:34:08,595 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 11:34:08,825 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:34:09,046 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-12-07 11:34:09,750 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 127 [2019-12-07 11:34:09,945 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 11:34:10,191 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-12-07 11:34:10,459 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-12-07 11:34:10,461 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:34:10,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:34:10,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2019-12-07 11:34:10,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955761383] [2019-12-07 11:34:10,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 11:34:10,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:34:10,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 11:34:10,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1570, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 11:34:10,462 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 33 states. [2019-12-07 11:34:11,208 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-12-07 11:34:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:12,310 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-12-07 11:34:12,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 11:34:12,310 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 35 [2019-12-07 11:34:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:12,311 INFO L225 Difference]: With dead ends: 54 [2019-12-07 11:34:12,311 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:34:12,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=574, Invalid=4256, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 11:34:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:34:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:34:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:34:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:34:12,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-12-07 11:34:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:12,313 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:34:12,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 11:34:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:34:12,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:34:12,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:12,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:34:12 BoogieIcfgContainer [2019-12-07 11:34:12,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:34:12,521 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:34:12,521 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:34:12,521 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:34:12,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:33:48" (3/4) ... [2019-12-07 11:34:12,523 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:34:12,530 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-12-07 11:34:12,530 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 11:34:12,530 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:34:12,557 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ffc76bfb-5e96-4d93-b2df-5cc1b4851aca/bin/utaipan/witness.graphml [2019-12-07 11:34:12,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:34:12,558 INFO L168 Benchmark]: Toolchain (without parser) took 25203.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 942.5 MB in the beginning and 974.3 MB in the end (delta: -31.8 MB). Peak memory consumption was 285.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:12,558 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:34:12,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:12,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:34:12,559 INFO L168 Benchmark]: Boogie Preprocessor took 22.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:12,559 INFO L168 Benchmark]: RCFGBuilder took 276.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:12,559 INFO L168 Benchmark]: TraceAbstraction took 24502.84 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 977.6 MB in the end (delta: 80.7 MB). Peak memory consumption was 288.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:12,559 INFO L168 Benchmark]: Witness Printer took 36.27 ms. Allocated memory is still 1.3 GB. Free memory was 977.6 MB in the beginning and 974.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:34:12,560 INFO L335 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 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 276.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24502.84 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 977.6 MB in the end (delta: 80.7 MB). Peak memory consumption was 288.8 MB. Max. memory is 11.5 GB. * Witness Printer took 36.27 ms. Allocated memory is still 1.3 GB. Free memory was 977.6 MB in the beginning and 974.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 9 error locations. Result: SAFE, OverallTime: 24.4s, OverallIterations: 16, TraceHistogramMax: 7, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 141 SDtfs, 577 SDslu, 253 SDs, 0 SdLazy, 1356 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 184 SyntacticMatches, 5 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2604 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 53 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 263 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 336 ConstructedInterpolants, 23 QuantifiedInterpolants, 71336 SizeOfPredicates, 118 NumberOfNonLiveVariables, 894 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 211/344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...