./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 15:57:09,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 15:57:09,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 15:57:09,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 15:57:09,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 15:57:09,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 15:57:09,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 15:57:09,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 15:57:09,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 15:57:09,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 15:57:09,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 15:57:09,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 15:57:09,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 15:57:09,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 15:57:09,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 15:57:09,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 15:57:09,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 15:57:09,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 15:57:09,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 15:57:09,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 15:57:09,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 15:57:09,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 15:57:09,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 15:57:09,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 15:57:09,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 15:57:09,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 15:57:09,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 15:57:09,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 15:57:09,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 15:57:09,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 15:57:09,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 15:57:09,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 15:57:09,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 15:57:09,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 15:57:09,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 15:57:09,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 15:57:09,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 15:57:09,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 15:57:09,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 15:57:09,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 15:57:09,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 15:57:09,836 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 15:57:09,864 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 15:57:09,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 15:57:09,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 15:57:09,865 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 15:57:09,865 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 15:57:09,865 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 15:57:09,865 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 15:57:09,873 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 15:57:09,874 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 15:57:09,874 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 15:57:09,874 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 15:57:09,874 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 15:57:09,874 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 15:57:09,875 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 15:57:09,875 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 15:57:09,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 15:57:09,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 15:57:09,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 15:57:09,876 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 15:57:09,876 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 15:57:09,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 15:57:09,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 15:57:09,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 15:57:09,877 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 15:57:09,877 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 15:57:09,877 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 15:57:09,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 15:57:09,877 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 15:57:09,878 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 15:57:09,878 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 15:57:09,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 15:57:09,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 15:57:09,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 15:57:09,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 15:57:09,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 15:57:09,879 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 15:57:09,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 15:57:09,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 15:57:09,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 15:57:09,879 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf [2020-12-09 15:57:10,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 15:57:10,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 15:57:10,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 15:57:10,082 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 15:57:10,083 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 15:57:10,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2020-12-09 15:57:10,126 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/data/e208d5cd2/6890e8d4acd44380b05d284b26b684af/FLAG66b0df293 [2020-12-09 15:57:10,539 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 15:57:10,539 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2020-12-09 15:57:10,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/data/e208d5cd2/6890e8d4acd44380b05d284b26b684af/FLAG66b0df293 [2020-12-09 15:57:10,561 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/data/e208d5cd2/6890e8d4acd44380b05d284b26b684af [2020-12-09 15:57:10,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 15:57:10,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 15:57:10,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 15:57:10,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 15:57:10,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 15:57:10,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b68cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10, skipping insertion in model container [2020-12-09 15:57:10,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 15:57:10,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 15:57:10,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 15:57:10,804 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 15:57:10,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 15:57:10,867 INFO L208 MainTranslator]: Completed translation [2020-12-09 15:57:10,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10 WrapperNode [2020-12-09 15:57:10,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 15:57:10,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 15:57:10,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 15:57:10,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 15:57:10,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 15:57:10,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 15:57:10,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 15:57:10,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 15:57:10,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... [2020-12-09 15:57:10,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 15:57:10,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 15:57:10,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 15:57:10,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 15:57:10,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 15:57:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 15:57:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 15:57:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 15:57:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 15:57:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2020-12-09 15:57:10,981 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2020-12-09 15:57:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 15:57:10,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 15:57:11,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 15:57:11,240 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2020-12-09 15:57:11,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:57:11 BoogieIcfgContainer [2020-12-09 15:57:11,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 15:57:11,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 15:57:11,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 15:57:11,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 15:57:11,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:57:10" (1/3) ... [2020-12-09 15:57:11,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdd230e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:57:11, skipping insertion in model container [2020-12-09 15:57:11,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:57:10" (2/3) ... [2020-12-09 15:57:11,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdd230e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:57:11, skipping insertion in model container [2020-12-09 15:57:11,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:57:11" (3/3) ... [2020-12-09 15:57:11,250 INFO L111 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca-1.i [2020-12-09 15:57:11,262 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 15:57:11,265 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-12-09 15:57:11,272 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-09 15:57:11,286 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 15:57:11,286 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 15:57:11,286 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 15:57:11,286 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 15:57:11,286 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 15:57:11,286 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 15:57:11,286 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 15:57:11,286 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 15:57:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-12-09 15:57:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 15:57:11,299 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:11,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 15:57:11,300 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash 86075, now seen corresponding path program 1 times [2020-12-09 15:57:11,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:11,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047170557] [2020-12-09 15:57:11,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:11,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047170557] [2020-12-09 15:57:11,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:57:11,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 15:57:11,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101680006] [2020-12-09 15:57:11,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 15:57:11,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:11,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 15:57:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:57:11,449 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-12-09 15:57:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:11,480 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-12-09 15:57:11,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 15:57:11,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 15:57:11,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:11,486 INFO L225 Difference]: With dead ends: 20 [2020-12-09 15:57:11,487 INFO L226 Difference]: Without dead ends: 19 [2020-12-09 15:57:11,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:57:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-09 15:57:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-12-09 15:57:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-09 15:57:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-12-09 15:57:11,510 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 3 [2020-12-09 15:57:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:11,511 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-12-09 15:57:11,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 15:57:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-12-09 15:57:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 15:57:11,511 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:11,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 15:57:11,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 15:57:11,511 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash 86076, now seen corresponding path program 1 times [2020-12-09 15:57:11,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:11,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461440876] [2020-12-09 15:57:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:11,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461440876] [2020-12-09 15:57:11,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:57:11,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 15:57:11,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475809887] [2020-12-09 15:57:11,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 15:57:11,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:11,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 15:57:11,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 15:57:11,562 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2020-12-09 15:57:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:11,605 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-12-09 15:57:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 15:57:11,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-12-09 15:57:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:11,607 INFO L225 Difference]: With dead ends: 27 [2020-12-09 15:57:11,607 INFO L226 Difference]: Without dead ends: 27 [2020-12-09 15:57:11,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 15:57:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-09 15:57:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2020-12-09 15:57:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-09 15:57:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-12-09 15:57:11,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 3 [2020-12-09 15:57:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:11,613 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-12-09 15:57:11,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 15:57:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-12-09 15:57:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 15:57:11,614 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:11,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 15:57:11,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 15:57:11,614 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:11,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:11,615 INFO L82 PathProgramCache]: Analyzing trace with hash 87263, now seen corresponding path program 1 times [2020-12-09 15:57:11,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:11,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478501090] [2020-12-09 15:57:11,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:11,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478501090] [2020-12-09 15:57:11,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:57:11,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 15:57:11,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295357698] [2020-12-09 15:57:11,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 15:57:11,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:11,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 15:57:11,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:57:11,660 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2020-12-09 15:57:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:11,672 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-12-09 15:57:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 15:57:11,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 15:57:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:11,674 INFO L225 Difference]: With dead ends: 20 [2020-12-09 15:57:11,674 INFO L226 Difference]: Without dead ends: 20 [2020-12-09 15:57:11,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:57:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-09 15:57:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-09 15:57:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-09 15:57:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-12-09 15:57:11,678 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 3 [2020-12-09 15:57:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:11,678 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-12-09 15:57:11,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 15:57:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-12-09 15:57:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 15:57:11,679 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:11,679 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2020-12-09 15:57:11,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 15:57:11,679 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash 82751296, now seen corresponding path program 1 times [2020-12-09 15:57:11,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:11,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841804472] [2020-12-09 15:57:11,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:11,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841804472] [2020-12-09 15:57:11,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262313921] [2020-12-09 15:57:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:11,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 15:57:11,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:11,804 INFO L382 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 [2020-12-09 15:57:11,805 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 15:57:11,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 15:57:11,810 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 15:57:11,810 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-12-09 15:57:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:11,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:11,879 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 15:57:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:11,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [509183593] [2020-12-09 15:57:11,927 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2020-12-09 15:57:11,927 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:11,932 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 15:57:11,937 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 15:57:11,937 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 15:57:12,338 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 15:57:12,581 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2020-12-09 15:57:12,652 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 15:57:12,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:12,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2020-12-09 15:57:12,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060149390] [2020-12-09 15:57:12,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 15:57:12,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 15:57:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 15:57:12,654 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 9 states. [2020-12-09 15:57:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:12,758 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-12-09 15:57:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 15:57:12,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2020-12-09 15:57:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:12,760 INFO L225 Difference]: With dead ends: 30 [2020-12-09 15:57:12,760 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 15:57:12,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-12-09 15:57:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 15:57:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2020-12-09 15:57:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 15:57:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-12-09 15:57:12,764 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 5 [2020-12-09 15:57:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:12,764 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-12-09 15:57:12,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 15:57:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-12-09 15:57:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 15:57:12,765 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:12,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 15:57:12,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2020-12-09 15:57:12,966 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:12,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1695328524, now seen corresponding path program 1 times [2020-12-09 15:57:12,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:12,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305102667] [2020-12-09 15:57:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:13,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305102667] [2020-12-09 15:57:13,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:57:13,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 15:57:13,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295529251] [2020-12-09 15:57:13,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 15:57:13,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:13,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 15:57:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 15:57:13,066 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2020-12-09 15:57:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:13,145 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-12-09 15:57:13,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 15:57:13,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-09 15:57:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:13,146 INFO L225 Difference]: With dead ends: 16 [2020-12-09 15:57:13,146 INFO L226 Difference]: Without dead ends: 16 [2020-12-09 15:57:13,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 15:57:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-12-09 15:57:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-12-09 15:57:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-12-09 15:57:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-12-09 15:57:13,149 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 6 [2020-12-09 15:57:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:13,149 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-12-09 15:57:13,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 15:57:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-12-09 15:57:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 15:57:13,150 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:13,150 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 15:57:13,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-09 15:57:13,150 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:13,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1695328523, now seen corresponding path program 1 times [2020-12-09 15:57:13,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:13,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200207736] [2020-12-09 15:57:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:13,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200207736] [2020-12-09 15:57:13,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:57:13,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 15:57:13,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888363398] [2020-12-09 15:57:13,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 15:57:13,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 15:57:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 15:57:13,208 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2020-12-09 15:57:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:13,266 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-12-09 15:57:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 15:57:13,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-12-09 15:57:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:13,267 INFO L225 Difference]: With dead ends: 23 [2020-12-09 15:57:13,267 INFO L226 Difference]: Without dead ends: 23 [2020-12-09 15:57:13,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 15:57:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-12-09 15:57:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-12-09 15:57:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-12-09 15:57:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-12-09 15:57:13,270 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2020-12-09 15:57:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:13,270 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-12-09 15:57:13,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 15:57:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-12-09 15:57:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 15:57:13,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:13,270 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 15:57:13,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-09 15:57:13,271 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1295192612, now seen corresponding path program 1 times [2020-12-09 15:57:13,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:13,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313959322] [2020-12-09 15:57:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:13,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313959322] [2020-12-09 15:57:13,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:57:13,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 15:57:13,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503890857] [2020-12-09 15:57:13,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 15:57:13,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:13,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 15:57:13,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-09 15:57:13,334 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 8 states. [2020-12-09 15:57:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:13,405 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-12-09 15:57:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 15:57:13,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-12-09 15:57:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:13,406 INFO L225 Difference]: With dead ends: 35 [2020-12-09 15:57:13,406 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 15:57:13,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 15:57:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 15:57:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-12-09 15:57:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-12-09 15:57:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-12-09 15:57:13,410 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 10 [2020-12-09 15:57:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:13,410 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-12-09 15:57:13,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 15:57:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-12-09 15:57:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 15:57:13,411 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:13,411 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 15:57:13,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-09 15:57:13,411 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash -395615656, now seen corresponding path program 1 times [2020-12-09 15:57:13,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:13,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572576591] [2020-12-09 15:57:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:13,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572576591] [2020-12-09 15:57:13,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827521817] [2020-12-09 15:57:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:13,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 15:57:13,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:13,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:13,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:13,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1033394410] [2020-12-09 15:57:13,733 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:13,733 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:13,734 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:13,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:13,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2020-12-09 15:57:13,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587654714] [2020-12-09 15:57:13,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 15:57:13,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:13,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 15:57:13,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2020-12-09 15:57:13,737 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 22 states. [2020-12-09 15:57:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:13,897 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-12-09 15:57:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 15:57:13,897 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 12 [2020-12-09 15:57:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:13,898 INFO L225 Difference]: With dead ends: 42 [2020-12-09 15:57:13,898 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 15:57:13,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2020-12-09 15:57:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 15:57:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2020-12-09 15:57:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 15:57:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-12-09 15:57:13,902 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 12 [2020-12-09 15:57:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:13,902 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-12-09 15:57:13,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 15:57:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-12-09 15:57:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 15:57:13,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:13,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 15:57:14,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-12-09 15:57:14,105 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1497266885, now seen corresponding path program 1 times [2020-12-09 15:57:14,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:14,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406056515] [2020-12-09 15:57:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:14,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406056515] [2020-12-09 15:57:14,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:57:14,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 15:57:14,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224842833] [2020-12-09 15:57:14,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 15:57:14,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:14,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 15:57:14,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 15:57:14,233 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 4 states. [2020-12-09 15:57:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:14,261 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-12-09 15:57:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 15:57:14,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 15:57:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:14,262 INFO L225 Difference]: With dead ends: 37 [2020-12-09 15:57:14,262 INFO L226 Difference]: Without dead ends: 19 [2020-12-09 15:57:14,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 15:57:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-09 15:57:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-12-09 15:57:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 15:57:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-12-09 15:57:14,264 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2020-12-09 15:57:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:14,264 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-12-09 15:57:14,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 15:57:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-12-09 15:57:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 15:57:14,265 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:14,265 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 15:57:14,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-09 15:57:14,265 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 616206271, now seen corresponding path program 2 times [2020-12-09 15:57:14,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:14,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789840973] [2020-12-09 15:57:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:14,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789840973] [2020-12-09 15:57:14,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453117672] [2020-12-09 15:57:14,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:14,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 15:57:14,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 15:57:14,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 15:57:14,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:14,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:14,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452152528] [2020-12-09 15:57:14,849 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:14,849 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:14,849 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:14,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:14,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2020-12-09 15:57:14,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142362424] [2020-12-09 15:57:14,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-09 15:57:14,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:14,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-09 15:57:14,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2020-12-09 15:57:14,852 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 29 states. [2020-12-09 15:57:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:15,046 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-12-09 15:57:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 15:57:15,046 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 16 [2020-12-09 15:57:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:15,047 INFO L225 Difference]: With dead ends: 29 [2020-12-09 15:57:15,047 INFO L226 Difference]: Without dead ends: 20 [2020-12-09 15:57:15,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 15:57:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-09 15:57:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-12-09 15:57:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-09 15:57:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-12-09 15:57:15,049 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2020-12-09 15:57:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:15,049 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-12-09 15:57:15,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-09 15:57:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-12-09 15:57:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 15:57:15,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:15,049 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 15:57:15,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:15,251 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 506902331, now seen corresponding path program 3 times [2020-12-09 15:57:15,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:15,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301767919] [2020-12-09 15:57:15,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:15,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301767919] [2020-12-09 15:57:15,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945777627] [2020-12-09 15:57:15,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:15,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 15:57:15,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 15:57:15,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 15:57:15,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:15,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:15,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1875419841] [2020-12-09 15:57:15,747 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:15,747 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:15,747 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:15,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:15,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2020-12-09 15:57:15,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914107188] [2020-12-09 15:57:15,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-12-09 15:57:15,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:15,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-12-09 15:57:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2020-12-09 15:57:15,749 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 31 states. [2020-12-09 15:57:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:15,919 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-12-09 15:57:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 15:57:15,919 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 18 [2020-12-09 15:57:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:15,920 INFO L225 Difference]: With dead ends: 25 [2020-12-09 15:57:15,920 INFO L226 Difference]: Without dead ends: 25 [2020-12-09 15:57:15,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 15:57:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-09 15:57:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-12-09 15:57:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-12-09 15:57:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-12-09 15:57:15,923 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2020-12-09 15:57:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:15,923 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-12-09 15:57:15,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-12-09 15:57:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-12-09 15:57:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 15:57:15,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:15,924 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 15:57:16,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:16,126 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash 691714850, now seen corresponding path program 4 times [2020-12-09 15:57:16,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:16,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784924317] [2020-12-09 15:57:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:16,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784924317] [2020-12-09 15:57:16,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706629936] [2020-12-09 15:57:16,291 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:16,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 38 conjunts are in the unsatisfiable core [2020-12-09 15:57:16,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:16,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:16,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [650926799] [2020-12-09 15:57:16,884 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:16,884 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:16,884 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:16,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:16,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 35 [2020-12-09 15:57:16,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202332251] [2020-12-09 15:57:16,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-12-09 15:57:16,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-12-09 15:57:16,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 15:57:16,886 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 36 states. [2020-12-09 15:57:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:17,173 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-12-09 15:57:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 15:57:17,173 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 22 [2020-12-09 15:57:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:17,174 INFO L225 Difference]: With dead ends: 39 [2020-12-09 15:57:17,174 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 15:57:17,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1712, Unknown=0, NotChecked=0, Total=1892 [2020-12-09 15:57:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 15:57:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-12-09 15:57:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-09 15:57:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-12-09 15:57:17,176 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2020-12-09 15:57:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:17,176 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-12-09 15:57:17,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-12-09 15:57:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-12-09 15:57:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 15:57:17,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:17,177 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-12-09 15:57:17,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-12-09 15:57:17,378 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -935176802, now seen corresponding path program 5 times [2020-12-09 15:57:17,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:17,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389328351] [2020-12-09 15:57:17,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:17,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389328351] [2020-12-09 15:57:17,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248865703] [2020-12-09 15:57:17,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:17,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-12-09 15:57:17,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 15:57:17,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-09 15:57:17,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:17,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:18,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [980287510] [2020-12-09 15:57:18,060 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:18,060 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:18,060 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:18,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:18,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 37 [2020-12-09 15:57:18,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232774716] [2020-12-09 15:57:18,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-12-09 15:57:18,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-12-09 15:57:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 15:57:18,062 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 39 states. [2020-12-09 15:57:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:18,297 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-12-09 15:57:18,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 15:57:18,297 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 24 [2020-12-09 15:57:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:18,298 INFO L225 Difference]: With dead ends: 31 [2020-12-09 15:57:18,298 INFO L226 Difference]: Without dead ends: 31 [2020-12-09 15:57:18,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=1652, Unknown=0, NotChecked=0, Total=1892 [2020-12-09 15:57:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-12-09 15:57:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-12-09 15:57:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 15:57:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-12-09 15:57:18,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2020-12-09 15:57:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:18,301 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-12-09 15:57:18,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-12-09 15:57:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-12-09 15:57:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 15:57:18,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:18,302 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2020-12-09 15:57:18,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:18,503 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:18,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1917161467, now seen corresponding path program 6 times [2020-12-09 15:57:18,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:18,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309936684] [2020-12-09 15:57:18,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:18,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309936684] [2020-12-09 15:57:18,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070117995] [2020-12-09 15:57:18,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:18,742 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 15:57:18,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 15:57:18,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 53 conjunts are in the unsatisfiable core [2020-12-09 15:57:18,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:19,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:20,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1347181995] [2020-12-09 15:57:20,266 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:20,266 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:20,266 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:20,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:20,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 22] total 54 [2020-12-09 15:57:20,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487453261] [2020-12-09 15:57:20,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 55 states [2020-12-09 15:57:20,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2020-12-09 15:57:20,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2704, Unknown=0, NotChecked=0, Total=2970 [2020-12-09 15:57:20,269 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 55 states. [2020-12-09 15:57:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:21,321 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-12-09 15:57:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 15:57:21,321 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2020-12-09 15:57:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:21,322 INFO L225 Difference]: With dead ends: 49 [2020-12-09 15:57:21,322 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 15:57:21,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=478, Invalid=4492, Unknown=0, NotChecked=0, Total=4970 [2020-12-09 15:57:21,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 15:57:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-12-09 15:57:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-12-09 15:57:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-12-09 15:57:21,325 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2020-12-09 15:57:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:21,325 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-12-09 15:57:21,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2020-12-09 15:57:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-12-09 15:57:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 15:57:21,326 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:21,326 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-12-09 15:57:21,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:21,527 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1431618175, now seen corresponding path program 7 times [2020-12-09 15:57:21,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:21,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424963518] [2020-12-09 15:57:21,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:21,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424963518] [2020-12-09 15:57:21,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164612056] [2020-12-09 15:57:21,722 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:21,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 48 conjunts are in the unsatisfiable core [2020-12-09 15:57:21,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:21,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:22,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1223416728] [2020-12-09 15:57:22,199 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:22,199 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:22,199 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:22,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:22,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 37 [2020-12-09 15:57:22,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227011469] [2020-12-09 15:57:22,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-12-09 15:57:22,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:22,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-12-09 15:57:22,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 15:57:22,201 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 39 states. [2020-12-09 15:57:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:22,519 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-12-09 15:57:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-09 15:57:22,519 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2020-12-09 15:57:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:22,519 INFO L225 Difference]: With dead ends: 37 [2020-12-09 15:57:22,519 INFO L226 Difference]: Without dead ends: 37 [2020-12-09 15:57:22,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=1766, Unknown=0, NotChecked=0, Total=1980 [2020-12-09 15:57:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-09 15:57:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-12-09 15:57:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 15:57:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-12-09 15:57:22,522 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2020-12-09 15:57:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:22,522 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-12-09 15:57:22,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-12-09 15:57:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-12-09 15:57:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 15:57:22,523 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:22,523 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2020-12-09 15:57:22,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-09 15:57:22,724 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:22,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1076449688, now seen corresponding path program 8 times [2020-12-09 15:57:22,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:22,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234728782] [2020-12-09 15:57:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:22,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234728782] [2020-12-09 15:57:22,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167205298] [2020-12-09 15:57:22,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:23,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-09 15:57:23,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 15:57:23,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 57 conjunts are in the unsatisfiable core [2020-12-09 15:57:23,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:23,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:23,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1695992944] [2020-12-09 15:57:23,484 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:23,484 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:23,484 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:23,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:23,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 35 [2020-12-09 15:57:23,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334546271] [2020-12-09 15:57:23,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-12-09 15:57:23,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:23,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-12-09 15:57:23,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 15:57:23,486 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 36 states. [2020-12-09 15:57:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:23,896 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-12-09 15:57:23,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-09 15:57:23,896 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 34 [2020-12-09 15:57:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:23,896 INFO L225 Difference]: With dead ends: 59 [2020-12-09 15:57:23,897 INFO L226 Difference]: Without dead ends: 38 [2020-12-09 15:57:23,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=2079, Unknown=0, NotChecked=0, Total=2256 [2020-12-09 15:57:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-09 15:57:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-12-09 15:57:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 15:57:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-12-09 15:57:23,899 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2020-12-09 15:57:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:23,899 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-12-09 15:57:23,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-12-09 15:57:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-12-09 15:57:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 15:57:23,900 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:23,900 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2020-12-09 15:57:24,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:24,102 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:24,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1706979044, now seen corresponding path program 9 times [2020-12-09 15:57:24,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:24,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975420640] [2020-12-09 15:57:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:24,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975420640] [2020-12-09 15:57:24,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590518654] [2020-12-09 15:57:24,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:24,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 15:57:24,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 15:57:24,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2020-12-09 15:57:24,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:24,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:25,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1923356063] [2020-12-09 15:57:25,339 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:25,339 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:25,340 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:25,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:25,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2020-12-09 15:57:25,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612007691] [2020-12-09 15:57:25,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 58 states [2020-12-09 15:57:25,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:25,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2020-12-09 15:57:25,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3008, Unknown=0, NotChecked=0, Total=3306 [2020-12-09 15:57:25,341 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 58 states. [2020-12-09 15:57:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:25,816 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-12-09 15:57:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 15:57:25,817 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 36 [2020-12-09 15:57:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:25,817 INFO L225 Difference]: With dead ends: 43 [2020-12-09 15:57:25,817 INFO L226 Difference]: Without dead ends: 43 [2020-12-09 15:57:25,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=397, Invalid=3763, Unknown=0, NotChecked=0, Total=4160 [2020-12-09 15:57:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-09 15:57:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-12-09 15:57:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 15:57:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2020-12-09 15:57:25,820 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2020-12-09 15:57:25,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:25,820 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2020-12-09 15:57:25,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2020-12-09 15:57:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-12-09 15:57:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-09 15:57:25,821 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:25,821 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2020-12-09 15:57:26,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-09 15:57:26,023 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:26,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1901885003, now seen corresponding path program 10 times [2020-12-09 15:57:26,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:26,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989305372] [2020-12-09 15:57:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 17 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:26,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989305372] [2020-12-09 15:57:26,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322094145] [2020-12-09 15:57:26,357 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:26,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 67 conjunts are in the unsatisfiable core [2020-12-09 15:57:26,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 17 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:26,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 17 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:26,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1813425526] [2020-12-09 15:57:26,962 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:26,962 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:26,962 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:26,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:26,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 39 [2020-12-09 15:57:26,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863739226] [2020-12-09 15:57:26,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-12-09 15:57:26,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:26,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-12-09 15:57:26,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 15:57:26,963 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 40 states. [2020-12-09 15:57:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:27,481 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-12-09 15:57:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-09 15:57:27,482 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2020-12-09 15:57:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:27,482 INFO L225 Difference]: With dead ends: 69 [2020-12-09 15:57:27,482 INFO L226 Difference]: Without dead ends: 44 [2020-12-09 15:57:27,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=2667, Unknown=0, NotChecked=0, Total=2862 [2020-12-09 15:57:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-12-09 15:57:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-12-09 15:57:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-09 15:57:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-12-09 15:57:27,486 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2020-12-09 15:57:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:27,486 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-12-09 15:57:27,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-12-09 15:57:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-12-09 15:57:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-09 15:57:27,487 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:27,487 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2020-12-09 15:57:27,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-09 15:57:27,688 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:27,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash 435743175, now seen corresponding path program 11 times [2020-12-09 15:57:27,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:27,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823049134] [2020-12-09 15:57:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:27,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823049134] [2020-12-09 15:57:27,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973347909] [2020-12-09 15:57:27,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:28,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-12-09 15:57:28,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 15:57:28,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 58 conjunts are in the unsatisfiable core [2020-12-09 15:57:28,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 25 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:28,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:29,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [592999082] [2020-12-09 15:57:29,308 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:29,308 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:29,309 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:29,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:29,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2020-12-09 15:57:29,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036982906] [2020-12-09 15:57:29,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 68 states [2020-12-09 15:57:29,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:29,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2020-12-09 15:57:29,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=4106, Unknown=0, NotChecked=0, Total=4556 [2020-12-09 15:57:29,311 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 68 states. [2020-12-09 15:57:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:29,983 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-12-09 15:57:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 15:57:29,984 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 42 [2020-12-09 15:57:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:29,984 INFO L225 Difference]: With dead ends: 49 [2020-12-09 15:57:29,984 INFO L226 Difference]: Without dead ends: 49 [2020-12-09 15:57:29,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1695 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=689, Invalid=5953, Unknown=0, NotChecked=0, Total=6642 [2020-12-09 15:57:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-12-09 15:57:29,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-12-09 15:57:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 15:57:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-12-09 15:57:29,988 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2020-12-09 15:57:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:29,988 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-12-09 15:57:29,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2020-12-09 15:57:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-12-09 15:57:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-09 15:57:29,989 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:29,989 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1] [2020-12-09 15:57:30,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-12-09 15:57:30,190 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:30,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:30,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1011402670, now seen corresponding path program 12 times [2020-12-09 15:57:30,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:30,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269307419] [2020-12-09 15:57:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:30,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269307419] [2020-12-09 15:57:30,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068578871] [2020-12-09 15:57:30,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:30,598 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 15:57:30,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 15:57:30,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 75 conjunts are in the unsatisfiable core [2020-12-09 15:57:30,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:30,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:31,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [772482656] [2020-12-09 15:57:31,261 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:31,261 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:31,261 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:31,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:31,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 43 [2020-12-09 15:57:31,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171648255] [2020-12-09 15:57:31,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-12-09 15:57:31,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:31,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-12-09 15:57:31,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2020-12-09 15:57:31,263 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 44 states. [2020-12-09 15:57:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:32,090 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-12-09 15:57:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-12-09 15:57:32,091 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 46 [2020-12-09 15:57:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:32,091 INFO L225 Difference]: With dead ends: 79 [2020-12-09 15:57:32,091 INFO L226 Difference]: Without dead ends: 50 [2020-12-09 15:57:32,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=213, Invalid=3327, Unknown=0, NotChecked=0, Total=3540 [2020-12-09 15:57:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-09 15:57:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2020-12-09 15:57:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 15:57:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-12-09 15:57:32,094 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2020-12-09 15:57:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:32,094 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-12-09 15:57:32,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-12-09 15:57:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-12-09 15:57:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-09 15:57:32,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:32,094 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2020-12-09 15:57:32,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-12-09 15:57:32,295 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:32,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:32,296 INFO L82 PathProgramCache]: Analyzing trace with hash 201829930, now seen corresponding path program 13 times [2020-12-09 15:57:32,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:32,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397900408] [2020-12-09 15:57:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 25 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:32,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397900408] [2020-12-09 15:57:32,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820101910] [2020-12-09 15:57:32,648 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:32,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 75 conjunts are in the unsatisfiable core [2020-12-09 15:57:32,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:32,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:33,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [166525837] [2020-12-09 15:57:33,493 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:33,493 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:33,494 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:33,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:33,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 55 [2020-12-09 15:57:33,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719980784] [2020-12-09 15:57:33,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 57 states [2020-12-09 15:57:33,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2020-12-09 15:57:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2920, Unknown=0, NotChecked=0, Total=3192 [2020-12-09 15:57:33,495 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 57 states. [2020-12-09 15:57:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:33,985 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-12-09 15:57:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 15:57:33,985 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 48 [2020-12-09 15:57:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:33,986 INFO L225 Difference]: With dead ends: 55 [2020-12-09 15:57:33,986 INFO L226 Difference]: Without dead ends: 55 [2020-12-09 15:57:33,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=400, Invalid=3890, Unknown=0, NotChecked=0, Total=4290 [2020-12-09 15:57:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-09 15:57:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-12-09 15:57:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 15:57:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-12-09 15:57:33,989 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 48 [2020-12-09 15:57:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:33,989 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-12-09 15:57:33,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2020-12-09 15:57:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-12-09 15:57:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-09 15:57:33,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:57:33,990 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2020-12-09 15:57:34,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:34,191 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-12-09 15:57:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:57:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1187553937, now seen corresponding path program 14 times [2020-12-09 15:57:34,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:57:34,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784478853] [2020-12-09 15:57:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:57:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:57:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 23 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:57:34,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784478853] [2020-12-09 15:57:34,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242546881] [2020-12-09 15:57:34,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:34,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2020-12-09 15:57:34,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 15:57:34,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 54 conjunts are in the unsatisfiable core [2020-12-09 15:57:34,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:57:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-12-09 15:57:35,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:57:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-12-09 15:57:35,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [481539075] [2020-12-09 15:57:35,554 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 15:57:35,555 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:57:35,555 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 15:57:35,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 15:57:35,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 8, 8] total 45 [2020-12-09 15:57:35,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558240547] [2020-12-09 15:57:35,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-12-09 15:57:35,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:57:35,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-12-09 15:57:35,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1966, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 15:57:35,556 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 46 states. [2020-12-09 15:57:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:57:38,279 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2020-12-09 15:57:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-12-09 15:57:38,279 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2020-12-09 15:57:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:57:38,279 INFO L225 Difference]: With dead ends: 88 [2020-12-09 15:57:38,279 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 15:57:38,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=787, Invalid=8333, Unknown=0, NotChecked=0, Total=9120 [2020-12-09 15:57:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 15:57:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 15:57:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 15:57:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 15:57:38,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2020-12-09 15:57:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:57:38,280 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 15:57:38,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-12-09 15:57:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 15:57:38,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 15:57:38,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 15:57:38,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:57:38 BoogieIcfgContainer [2020-12-09 15:57:38,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 15:57:38,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 15:57:38,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 15:57:38,493 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 15:57:38,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:57:11" (3/4) ... [2020-12-09 15:57:38,497 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 15:57:38,500 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure strlen_rec [2020-12-09 15:57:38,503 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2020-12-09 15:57:38,503 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-12-09 15:57:38,503 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 15:57:38,529 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8bffdd04-489d-403e-be28-c03d07ed736c/bin/utaipan/witness.graphml [2020-12-09 15:57:38,529 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 15:57:38,530 INFO L168 Benchmark]: Toolchain (without parser) took 27961.51 ms. Allocated memory was 111.1 MB in the beginning and 195.0 MB in the end (delta: 83.9 MB). Free memory was 91.4 MB in the beginning and 165.9 MB in the end (delta: -74.5 MB). Peak memory consumption was 117.3 MB. Max. memory is 16.1 GB. [2020-12-09 15:57:38,530 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 71.3 MB. Free memory is still 43.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 15:57:38,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.05 ms. Allocated memory is still 111.1 MB. Free memory was 91.4 MB in the beginning and 74.0 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 15:57:38,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.63 ms. Allocated memory is still 111.1 MB. Free memory was 74.0 MB in the beginning and 72.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 15:57:38,530 INFO L168 Benchmark]: Boogie Preprocessor took 17.49 ms. Allocated memory is still 111.1 MB. Free memory was 72.5 MB in the beginning and 71.1 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 15:57:38,531 INFO L168 Benchmark]: RCFGBuilder took 327.67 ms. Allocated memory is still 111.1 MB. Free memory was 71.1 MB in the beginning and 50.9 MB in the end (delta: 20.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-09 15:57:38,531 INFO L168 Benchmark]: TraceAbstraction took 27247.31 ms. Allocated memory was 111.1 MB in the beginning and 195.0 MB in the end (delta: 83.9 MB). Free memory was 50.7 MB in the beginning and 59.2 MB in the end (delta: -8.5 MB). Peak memory consumption was 77.3 MB. Max. memory is 16.1 GB. [2020-12-09 15:57:38,531 INFO L168 Benchmark]: Witness Printer took 36.92 ms. Allocated memory is still 195.0 MB. Free memory was 59.2 MB in the beginning and 165.9 MB in the end (delta: -106.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 15:57:38,533 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 71.3 MB. Free memory is still 43.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 299.05 ms. Allocated memory is still 111.1 MB. Free memory was 91.4 MB in the beginning and 74.0 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 27.63 ms. Allocated memory is still 111.1 MB. Free memory was 74.0 MB in the beginning and 72.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 17.49 ms. Allocated memory is still 111.1 MB. Free memory was 72.5 MB in the beginning and 71.1 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 327.67 ms. Allocated memory is still 111.1 MB. Free memory was 71.1 MB in the beginning and 50.9 MB in the end (delta: 20.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 27247.31 ms. Allocated memory was 111.1 MB in the beginning and 195.0 MB in the end (delta: 83.9 MB). Free memory was 50.7 MB in the beginning and 59.2 MB in the end (delta: -8.5 MB). Peak memory consumption was 77.3 MB. Max. memory is 16.1 GB. * Witness Printer took 36.92 ms. Allocated memory is still 195.0 MB. Free memory was 59.2 MB in the beginning and 165.9 MB in the end (delta: -106.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 515]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 515]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.1s, OverallIterations: 22, TraceHistogramMax: 9, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 292 SDtfs, 925 SDslu, 1578 SDs, 0 SdLazy, 9468 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1341 GetRequests, 529 SyntacticMatches, 30 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 14 DeprecatedPredicates, 8938 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 47 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 948 NumberOfCodeBlocks, 948 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1349 ConstructedInterpolants, 73 QuantifiedInterpolants, 497206 SizeOfPredicates, 234 NumberOfNonLiveVariables, 2258 ConjunctsInSsa, 710 ConjunctsInUnsatCore, 52 InterpolantComputations, 7 PerfectInterpolantSequences, 826/2906 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...