./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13fe1afeee88065faace0f9ad16456f5e678cf43 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 15:09:39,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 15:09:39,813 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 15:09:39,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 15:09:39,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 15:09:39,819 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 15:09:39,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 15:09:39,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 15:09:39,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 15:09:39,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 15:09:39,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 15:09:39,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 15:09:39,823 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 15:09:39,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 15:09:39,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 15:09:39,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 15:09:39,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 15:09:39,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 15:09:39,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 15:09:39,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 15:09:39,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 15:09:39,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 15:09:39,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 15:09:39,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 15:09:39,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 15:09:39,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 15:09:39,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 15:09:39,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 15:09:39,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 15:09:39,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 15:09:39,832 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 15:09:39,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 15:09:39,833 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 15:09:39,833 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 15:09:39,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 15:09:39,834 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 15:09:39,834 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-08 15:09:39,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 15:09:39,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 15:09:39,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 15:09:39,842 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 15:09:39,842 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 15:09:39,842 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 15:09:39,842 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 15:09:39,842 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 15:09:39,843 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 15:09:39,843 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 15:09:39,843 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 15:09:39,843 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 15:09:39,843 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 15:09:39,843 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 15:09:39,844 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 15:09:39,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 15:09:39,844 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 15:09:39,844 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 15:09:39,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 15:09:39,844 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 15:09:39,844 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 15:09:39,844 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 15:09:39,845 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 15:09:39,845 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 15:09:39,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 15:09:39,845 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 15:09:39,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 15:09:39,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 15:09:39,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 15:09:39,845 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 15:09:39,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 15:09:39,846 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 15:09:39,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 15:09:39,846 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 15:09:39,846 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 15:09:39,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 15:09:39,846 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13fe1afeee88065faace0f9ad16456f5e678cf43 [2018-12-08 15:09:39,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 15:09:39,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 15:09:39,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 15:09:39,873 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 15:09:39,873 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 15:09:39,873 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-12-08 15:09:39,908 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/data/5bccdefd8/c2a4a0ef55f34691866f8ce2d9f06030/FLAG216e42ef3 [2018-12-08 15:09:40,269 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 15:09:40,269 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-12-08 15:09:40,276 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/data/5bccdefd8/c2a4a0ef55f34691866f8ce2d9f06030/FLAG216e42ef3 [2018-12-08 15:09:40,655 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/data/5bccdefd8/c2a4a0ef55f34691866f8ce2d9f06030 [2018-12-08 15:09:40,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 15:09:40,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 15:09:40,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 15:09:40,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 15:09:40,675 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 15:09:40,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:09:40" (1/1) ... [2018-12-08 15:09:40,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2265590a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:40, skipping insertion in model container [2018-12-08 15:09:40,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:09:40" (1/1) ... [2018-12-08 15:09:40,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 15:09:40,763 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 15:09:40,929 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:09:40,936 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 15:09:41,005 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:09:41,026 INFO L195 MainTranslator]: Completed translation [2018-12-08 15:09:41,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41 WrapperNode [2018-12-08 15:09:41,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 15:09:41,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 15:09:41,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 15:09:41,027 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 15:09:41,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... [2018-12-08 15:09:41,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... [2018-12-08 15:09:41,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 15:09:41,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 15:09:41,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 15:09:41,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 15:09:41,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... [2018-12-08 15:09:41,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... [2018-12-08 15:09:41,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... [2018-12-08 15:09:41,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... [2018-12-08 15:09:41,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... [2018-12-08 15:09:41,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... [2018-12-08 15:09:41,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... [2018-12-08 15:09:41,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 15:09:41,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 15:09:41,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 15:09:41,061 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 15:09:41,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 15:09:41,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 15:09:41,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 15:09:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 15:09:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 15:09:41,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 15:09:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 15:09:41,092 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 15:09:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure lis [2018-12-08 15:09:41,092 INFO L138 BoogieDeclarations]: Found implementation of procedure lis [2018-12-08 15:09:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 15:09:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 15:09:41,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 15:09:41,281 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 15:09:41,281 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 15:09:41,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:09:41 BoogieIcfgContainer [2018-12-08 15:09:41,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 15:09:41,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 15:09:41,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 15:09:41,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 15:09:41,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 03:09:40" (1/3) ... [2018-12-08 15:09:41,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7645b1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:09:41, skipping insertion in model container [2018-12-08 15:09:41,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:09:41" (2/3) ... [2018-12-08 15:09:41,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7645b1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:09:41, skipping insertion in model container [2018-12-08 15:09:41,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:09:41" (3/3) ... [2018-12-08 15:09:41,286 INFO L112 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-12-08 15:09:41,292 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 15:09:41,296 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-12-08 15:09:41,305 INFO L257 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2018-12-08 15:09:41,320 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 15:09:41,320 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 15:09:41,320 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 15:09:41,321 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 15:09:41,321 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 15:09:41,321 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 15:09:41,321 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 15:09:41,321 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 15:09:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-12-08 15:09:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 15:09:41,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:41,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:41,336 INFO L423 AbstractCegarLoop]: === Iteration 1 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:41,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2015953415, now seen corresponding path program 1 times [2018-12-08 15:09:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:41,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:41,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:41,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:41,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 15:09:41,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:41,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 15:09:41,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:09:41,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:09:41,457 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2018-12-08 15:09:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:41,521 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-12-08 15:09:41,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:09:41,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 15:09:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:41,528 INFO L225 Difference]: With dead ends: 62 [2018-12-08 15:09:41,528 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 15:09:41,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:09:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 15:09:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-08 15:09:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 15:09:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-12-08 15:09:41,552 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 12 [2018-12-08 15:09:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:41,552 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-12-08 15:09:41,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 15:09:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-12-08 15:09:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 15:09:41,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:41,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:41,553 INFO L423 AbstractCegarLoop]: === Iteration 2 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:41,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2015953414, now seen corresponding path program 1 times [2018-12-08 15:09:41,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:41,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:41,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:41,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 15:09:41,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:41,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:09:41,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:09:41,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:09:41,637 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2018-12-08 15:09:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:41,729 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-12-08 15:09:41,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:09:41,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-08 15:09:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:41,730 INFO L225 Difference]: With dead ends: 65 [2018-12-08 15:09:41,731 INFO L226 Difference]: Without dead ends: 65 [2018-12-08 15:09:41,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 15:09:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-08 15:09:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-12-08 15:09:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-08 15:09:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-12-08 15:09:41,737 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 12 [2018-12-08 15:09:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:41,737 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-12-08 15:09:41,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:09:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-12-08 15:09:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 15:09:41,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:41,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:41,738 INFO L423 AbstractCegarLoop]: === Iteration 3 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:41,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1929953560, now seen corresponding path program 1 times [2018-12-08 15:09:41,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:41,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:41,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:41,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:41,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:09:41,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:41,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:09:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:09:41,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 15:09:41,795 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 5 states. [2018-12-08 15:09:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:41,886 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-12-08 15:09:41,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:09:41,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-08 15:09:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:41,886 INFO L225 Difference]: With dead ends: 77 [2018-12-08 15:09:41,887 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 15:09:41,887 INFO L631 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 [2018-12-08 15:09:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 15:09:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2018-12-08 15:09:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 15:09:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-12-08 15:09:41,890 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 13 [2018-12-08 15:09:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:41,890 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-12-08 15:09:41,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:09:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-12-08 15:09:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 15:09:41,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:41,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:41,890 INFO L423 AbstractCegarLoop]: === Iteration 4 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:41,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:41,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1929953559, now seen corresponding path program 1 times [2018-12-08 15:09:41,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:41,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:41,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:41,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:41,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 15:09:41,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:41,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 15:09:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:09:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:09:41,907 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 3 states. [2018-12-08 15:09:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:41,926 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-12-08 15:09:41,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:09:41,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 15:09:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:41,926 INFO L225 Difference]: With dead ends: 57 [2018-12-08 15:09:41,926 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 15:09:41,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:09:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 15:09:41,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-08 15:09:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 15:09:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-12-08 15:09:41,929 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-12-08 15:09:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:41,930 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-12-08 15:09:41,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 15:09:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-12-08 15:09:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 15:09:41,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:41,930 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:41,930 INFO L423 AbstractCegarLoop]: === Iteration 5 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:41,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:41,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1480727553, now seen corresponding path program 1 times [2018-12-08 15:09:41,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:41,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:41,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:41,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:41,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:41,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:09:41,984 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-08 15:09:41,986 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [13], [14], [18], [114], [117], [121], [126], [127], [128], [130] [2018-12-08 15:09:42,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:09:42,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:09:42,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:09:42,102 INFO L272 AbstractInterpreter]: Visited 15 different actions 16 times. Merged at 1 different actions 1 times. Never widened. Performed 129 root evaluator evaluations with a maximum evaluation depth of 4. Performed 129 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-08 15:09:42,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:42,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:09:42,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:42,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:09:42,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:42,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:09:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:42,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:09:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:42,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:09:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:42,213 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:09:42,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-12-08 15:09:42,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:42,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:09:42,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:09:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-08 15:09:42,213 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-12-08 15:09:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:42,293 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-12-08 15:09:42,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:09:42,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-08 15:09:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:42,295 INFO L225 Difference]: With dead ends: 86 [2018-12-08 15:09:42,295 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 15:09:42,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:09:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 15:09:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2018-12-08 15:09:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 15:09:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-12-08 15:09:42,300 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 16 [2018-12-08 15:09:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:42,300 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-12-08 15:09:42,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:09:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-12-08 15:09:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 15:09:42,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:42,301 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:42,301 INFO L423 AbstractCegarLoop]: === Iteration 6 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:42,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1873754563, now seen corresponding path program 1 times [2018-12-08 15:09:42,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:42,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:42,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:42,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:42,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:09:42,370 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-08 15:09:42,371 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [13], [14], [18], [114], [119], [121], [126], [127], [128], [130] [2018-12-08 15:09:42,371 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:09:42,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:09:42,412 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:09:42,412 INFO L272 AbstractInterpreter]: Visited 15 different actions 25 times. Merged at 5 different actions 10 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 4. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-08 15:09:42,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:42,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:09:42,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:42,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:09:42,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:42,420 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:09:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:42,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:09:42,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 15:09:42,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:42,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-08 15:09:42,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-12-08 15:09:42,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:42,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:42,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:09:42,493 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 [2018-12-08 15:09:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:42,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:09:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:42,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:09:42,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2018-12-08 15:09:42,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:09:42,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 15:09:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 15:09:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-08 15:09:42,601 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 9 states. [2018-12-08 15:09:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:42,752 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-12-08 15:09:42,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:09:42,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-08 15:09:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:42,753 INFO L225 Difference]: With dead ends: 89 [2018-12-08 15:09:42,753 INFO L226 Difference]: Without dead ends: 89 [2018-12-08 15:09:42,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:09:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-08 15:09:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-12-08 15:09:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 15:09:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-12-08 15:09:42,756 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 16 [2018-12-08 15:09:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:42,756 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-12-08 15:09:42,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 15:09:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-12-08 15:09:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 15:09:42,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:42,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:42,757 INFO L423 AbstractCegarLoop]: === Iteration 7 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:42,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash 666210904, now seen corresponding path program 1 times [2018-12-08 15:09:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:42,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:42,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:42,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:42,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:42,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:42,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 15:09:42,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:42,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 15:09:42,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 15:09:42,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 15:09:42,796 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 7 states. [2018-12-08 15:09:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:42,836 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2018-12-08 15:09:42,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:09:42,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-08 15:09:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:42,837 INFO L225 Difference]: With dead ends: 76 [2018-12-08 15:09:42,837 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 15:09:42,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:09:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 15:09:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-08 15:09:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 15:09:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-12-08 15:09:42,840 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 19 [2018-12-08 15:09:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:42,840 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-12-08 15:09:42,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 15:09:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-12-08 15:09:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 15:09:42,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:42,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:42,841 INFO L423 AbstractCegarLoop]: === Iteration 8 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:42,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:42,841 INFO L82 PathProgramCache]: Analyzing trace with hash 666210905, now seen corresponding path program 1 times [2018-12-08 15:09:42,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:42,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:42,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:42,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:42,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:42,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:42,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:09:42,878 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-08 15:09:42,878 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [11], [14], [18], [22], [30], [38], [41], [114], [119], [121], [126], [127], [128], [130] [2018-12-08 15:09:42,879 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:09:42,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:09:42,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:09:42,916 INFO L272 AbstractInterpreter]: Visited 19 different actions 37 times. Merged at 5 different actions 15 times. Widened at 1 different actions 1 times. Performed 254 root evaluator evaluations with a maximum evaluation depth of 4. Performed 254 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-08 15:09:42,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:42,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:09:42,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:42,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:09:42,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:42,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:09:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:42,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:09:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:42,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:09:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:42,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:09:42,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-08 15:09:42,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:09:42,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:09:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:09:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:09:42,982 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 8 states. [2018-12-08 15:09:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:43,053 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-12-08 15:09:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:09:43,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-08 15:09:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:43,054 INFO L225 Difference]: With dead ends: 136 [2018-12-08 15:09:43,054 INFO L226 Difference]: Without dead ends: 136 [2018-12-08 15:09:43,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-08 15:09:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-08 15:09:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2018-12-08 15:09:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 15:09:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2018-12-08 15:09:43,060 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 19 [2018-12-08 15:09:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:43,061 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2018-12-08 15:09:43,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:09:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2018-12-08 15:09:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 15:09:43,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:43,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:43,062 INFO L423 AbstractCegarLoop]: === Iteration 9 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:43,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:43,062 INFO L82 PathProgramCache]: Analyzing trace with hash 188804132, now seen corresponding path program 1 times [2018-12-08 15:09:43,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:43,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:43,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:43,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:43,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:43,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:43,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 15:09:43,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:43,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:09:43,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:09:43,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:09:43,122 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 8 states. [2018-12-08 15:09:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:43,201 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-12-08 15:09:43,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:09:43,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-12-08 15:09:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:43,202 INFO L225 Difference]: With dead ends: 97 [2018-12-08 15:09:43,202 INFO L226 Difference]: Without dead ends: 97 [2018-12-08 15:09:43,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-08 15:09:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-08 15:09:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2018-12-08 15:09:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-08 15:09:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-12-08 15:09:43,205 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 20 [2018-12-08 15:09:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:43,205 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-12-08 15:09:43,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:09:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-12-08 15:09:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 15:09:43,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:43,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:43,206 INFO L423 AbstractCegarLoop]: === Iteration 10 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:43,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:43,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1827439692, now seen corresponding path program 2 times [2018-12-08 15:09:43,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:43,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:43,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:43,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:43,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:43,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:43,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:09:43,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:09:43,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:09:43,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:43,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:09:43,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:09:43,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:09:43,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 15:09:43,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:09:43,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:09:43,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 15:09:43,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:43,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 15:09:43,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:43,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:43,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-12-08 15:09:43,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:09:43,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:09:43,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:09:43,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 15:09:43,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:43,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-08 15:09:43,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-08 15:09:43,437 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:43,443 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:43,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 15:09:43,451 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:45, output treesize:40 [2018-12-08 15:09:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:09:43,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:09:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:09:43,712 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:09:43,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 18 [2018-12-08 15:09:43,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:43,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 15:09:43,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 15:09:43,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-12-08 15:09:43,713 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 7 states. [2018-12-08 15:09:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:43,934 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2018-12-08 15:09:43,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 15:09:43,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-08 15:09:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:43,935 INFO L225 Difference]: With dead ends: 84 [2018-12-08 15:09:43,935 INFO L226 Difference]: Without dead ends: 84 [2018-12-08 15:09:43,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-12-08 15:09:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-08 15:09:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-08 15:09:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-08 15:09:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2018-12-08 15:09:43,938 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 23 [2018-12-08 15:09:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:43,938 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2018-12-08 15:09:43,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 15:09:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2018-12-08 15:09:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 15:09:43,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:43,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:43,939 INFO L423 AbstractCegarLoop]: === Iteration 11 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:43,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:43,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1753474412, now seen corresponding path program 1 times [2018-12-08 15:09:43,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:43,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:09:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:43,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:43,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:43,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:09:43,964 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-08 15:09:43,965 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [11], [14], [18], [22], [28], [83], [89], [109], [110], [114], [117], [121], [123], [125], [126], [127], [128], [130], [131] [2018-12-08 15:09:43,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:09:43,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:09:43,986 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 15:09:43,987 INFO L272 AbstractInterpreter]: Visited 19 different actions 21 times. Merged at 1 different actions 1 times. Never widened. Performed 136 root evaluator evaluations with a maximum evaluation depth of 4. Performed 136 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-08 15:09:43,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:43,988 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 15:09:44,022 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 75.15% of their original sizes. [2018-12-08 15:09:44,022 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 15:09:44,063 INFO L418 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-12-08 15:09:44,063 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 15:09:44,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:09:44,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-12-08 15:09:44,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:44,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 15:09:44,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 15:09:44,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-08 15:09:44,065 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand 11 states. [2018-12-08 15:09:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:44,289 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-12-08 15:09:44,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:09:44,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-12-08 15:09:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:44,290 INFO L225 Difference]: With dead ends: 90 [2018-12-08 15:09:44,290 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 15:09:44,290 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:09:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 15:09:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-12-08 15:09:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-08 15:09:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2018-12-08 15:09:44,293 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 24 [2018-12-08 15:09:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:44,294 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2018-12-08 15:09:44,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 15:09:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-12-08 15:09:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 15:09:44,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:44,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:44,295 INFO L423 AbstractCegarLoop]: === Iteration 12 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:44,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash -240670294, now seen corresponding path program 1 times [2018-12-08 15:09:44,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:44,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:44,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:44,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:44,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:44,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:44,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:09:44,339 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-08 15:09:44,339 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [11], [14], [18], [22], [28], [83], [89], [109], [110], [114], [119], [121], [123], [125], [126], [127], [128], [130], [131] [2018-12-08 15:09:44,340 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:09:44,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:09:44,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:09:44,358 INFO L272 AbstractInterpreter]: Visited 24 different actions 36 times. Merged at 5 different actions 10 times. Never widened. Performed 222 root evaluator evaluations with a maximum evaluation depth of 4. Performed 222 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 2 different actions. Largest state had 29 variables. [2018-12-08 15:09:44,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:44,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:09:44,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:44,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:09:44,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:44,370 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:09:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:44,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:09:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 15:09:44,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:09:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 15:09:44,477 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:09:44,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 12 [2018-12-08 15:09:44,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:44,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:09:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:09:44,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-08 15:09:44,478 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 6 states. [2018-12-08 15:09:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:44,514 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2018-12-08 15:09:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:09:44,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-08 15:09:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:44,516 INFO L225 Difference]: With dead ends: 93 [2018-12-08 15:09:44,516 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 15:09:44,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:09:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 15:09:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2018-12-08 15:09:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-08 15:09:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-12-08 15:09:44,518 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 24 [2018-12-08 15:09:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:44,518 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-12-08 15:09:44,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:09:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-12-08 15:09:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 15:09:44,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:44,519 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:44,519 INFO L423 AbstractCegarLoop]: === Iteration 13 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:44,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:44,520 INFO L82 PathProgramCache]: Analyzing trace with hash -816055622, now seen corresponding path program 1 times [2018-12-08 15:09:44,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:44,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:44,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:44,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:44,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:09:44,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:44,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 15:09:44,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:44,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:09:44,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:09:44,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:09:44,566 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 8 states. [2018-12-08 15:09:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:44,634 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-12-08 15:09:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 15:09:44,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-08 15:09:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:44,634 INFO L225 Difference]: With dead ends: 114 [2018-12-08 15:09:44,634 INFO L226 Difference]: Without dead ends: 114 [2018-12-08 15:09:44,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-08 15:09:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-08 15:09:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2018-12-08 15:09:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-08 15:09:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-12-08 15:09:44,636 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 24 [2018-12-08 15:09:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:44,637 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-12-08 15:09:44,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:09:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-12-08 15:09:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 15:09:44,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:44,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:44,637 INFO L423 AbstractCegarLoop]: === Iteration 14 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:44,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1362734417, now seen corresponding path program 1 times [2018-12-08 15:09:44,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:44,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:44,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:44,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:44,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:44,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:44,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:09:44,842 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-08 15:09:44,842 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [11], [14], [18], [22], [28], [83], [89], [91], [92], [103], [105], [109], [110], [114], [117], [121], [123], [125], [126], [127], [128], [130], [131] [2018-12-08 15:09:44,843 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:09:44,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:09:44,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:09:44,859 INFO L272 AbstractInterpreter]: Visited 28 different actions 32 times. Merged at 2 different actions 2 times. Never widened. Performed 172 root evaluator evaluations with a maximum evaluation depth of 4. Performed 172 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-08 15:09:44,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:44,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:09:44,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:44,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:09:44,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:44,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:09:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:44,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:09:44,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 15:09:44,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-08 15:09:44,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-08 15:09:44,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 15:09:44,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-08 15:09:44,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 15:09:44,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 15:09:44,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 15:09:44,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-12-08 15:09:44,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 15:09:44,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 15:09:44,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 15:09:44,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:44,981 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-12-08 15:09:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:44,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:09:45,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-12-08 15:09:45,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-08 15:09:45,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:45,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 15:09:45,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-12-08 15:09:45,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 15:09:45,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:09:45,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-12-08 15:09:45,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-08 15:09:45,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:45,100 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:09:45,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-12-08 15:09:45,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 15:09:45,129 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:34 [2018-12-08 15:09:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:09:45,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:09:45,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 22 [2018-12-08 15:09:45,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:09:45,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 15:09:45,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 15:09:45,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-12-08 15:09:45,178 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 17 states. [2018-12-08 15:09:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:46,239 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-12-08 15:09:46,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 15:09:46,239 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-08 15:09:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:46,240 INFO L225 Difference]: With dead ends: 182 [2018-12-08 15:09:46,240 INFO L226 Difference]: Without dead ends: 182 [2018-12-08 15:09:46,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-12-08 15:09:46,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-08 15:09:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 92. [2018-12-08 15:09:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-08 15:09:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-12-08 15:09:46,243 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 28 [2018-12-08 15:09:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:46,243 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-12-08 15:09:46,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 15:09:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-12-08 15:09:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 15:09:46,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:46,244 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:46,244 INFO L423 AbstractCegarLoop]: === Iteration 15 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:46,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1996819904, now seen corresponding path program 1 times [2018-12-08 15:09:46,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:46,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:46,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:09:46,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:46,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 15:09:46,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:46,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:09:46,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:09:46,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:09:46,287 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 8 states. [2018-12-08 15:09:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:46,362 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-12-08 15:09:46,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 15:09:46,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-08 15:09:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:46,363 INFO L225 Difference]: With dead ends: 95 [2018-12-08 15:09:46,363 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 15:09:46,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-08 15:09:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 15:09:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-12-08 15:09:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-08 15:09:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-12-08 15:09:46,365 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 28 [2018-12-08 15:09:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:46,366 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-12-08 15:09:46,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:09:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-12-08 15:09:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 15:09:46,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:46,366 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:46,367 INFO L423 AbstractCegarLoop]: === Iteration 16 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:46,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1996828935, now seen corresponding path program 1 times [2018-12-08 15:09:46,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:46,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:46,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:09:46,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:46,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 15:09:46,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:46,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 15:09:46,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:09:46,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:09:46,379 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 3 states. [2018-12-08 15:09:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:46,383 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-12-08 15:09:46,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:09:46,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 15:09:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:46,384 INFO L225 Difference]: With dead ends: 91 [2018-12-08 15:09:46,384 INFO L226 Difference]: Without dead ends: 91 [2018-12-08 15:09:46,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:09:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-08 15:09:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-08 15:09:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 15:09:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-12-08 15:09:46,385 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 28 [2018-12-08 15:09:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:46,386 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-12-08 15:09:46,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 15:09:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-12-08 15:09:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 15:09:46,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:46,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:46,386 INFO L423 AbstractCegarLoop]: === Iteration 17 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:46,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash 885543826, now seen corresponding path program 1 times [2018-12-08 15:09:46,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 15:09:46,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:46,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 15:09:46,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:46,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:09:46,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:09:46,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:09:46,445 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2018-12-08 15:09:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:46,494 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-12-08 15:09:46,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:09:46,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-08 15:09:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:46,494 INFO L225 Difference]: With dead ends: 90 [2018-12-08 15:09:46,494 INFO L226 Difference]: Without dead ends: 42 [2018-12-08 15:09:46,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:09:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-08 15:09:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-08 15:09:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-08 15:09:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-08 15:09:46,495 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2018-12-08 15:09:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:46,496 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-08 15:09:46,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:09:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-08 15:09:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 15:09:46,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:46,496 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:46,496 INFO L423 AbstractCegarLoop]: === Iteration 18 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:46,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2049766587, now seen corresponding path program 1 times [2018-12-08 15:09:46,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:09:46,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:09:46,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 15:09:46,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:46,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:09:46,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:09:46,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:09:46,540 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 8 states. [2018-12-08 15:09:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:46,585 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-12-08 15:09:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 15:09:46,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-12-08 15:09:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:46,586 INFO L225 Difference]: With dead ends: 59 [2018-12-08 15:09:46,586 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 15:09:46,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-08 15:09:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 15:09:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-08 15:09:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 15:09:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-08 15:09:46,588 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 31 [2018-12-08 15:09:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:46,588 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-08 15:09:46,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:09:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-08 15:09:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 15:09:46,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:46,589 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:46,589 INFO L423 AbstractCegarLoop]: === Iteration 19 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:46,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash -424119594, now seen corresponding path program 1 times [2018-12-08 15:09:46,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:46,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:46,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:09:46,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:46,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:09:46,657 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-08 15:09:46,657 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [11], [14], [18], [22], [30], [36], [38], [39], [42], [44], [45], [57], [73], [75], [79], [114], [119], [121], [126], [127], [128], [130] [2018-12-08 15:09:46,658 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:09:46,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:09:46,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:09:46,706 INFO L272 AbstractInterpreter]: Visited 27 different actions 62 times. Merged at 16 different actions 29 times. Widened at 1 different actions 1 times. Performed 396 root evaluator evaluations with a maximum evaluation depth of 4. Performed 396 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 35 variables. [2018-12-08 15:09:46,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:46,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:09:46,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:46,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:09:46,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:46,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:09:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:46,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:09:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 15:09:46,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:09:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 15:09:46,775 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:09:46,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [10] total 13 [2018-12-08 15:09:46,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:46,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:09:46,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:09:46,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:09:46,775 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 4 states. [2018-12-08 15:09:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:46,796 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-12-08 15:09:46,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:09:46,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-08 15:09:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:46,797 INFO L225 Difference]: With dead ends: 70 [2018-12-08 15:09:46,797 INFO L226 Difference]: Without dead ends: 70 [2018-12-08 15:09:46,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-08 15:09:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-08 15:09:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2018-12-08 15:09:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 15:09:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-12-08 15:09:46,799 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 34 [2018-12-08 15:09:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:46,799 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-12-08 15:09:46,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:09:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-12-08 15:09:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 15:09:46,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:09:46,800 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:09:46,800 INFO L423 AbstractCegarLoop]: === Iteration 20 === [lisErr7REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr15REQUIRES_VIOLATION, lisErr5REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr0REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr1REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-08 15:09:46,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:09:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1472762273, now seen corresponding path program 2 times [2018-12-08 15:09:46,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:09:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:09:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:09:46,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:09:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:09:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 15:09:46,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:46,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:09:46,852 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:09:46,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:09:46,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:09:46,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:09:46,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:09:46,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:09:46,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 15:09:46,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:09:46,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:09:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 15:09:46,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:09:46,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-08 15:09:46,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:46,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-08 15:09:46,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:09:46,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:09:46,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2018-12-08 15:09:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 15:09:47,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:09:47,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 8] total 24 [2018-12-08 15:09:47,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:09:47,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 15:09:47,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 15:09:47,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-12-08 15:09:47,060 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 9 states. [2018-12-08 15:09:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:09:47,141 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-12-08 15:09:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 15:09:47,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-12-08 15:09:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:09:47,141 INFO L225 Difference]: With dead ends: 69 [2018-12-08 15:09:47,141 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 15:09:47,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2018-12-08 15:09:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 15:09:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 15:09:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 15:09:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 15:09:47,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-12-08 15:09:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:09:47,142 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 15:09:47,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 15:09:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 15:09:47,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 15:09:47,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 03:09:47 BoogieIcfgContainer [2018-12-08 15:09:47,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 15:09:47,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 15:09:47,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 15:09:47,147 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 15:09:47,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:09:41" (3/4) ... [2018-12-08 15:09:47,150 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 15:09:47,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 15:09:47,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lis [2018-12-08 15:09:47,154 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 15:09:47,156 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-08 15:09:47,157 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-08 15:09:47,157 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 15:09:47,189 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c492e240-1746-4e8c-9825-3779d8bcc9d4/bin-2019/utaipan/witness.graphml [2018-12-08 15:09:47,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 15:09:47,190 INFO L168 Benchmark]: Toolchain (without parser) took 6528.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -94.6 MB). Peak memory consumption was 92.5 MB. Max. memory is 11.5 GB. [2018-12-08 15:09:47,191 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:09:47,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 15:09:47,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 15:09:47,192 INFO L168 Benchmark]: Boogie Preprocessor took 17.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:09:47,192 INFO L168 Benchmark]: RCFGBuilder took 220.05 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-12-08 15:09:47,192 INFO L168 Benchmark]: TraceAbstraction took 5864.49 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.7 MB). Peak memory consumption was 101.8 MB. Max. memory is 11.5 GB. [2018-12-08 15:09:47,192 INFO L168 Benchmark]: Witness Printer took 42.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:09:47,193 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 220.05 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5864.49 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.7 MB). Peak memory consumption was 101.8 MB. Max. memory is 11.5 GB. * Witness Printer took 42.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 69 locations, 23 error locations. SAFE Result, 5.8s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 790 SDtfs, 1787 SDslu, 1779 SDs, 0 SdLazy, 1766 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 594 GetRequests, 371 SyntacticMatches, 16 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.8039417104634496 AbsIntWeakeningRatio, 1.434782608695652 AbsIntAvgWeakeningVarsNumRemoved, 3.391304347826087 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 241 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 656 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 821 ConstructedInterpolants, 75 QuantifiedInterpolants, 145852 SizeOfPredicates, 53 NumberOfNonLiveVariables, 938 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 36 InterpolantComputations, 20 PerfectInterpolantSequences, 127/179 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...