./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 483e7d170ed0643447e075c470cba29c0e69d3cf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:14:11,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:14:11,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:14:11,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:14:11,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:14:11,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:14:11,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:14:11,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:14:11,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:14:11,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:14:11,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:14:11,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:14:11,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:14:11,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:14:11,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:14:11,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:14:11,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:14:11,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:14:11,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:14:11,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:14:11,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:14:11,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:14:11,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:14:11,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:14:11,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:14:11,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:14:11,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:14:11,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:14:11,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:14:11,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:14:11,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:14:11,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:14:11,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:14:11,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:14:11,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:14:11,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:14:11,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:14:11,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:14:11,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:14:11,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:14:11,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:14:11,890 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 06:14:11,913 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:14:11,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:14:11,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:14:11,914 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:14:11,914 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:14:11,914 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:14:11,914 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 06:14:11,915 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:14:11,915 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:14:11,915 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 06:14:11,915 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 06:14:11,915 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:14:11,916 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 06:14:11,916 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 06:14:11,916 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 06:14:11,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:14:11,917 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:14:11,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:14:11,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:14:11,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:14:11,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 06:14:11,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:14:11,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 06:14:11,918 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:14:11,918 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:14:11,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 06:14:11,919 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:14:11,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 06:14:11,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:14:11,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:14:11,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:14:11,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:14:11,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:14:11,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 06:14:11,920 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 06:14:11,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 06:14:11,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 06:14:11,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:14:11,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:14:11,921 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_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 ! call(reach_error())) ) 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 -> 483e7d170ed0643447e075c470cba29c0e69d3cf [2020-12-09 06:14:12,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:14:12,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:14:12,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:14:12,107 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:14:12,107 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:14:12,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_10-2.c [2020-12-09 06:14:12,149 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/data/4a6f6989d/0c8bf03a048f46cda08a7a44690fa7cd/FLAG6fd25ae5b [2020-12-09 06:14:12,490 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:14:12,490 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/sv-benchmarks/c/recursive-simple/fibo_10-2.c [2020-12-09 06:14:12,494 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/data/4a6f6989d/0c8bf03a048f46cda08a7a44690fa7cd/FLAG6fd25ae5b [2020-12-09 06:14:12,504 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/data/4a6f6989d/0c8bf03a048f46cda08a7a44690fa7cd [2020-12-09 06:14:12,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:14:12,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:14:12,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:14:12,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:14:12,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:14:12,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cffac1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12, skipping insertion in model container [2020-12-09 06:14:12,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:14:12,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:14:12,626 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/sv-benchmarks/c/recursive-simple/fibo_10-2.c[743,756] [2020-12-09 06:14:12,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:14:12,636 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 06:14:12,645 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/sv-benchmarks/c/recursive-simple/fibo_10-2.c[743,756] [2020-12-09 06:14:12,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:14:12,656 INFO L208 MainTranslator]: Completed translation [2020-12-09 06:14:12,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12 WrapperNode [2020-12-09 06:14:12,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:14:12,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 06:14:12,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 06:14:12,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 06:14:12,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 06:14:12,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 06:14:12,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 06:14:12,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 06:14:12,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... [2020-12-09 06:14:12,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 06:14:12,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 06:14:12,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 06:14:12,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 06:14:12,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 06:14:12,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 06:14:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 06:14:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 06:14:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-12-09 06:14:12,759 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-12-09 06:14:12,903 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 06:14:12,904 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 06:14:12,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:14:12 BoogieIcfgContainer [2020-12-09 06:14:12,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 06:14:12,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 06:14:12,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 06:14:12,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 06:14:12,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:14:12" (1/3) ... [2020-12-09 06:14:12,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159b26ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:14:12, skipping insertion in model container [2020-12-09 06:14:12,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:14:12" (2/3) ... [2020-12-09 06:14:12,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159b26ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:14:12, skipping insertion in model container [2020-12-09 06:14:12,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:14:12" (3/3) ... [2020-12-09 06:14:12,911 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-2.c [2020-12-09 06:14:12,920 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 06:14:12,922 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 06:14:12,930 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 06:14:12,946 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 06:14:12,946 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 06:14:12,946 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 06:14:12,946 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 06:14:12,946 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 06:14:12,946 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 06:14:12,946 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 06:14:12,947 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 06:14:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-12-09 06:14:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:14:12,960 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:12,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:12,961 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -798924922, now seen corresponding path program 1 times [2020-12-09 06:14:12,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:12,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177119014] [2020-12-09 06:14:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:13,096 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 06:14:13,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177119014] [2020-12-09 06:14:13,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:14:13,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:14:13,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406736822] [2020-12-09 06:14:13,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:14:13,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:13,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:14:13,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:14:13,112 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2020-12-09 06:14:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:13,170 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-12-09 06:14:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:14:13,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 06:14:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:13,177 INFO L225 Difference]: With dead ends: 25 [2020-12-09 06:14:13,178 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 06:14:13,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:14:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 06:14:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-09 06:14:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 06:14:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-12-09 06:14:13,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2020-12-09 06:14:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:13,207 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-12-09 06:14:13,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:14:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-12-09 06:14:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 06:14:13,209 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:13,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:13,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 06:14:13,209 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:13,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1717873930, now seen corresponding path program 1 times [2020-12-09 06:14:13,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:13,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186259369] [2020-12-09 06:14:13,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:13,247 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 06:14:13,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186259369] [2020-12-09 06:14:13,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:14:13,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:14:13,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955106469] [2020-12-09 06:14:13,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:14:13,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:13,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:14:13,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:14:13,251 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2020-12-09 06:14:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:13,282 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-12-09 06:14:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:14:13,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 06:14:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:13,284 INFO L225 Difference]: With dead ends: 23 [2020-12-09 06:14:13,284 INFO L226 Difference]: Without dead ends: 19 [2020-12-09 06:14:13,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:14:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-09 06:14:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-12-09 06:14:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 06:14:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-12-09 06:14:13,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2020-12-09 06:14:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:13,290 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-12-09 06:14:13,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:14:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-12-09 06:14:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 06:14:13,291 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:13,291 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:13,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 06:14:13,291 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash 913644549, now seen corresponding path program 1 times [2020-12-09 06:14:13,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:13,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912059637] [2020-12-09 06:14:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 06:14:13,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912059637] [2020-12-09 06:14:13,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644309523] [2020-12-09 06:14:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:13,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:14:13,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 06:14:13,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 06:14:13,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1442538440] [2020-12-09 06:14:13,631 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:13,631 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:13,635 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 06:14:13,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:13,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2020-12-09 06:14:13,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747778741] [2020-12-09 06:14:13,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 06:14:13,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 06:14:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-09 06:14:13,637 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 11 states. [2020-12-09 06:14:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:13,710 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2020-12-09 06:14:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 06:14:13,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-12-09 06:14:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:13,712 INFO L225 Difference]: With dead ends: 34 [2020-12-09 06:14:13,712 INFO L226 Difference]: Without dead ends: 19 [2020-12-09 06:14:13,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-12-09 06:14:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-09 06:14:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-12-09 06:14:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-09 06:14:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-12-09 06:14:13,716 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2020-12-09 06:14:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:13,716 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-12-09 06:14:13,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 06:14:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-12-09 06:14:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 06:14:13,718 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:13,718 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:13,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-09 06:14:13,920 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:13,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:13,922 INFO L82 PathProgramCache]: Analyzing trace with hash -252103063, now seen corresponding path program 1 times [2020-12-09 06:14:13,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:13,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400661976] [2020-12-09 06:14:13,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 06:14:14,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400661976] [2020-12-09 06:14:14,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764406052] [2020-12-09 06:14:14,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:14,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:14:14,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 06:14:14,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 06:14:14,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [345300009] [2020-12-09 06:14:14,431 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:14,431 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:14,431 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 06:14:14,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:14,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2020-12-09 06:14:14,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265985263] [2020-12-09 06:14:14,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 06:14:14,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:14,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 06:14:14,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-09 06:14:14,433 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2020-12-09 06:14:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:14,485 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2020-12-09 06:14:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:14:14,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-09 06:14:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:14,487 INFO L225 Difference]: With dead ends: 28 [2020-12-09 06:14:14,487 INFO L226 Difference]: Without dead ends: 24 [2020-12-09 06:14:14,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-12-09 06:14:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-09 06:14:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-12-09 06:14:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-09 06:14:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-12-09 06:14:14,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2020-12-09 06:14:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:14,495 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-12-09 06:14:14,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 06:14:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2020-12-09 06:14:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 06:14:14,497 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:14,497 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:14,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 06:14:14,699 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:14,701 INFO L82 PathProgramCache]: Analyzing trace with hash 659330, now seen corresponding path program 2 times [2020-12-09 06:14:14,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:14,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413073419] [2020-12-09 06:14:14,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-09 06:14:14,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413073419] [2020-12-09 06:14:14,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352064026] [2020-12-09 06:14:14,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:14,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 06:14:14,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 06:14:14,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 06:14:14,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-09 06:14:14,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 06:14:15,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [86140519] [2020-12-09 06:14:15,107 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:15,107 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:15,107 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 06:14:15,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:15,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2020-12-09 06:14:15,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69555759] [2020-12-09 06:14:15,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 06:14:15,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:15,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 06:14:15,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-12-09 06:14:15,109 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 14 states. [2020-12-09 06:14:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:15,270 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2020-12-09 06:14:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 06:14:15,270 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-12-09 06:14:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:15,271 INFO L225 Difference]: With dead ends: 55 [2020-12-09 06:14:15,271 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 06:14:15,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-12-09 06:14:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 06:14:15,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-12-09 06:14:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 06:14:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-12-09 06:14:15,277 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2020-12-09 06:14:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:15,278 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-12-09 06:14:15,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 06:14:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-12-09 06:14:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 06:14:15,279 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:15,279 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:15,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 06:14:15,481 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2099733774, now seen corresponding path program 3 times [2020-12-09 06:14:15,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:15,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788837865] [2020-12-09 06:14:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 06:14:15,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788837865] [2020-12-09 06:14:15,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050487570] [2020-12-09 06:14:15,562 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:15,593 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 06:14:15,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 06:14:15,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 06:14:15,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 06:14:15,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-09 06:14:15,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [626135957] [2020-12-09 06:14:15,821 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:15,821 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:15,822 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 06:14:15,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:15,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2020-12-09 06:14:15,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102642155] [2020-12-09 06:14:15,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 06:14:15,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 06:14:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-09 06:14:15,823 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 11 states. [2020-12-09 06:14:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:15,904 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-12-09 06:14:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:14:15,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-12-09 06:14:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:15,906 INFO L225 Difference]: With dead ends: 36 [2020-12-09 06:14:15,906 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 06:14:15,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-09 06:14:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 06:14:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-12-09 06:14:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 06:14:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2020-12-09 06:14:15,912 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2020-12-09 06:14:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:15,912 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-12-09 06:14:15,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 06:14:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2020-12-09 06:14:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-09 06:14:15,914 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:15,914 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:16,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 06:14:16,116 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1019643787, now seen corresponding path program 4 times [2020-12-09 06:14:16,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:16,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671827148] [2020-12-09 06:14:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-12-09 06:14:16,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671827148] [2020-12-09 06:14:16,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131633605] [2020-12-09 06:14:16,232 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:16,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 06:14:16,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-12-09 06:14:16,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 142 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2020-12-09 06:14:16,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [973751074] [2020-12-09 06:14:16,699 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:16,699 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:16,699 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 06:14:16,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:16,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2020-12-09 06:14:16,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691046647] [2020-12-09 06:14:16,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 06:14:16,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:16,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 06:14:16,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:14:16,701 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 13 states. [2020-12-09 06:14:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:16,801 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2020-12-09 06:14:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 06:14:16,802 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2020-12-09 06:14:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:16,803 INFO L225 Difference]: With dead ends: 41 [2020-12-09 06:14:16,803 INFO L226 Difference]: Without dead ends: 37 [2020-12-09 06:14:16,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-12-09 06:14:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-09 06:14:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-12-09 06:14:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 06:14:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2020-12-09 06:14:16,810 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 78 [2020-12-09 06:14:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:16,810 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2020-12-09 06:14:16,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 06:14:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2020-12-09 06:14:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-09 06:14:16,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:16,812 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:17,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-09 06:14:17,014 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1696376591, now seen corresponding path program 5 times [2020-12-09 06:14:17,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:17,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606804086] [2020-12-09 06:14:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-12-09 06:14:17,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606804086] [2020-12-09 06:14:17,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986961768] [2020-12-09 06:14:17,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:17,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-12-09 06:14:17,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 06:14:17,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 06:14:17,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2020-12-09 06:14:17,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2020-12-09 06:14:17,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1324267519] [2020-12-09 06:14:17,578 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:17,578 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:17,578 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 06:14:17,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:17,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 13 [2020-12-09 06:14:17,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432307116] [2020-12-09 06:14:17,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 06:14:17,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 06:14:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:14:17,580 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 13 states. [2020-12-09 06:14:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:17,697 INFO L93 Difference]: Finished difference Result 46 states and 78 transitions. [2020-12-09 06:14:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 06:14:17,697 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2020-12-09 06:14:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:17,698 INFO L225 Difference]: With dead ends: 46 [2020-12-09 06:14:17,699 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 06:14:17,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2020-12-09 06:14:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 06:14:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-12-09 06:14:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-09 06:14:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2020-12-09 06:14:17,706 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 105 [2020-12-09 06:14:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:17,706 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2020-12-09 06:14:17,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 06:14:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2020-12-09 06:14:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-12-09 06:14:17,709 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:17,709 INFO L422 BasicCegarLoop]: trace histogram [35, 35, 30, 17, 17, 17, 17, 17, 17, 17, 13, 5, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:17,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 06:14:17,911 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:17,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:17,912 INFO L82 PathProgramCache]: Analyzing trace with hash -860646155, now seen corresponding path program 6 times [2020-12-09 06:14:17,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:17,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500804967] [2020-12-09 06:14:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 153 proven. 813 refuted. 0 times theorem prover too weak. 2393 trivial. 0 not checked. [2020-12-09 06:14:18,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500804967] [2020-12-09 06:14:18,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129215669] [2020-12-09 06:14:18,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:18,254 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 06:14:18,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 06:14:18,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 06:14:18,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 1748 proven. 170 refuted. 0 times theorem prover too weak. 1441 trivial. 0 not checked. [2020-12-09 06:14:18,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 294 proven. 953 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2020-12-09 06:14:19,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [852460564] [2020-12-09 06:14:19,492 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:19,492 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:19,492 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 06:14:19,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:19,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 21 [2020-12-09 06:14:19,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952390955] [2020-12-09 06:14:19,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 06:14:19,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:19,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 06:14:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-12-09 06:14:19,495 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand 21 states. [2020-12-09 06:14:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:19,860 INFO L93 Difference]: Finished difference Result 105 states and 237 transitions. [2020-12-09 06:14:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 06:14:19,860 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 243 [2020-12-09 06:14:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:19,862 INFO L225 Difference]: With dead ends: 105 [2020-12-09 06:14:19,862 INFO L226 Difference]: Without dead ends: 68 [2020-12-09 06:14:19,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 478 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=427, Invalid=1133, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 06:14:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-09 06:14:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-09 06:14:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 06:14:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2020-12-09 06:14:19,872 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 243 [2020-12-09 06:14:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:19,872 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2020-12-09 06:14:19,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 06:14:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2020-12-09 06:14:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2020-12-09 06:14:19,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:19,876 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:20,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 06:14:20,078 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash 826064675, now seen corresponding path program 7 times [2020-12-09 06:14:20,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:20,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759032613] [2020-12-09 06:14:20,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1348 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2020-12-09 06:14:20,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759032613] [2020-12-09 06:14:20,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455819317] [2020-12-09 06:14:20,301 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:20,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 06:14:20,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1348 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2020-12-09 06:14:20,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1405 refuted. 0 times theorem prover too weak. 4430 trivial. 0 not checked. [2020-12-09 06:14:22,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2027750382] [2020-12-09 06:14:22,212 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:22,212 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:22,212 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 06:14:22,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:22,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2020-12-09 06:14:22,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609988746] [2020-12-09 06:14:22,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 06:14:22,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:22,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 06:14:22,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-12-09 06:14:22,214 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 19 states. [2020-12-09 06:14:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:22,378 INFO L93 Difference]: Finished difference Result 77 states and 117 transitions. [2020-12-09 06:14:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 06:14:22,379 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 323 [2020-12-09 06:14:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:22,381 INFO L225 Difference]: With dead ends: 77 [2020-12-09 06:14:22,381 INFO L226 Difference]: Without dead ends: 73 [2020-12-09 06:14:22,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-12-09 06:14:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-12-09 06:14:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-12-09 06:14:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-09 06:14:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2020-12-09 06:14:22,389 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 323 [2020-12-09 06:14:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:22,389 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2020-12-09 06:14:22,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 06:14:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2020-12-09 06:14:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2020-12-09 06:14:22,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:22,399 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:22,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 06:14:22,600 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2804755, now seen corresponding path program 8 times [2020-12-09 06:14:22,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:22,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462477702] [2020-12-09 06:14:22,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 422 proven. 2921 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2020-12-09 06:14:22,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462477702] [2020-12-09 06:14:22,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741775123] [2020-12-09 06:14:22,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:23,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2020-12-09 06:14:23,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 06:14:23,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 06:14:23,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2920 proven. 290 refuted. 0 times theorem prover too weak. 15893 trivial. 0 not checked. [2020-12-09 06:14:23,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2920 proven. 314 refuted. 0 times theorem prover too weak. 15869 trivial. 0 not checked. [2020-12-09 06:14:25,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [318753124] [2020-12-09 06:14:25,487 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:25,487 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:25,487 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 06:14:25,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:25,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2020-12-09 06:14:25,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324990270] [2020-12-09 06:14:25,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-09 06:14:25,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-09 06:14:25,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2020-12-09 06:14:25,490 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand 26 states. [2020-12-09 06:14:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:26,094 INFO L93 Difference]: Finished difference Result 191 states and 381 transitions. [2020-12-09 06:14:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-12-09 06:14:26,094 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 568 [2020-12-09 06:14:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:26,096 INFO L225 Difference]: With dead ends: 191 [2020-12-09 06:14:26,096 INFO L226 Difference]: Without dead ends: 122 [2020-12-09 06:14:26,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1185 GetRequests, 1124 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=758, Invalid=2548, Unknown=0, NotChecked=0, Total=3306 [2020-12-09 06:14:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-09 06:14:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2020-12-09 06:14:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-09 06:14:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2020-12-09 06:14:26,107 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 568 [2020-12-09 06:14:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:26,108 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2020-12-09 06:14:26,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-09 06:14:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2020-12-09 06:14:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2020-12-09 06:14:26,112 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:26,112 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:26,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 06:14:26,314 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1994288690, now seen corresponding path program 9 times [2020-12-09 06:14:26,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:26,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151818379] [2020-12-09 06:14:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-12-09 06:14:26,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151818379] [2020-12-09 06:14:26,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075134615] [2020-12-09 06:14:26,841 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:27,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 06:14:27,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 06:14:27,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 06:14:27,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-12-09 06:14:27,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4480 refuted. 0 times theorem prover too weak. 27957 trivial. 0 not checked. [2020-12-09 06:14:31,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1462321263] [2020-12-09 06:14:31,126 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:31,127 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:31,127 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 06:14:31,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:31,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 22 [2020-12-09 06:14:31,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337724916] [2020-12-09 06:14:31,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 06:14:31,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:31,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 06:14:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-12-09 06:14:31,130 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand 22 states. [2020-12-09 06:14:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:31,287 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2020-12-09 06:14:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 06:14:31,287 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 745 [2020-12-09 06:14:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:31,290 INFO L225 Difference]: With dead ends: 113 [2020-12-09 06:14:31,290 INFO L226 Difference]: Without dead ends: 109 [2020-12-09 06:14:31,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1518 GetRequests, 1487 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-12-09 06:14:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-12-09 06:14:31,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-12-09 06:14:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-12-09 06:14:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2020-12-09 06:14:31,299 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 745 [2020-12-09 06:14:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:31,300 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2020-12-09 06:14:31,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 06:14:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2020-12-09 06:14:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2020-12-09 06:14:31,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:31,315 INFO L422 BasicCegarLoop]: trace histogram [203, 203, 164, 101, 101, 101, 101, 101, 101, 101, 63, 39, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:31,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 06:14:31,517 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:31,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1125901793, now seen corresponding path program 10 times [2020-12-09 06:14:31,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:31,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784165833] [2020-12-09 06:14:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 3845 proven. 5218 refuted. 0 times theorem prover too weak. 106515 trivial. 0 not checked. [2020-12-09 06:14:32,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784165833] [2020-12-09 06:14:32,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130882436] [2020-12-09 06:14:32,909 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:33,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 3106 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 06:14:33,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 4480 proven. 6369 refuted. 0 times theorem prover too weak. 104729 trivial. 0 not checked. [2020-12-09 06:14:34,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 4482 proven. 6484 refuted. 0 times theorem prover too weak. 104612 trivial. 0 not checked. [2020-12-09 06:14:41,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [62848411] [2020-12-09 06:14:41,174 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:41,174 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:41,175 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 06:14:41,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:41,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 27 [2020-12-09 06:14:41,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145936] [2020-12-09 06:14:41,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 06:14:41,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 06:14:41,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2020-12-09 06:14:41,179 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand 27 states. [2020-12-09 06:14:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:41,399 INFO L93 Difference]: Finished difference Result 211 states and 374 transitions. [2020-12-09 06:14:41,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 06:14:41,399 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1385 [2020-12-09 06:14:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:41,403 INFO L225 Difference]: With dead ends: 211 [2020-12-09 06:14:41,403 INFO L226 Difference]: Without dead ends: 180 [2020-12-09 06:14:41,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2798 GetRequests, 2762 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 06:14:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-09 06:14:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-09 06:14:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-09 06:14:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2020-12-09 06:14:41,416 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 1385 [2020-12-09 06:14:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:41,417 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2020-12-09 06:14:41,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 06:14:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2020-12-09 06:14:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1265 [2020-12-09 06:14:41,426 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:41,427 INFO L422 BasicCegarLoop]: trace histogram [185, 185, 151, 92, 92, 92, 92, 92, 92, 92, 59, 34, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:41,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-09 06:14:41,628 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:41,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:41,630 INFO L82 PathProgramCache]: Analyzing trace with hash -358305834, now seen corresponding path program 11 times [2020-12-09 06:14:41,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:41,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249872324] [2020-12-09 06:14:41,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 96149 backedges. 1427 proven. 6708 refuted. 0 times theorem prover too weak. 88014 trivial. 0 not checked. [2020-12-09 06:14:42,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249872324] [2020-12-09 06:14:42,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679366296] [2020-12-09 06:14:42,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:43,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2020-12-09 06:14:43,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 06:14:43,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 06:14:43,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 96149 backedges. 1518 proven. 8665 refuted. 0 times theorem prover too weak. 85966 trivial. 0 not checked. [2020-12-09 06:14:44,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 96149 backedges. 1509 proven. 8791 refuted. 0 times theorem prover too weak. 85849 trivial. 0 not checked. [2020-12-09 06:14:50,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [138262988] [2020-12-09 06:14:50,931 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:14:50,931 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:14:50,931 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 06:14:50,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:14:50,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 24] total 32 [2020-12-09 06:14:50,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551850294] [2020-12-09 06:14:50,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-09 06:14:50,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:14:50,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-09 06:14:50,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2020-12-09 06:14:50,935 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 32 states. [2020-12-09 06:14:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:51,425 INFO L93 Difference]: Finished difference Result 303 states and 598 transitions. [2020-12-09 06:14:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 06:14:51,425 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1264 [2020-12-09 06:14:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:51,427 INFO L225 Difference]: With dead ends: 303 [2020-12-09 06:14:51,427 INFO L226 Difference]: Without dead ends: 143 [2020-12-09 06:14:51,431 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2551 GetRequests, 2486 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=626, Invalid=1444, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 06:14:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-09 06:14:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2020-12-09 06:14:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-09 06:14:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2020-12-09 06:14:51,441 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 1264 [2020-12-09 06:14:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:51,441 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2020-12-09 06:14:51,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-09 06:14:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2020-12-09 06:14:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2020-12-09 06:14:51,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:51,454 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:51,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-09 06:14:51,655 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:51,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:51,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1347613546, now seen corresponding path program 12 times [2020-12-09 06:14:51,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:14:51,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368555466] [2020-12-09 06:14:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:14:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 87769 backedges. 0 proven. 28921 refuted. 0 times theorem prover too weak. 58848 trivial. 0 not checked. [2020-12-09 06:14:54,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368555466] [2020-12-09 06:14:54,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707235897] [2020-12-09 06:14:54,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/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 06:14:54,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 06:14:54,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 06:14:54,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 711 conjunts are in the unsatisfiable core [2020-12-09 06:14:54,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 87769 backedges. 0 proven. 28921 refuted. 0 times theorem prover too weak. 58848 trivial. 0 not checked. [2020-12-09 06:14:56,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:15:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 87769 backedges. 0 proven. 28921 refuted. 0 times theorem prover too weak. 58848 trivial. 0 not checked. [2020-12-09 06:15:08,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1822116080] [2020-12-09 06:15:08,622 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 06:15:08,622 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:15:08,622 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 06:15:08,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 06:15:08,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 40 [2020-12-09 06:15:08,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685915243] [2020-12-09 06:15:08,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-12-09 06:15:08,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:15:08,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-12-09 06:15:08,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1465, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 06:15:08,626 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 40 states. [2020-12-09 06:15:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:15:09,016 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2020-12-09 06:15:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-09 06:15:09,017 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1208 [2020-12-09 06:15:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:15:09,018 INFO L225 Difference]: With dead ends: 119 [2020-12-09 06:15:09,018 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 06:15:09,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2771 GetRequests, 2599 SyntacticMatches, 134 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=1465, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 06:15:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 06:15:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 06:15:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 06:15:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 06:15:09,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1208 [2020-12-09 06:15:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:15:09,020 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 06:15:09,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-12-09 06:15:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 06:15:09,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 06:15:09,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-09 06:15:09,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 06:15:10,451 WARN L197 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 82 [2020-12-09 06:15:10,454 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 06:15:10,454 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 06:15:10,454 INFO L262 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2020-12-09 06:15:10,454 INFO L262 CegarLoopResult]: For program point L28(lines 28 30) no Hoare annotation was computed. [2020-12-09 06:15:10,454 INFO L258 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 10) (<= 10 ULTIMATE.start_main_~x~0)) [2020-12-09 06:15:10,454 INFO L262 CegarLoopResult]: For program point L27-1(line 27) no Hoare annotation was computed. [2020-12-09 06:15:10,454 INFO L258 CegarLoopResult]: At program point L28-2(lines 28 30) the Hoare annotation is: (<= 10 ULTIMATE.start_main_~x~0) [2020-12-09 06:15:10,454 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) no Hoare annotation was computed. [2020-12-09 06:15:10,454 INFO L262 CegarLoopResult]: For program point fiboEXIT(lines 7 15) no Hoare annotation was computed. [2020-12-09 06:15:10,455 INFO L262 CegarLoopResult]: For program point fiboFINAL(lines 7 15) no Hoare annotation was computed. [2020-12-09 06:15:10,455 INFO L258 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= fibo_~n |fibo_#in~n|) (<= 2 |fibo_#in~n|) (<= |fibo_#in~n| fibo_~n)) [2020-12-09 06:15:10,455 INFO L262 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-12-09 06:15:10,455 INFO L258 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse2 (<= 8 |fibo_#in~n|)) (.cse4 (<= 7 |fibo_#in~n|)) (.cse0 (<= |fibo_#in~n| 8)) (.cse3 (<= fibo_~n |fibo_#in~n|)) (.cse1 (<= |fibo_#in~n| fibo_~n))) (and (or (and (<= 13 |fibo_#t~ret7|) .cse0 (<= |fibo_#t~ret7| 13) .cse1) (not .cse2) (and (<= 9 |fibo_#in~n|) .cse3 .cse1)) (or (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|)) (not .cse4) .cse2) (or (not (<= 4 |fibo_#in~n|)) (not (<= |fibo_#in~n| 4)) (and (<= |fibo_#t~ret7| 2) (<= 2 |fibo_#t~ret7|))) (or (not (<= |fibo_#in~n| 5)) (and (<= |fibo_#t~ret7| 3) (<= 3 |fibo_#t~ret7|)) (not (<= 5 |fibo_#in~n|))) (or (<= 11 |fibo_#in~n|) (and (<= 34 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 34)) (<= |fibo_#in~n| 9)) (or (= |fibo_#t~ret7| 1) (not (<= |fibo_#in~n| 3))) (or (not (<= 6 |fibo_#in~n|)) (and (<= 5 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 5)) .cse4) (or (<= 10 |fibo_#in~n|) (and .cse3 .cse1 (<= |fibo_#in~n| 6) (<= 3 |fibo_#in~n|)) (and .cse3 (<= 7 fibo_~n) .cse0) (and .cse3 (<= 2 |fibo_#in~n|) .cse1 (<= |fibo_#in~n| 2)) (and (<= 21 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 21))))) [2020-12-09 06:15:10,455 INFO L262 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2020-12-09 06:15:10,455 INFO L262 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-12-09 06:15:10,455 INFO L262 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-12-09 06:15:10,455 INFO L265 CegarLoopResult]: At program point fiboENTRY(lines 7 15) the Hoare annotation is: true [2020-12-09 06:15:10,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:15:10 BoogieIcfgContainer [2020-12-09 06:15:10,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 06:15:10,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 06:15:10,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 06:15:10,465 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 06:15:10,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:14:12" (3/4) ... [2020-12-09 06:15:10,467 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 06:15:10,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo [2020-12-09 06:15:10,472 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-12-09 06:15:10,473 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 06:15:10,473 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 06:15:10,473 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 06:15:10,492 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5c89cd3b-6249-4024-99bc-164c18cdb7ed/bin/utaipan/witness.graphml [2020-12-09 06:15:10,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 06:15:10,493 INFO L168 Benchmark]: Toolchain (without parser) took 57986.01 ms. Allocated memory was 88.1 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 60.8 MB in the beginning and 955.1 MB in the end (delta: -894.3 MB). Peak memory consumption was 298.7 MB. Max. memory is 16.1 GB. [2020-12-09 06:15:10,493 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 88.1 MB. Free memory is still 53.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:15:10,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.20 ms. Allocated memory is still 88.1 MB. Free memory was 60.8 MB in the beginning and 66.6 MB in the end (delta: -5.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 06:15:10,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.33 ms. Allocated memory is still 88.1 MB. Free memory was 66.6 MB in the beginning and 65.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:15:10,493 INFO L168 Benchmark]: Boogie Preprocessor took 16.13 ms. Allocated memory is still 88.1 MB. Free memory was 65.5 MB in the beginning and 64.6 MB in the end (delta: 844.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:15:10,494 INFO L168 Benchmark]: RCFGBuilder took 205.62 ms. Allocated memory is still 88.1 MB. Free memory was 64.6 MB in the beginning and 51.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 06:15:10,494 INFO L168 Benchmark]: TraceAbstraction took 57557.72 ms. Allocated memory was 88.1 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 50.9 MB in the beginning and 958.2 MB in the end (delta: -907.3 MB). Peak memory consumption was 794.4 MB. Max. memory is 16.1 GB. [2020-12-09 06:15:10,494 INFO L168 Benchmark]: Witness Printer took 27.62 ms. Allocated memory is still 1.3 GB. Free memory was 957.2 MB in the beginning and 955.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:15:10,496 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.13 ms. Allocated memory is still 88.1 MB. Free memory is still 53.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 149.20 ms. Allocated memory is still 88.1 MB. Free memory was 60.8 MB in the beginning and 66.6 MB in the end (delta: -5.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 25.33 ms. Allocated memory is still 88.1 MB. Free memory was 66.6 MB in the beginning and 65.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 16.13 ms. Allocated memory is still 88.1 MB. Free memory was 65.5 MB in the beginning and 64.6 MB in the end (delta: 844.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 205.62 ms. Allocated memory is still 88.1 MB. Free memory was 64.6 MB in the beginning and 51.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 57557.72 ms. Allocated memory was 88.1 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 50.9 MB in the beginning and 958.2 MB in the end (delta: -907.3 MB). Peak memory consumption was 794.4 MB. Max. memory is 16.1 GB. * Witness Printer took 27.62 ms. Allocated memory is still 1.3 GB. Free memory was 957.2 MB in the beginning and 955.1 MB in the end (delta: 2.1 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: 29]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 10 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 56.2s, OverallIterations: 15, TraceHistogramMax: 203, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 297 SDtfs, 975 SDslu, 1928 SDs, 0 SdLazy, 3298 SolverSat, 1269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12698 GetRequests, 12167 SyntacticMatches, 176 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 233 PreInvPairs, 502 NumberOfFragments, 181 HoareAnnotationTreeSize, 233 FomulaSimplifications, 2198 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 5142 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 43.5s InterpolantComputationTime, 12093 NumberOfCodeBlocks, 10767 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 18089 ConstructedInterpolants, 0 QuantifiedInterpolants, 29412345 SizeOfPredicates, 80 NumberOfNonLiveVariables, 10795 ConjunctsInSsa, 866 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 933587/1086243 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...