./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh --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 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 12:54:52,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 12:54:52,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 12:54:52,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 12:54:52,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 12:54:52,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 12:54:52,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 12:54:52,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 12:54:52,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 12:54:52,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 12:54:52,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 12:54:52,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 12:54:52,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 12:54:52,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 12:54:52,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 12:54:52,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 12:54:52,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 12:54:52,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 12:54:52,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 12:54:52,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 12:54:52,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 12:54:52,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 12:54:52,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 12:54:52,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 12:54:52,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 12:54:52,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 12:54:52,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 12:54:52,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 12:54:52,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 12:54:52,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 12:54:52,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 12:54:52,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 12:54:52,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 12:54:52,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 12:54:52,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 12:54:52,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 12:54:52,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 12:54:52,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 12:54:52,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 12:54:52,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 12:54:52,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 12:54:52,717 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 12:54:52,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 12:54:52,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 12:54:52,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 12:54:52,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 12:54:52,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 12:54:52,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 12:54:52,741 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 12:54:52,741 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 12:54:52,741 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 12:54:52,741 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 12:54:52,741 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 12:54:52,741 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 12:54:52,742 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 12:54:52,742 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 12:54:52,742 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 12:54:52,742 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 12:54:52,742 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 12:54:52,743 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 12:54:52,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 12:54:52,743 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 12:54:52,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 12:54:52,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 12:54:52,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 12:54:52,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 12:54:52,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 12:54:52,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 12:54:52,744 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 12:54:52,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 12:54:52,745 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 12:54:52,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 12:54:52,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 12:54:52,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 12:54:52,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:54:52,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 12:54:52,746 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 12:54:52,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 12:54:52,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 12:54:52,746 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 12:54:52,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 12:54:52,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 12:54:52,747 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 12:54:52,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/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_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh 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 -> 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a [2022-12-14 12:54:52,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 12:54:52,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 12:54:52,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 12:54:52,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 12:54:52,967 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 12:54:52,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2022-12-14 12:54:55,533 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 12:54:55,676 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 12:54:55,676 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2022-12-14 12:54:55,682 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/data/615aa48db/4428f38863a0437aa0956a92e90abddd/FLAG0c3c8b139 [2022-12-14 12:54:55,693 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/data/615aa48db/4428f38863a0437aa0956a92e90abddd [2022-12-14 12:54:55,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 12:54:55,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 12:54:55,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 12:54:55,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 12:54:55,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 12:54:55,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a7ce74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55, skipping insertion in model container [2022-12-14 12:54:55,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 12:54:55,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 12:54:55,845 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2022-12-14 12:54:55,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:54:55,860 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 12:54:55,875 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2022-12-14 12:54:55,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:54:55,891 INFO L208 MainTranslator]: Completed translation [2022-12-14 12:54:55,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55 WrapperNode [2022-12-14 12:54:55,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 12:54:55,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 12:54:55,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 12:54:55,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 12:54:55,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,922 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-12-14 12:54:55,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 12:54:55,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 12:54:55,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 12:54:55,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 12:54:55,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,934 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 12:54:55,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 12:54:55,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 12:54:55,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 12:54:55,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (1/1) ... [2022-12-14 12:54:55,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:54:55,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:54:55,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 12:54:55,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 12:54:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 12:54:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 12:54:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-12-14 12:54:55,995 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-12-14 12:54:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-12-14 12:54:55,995 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-12-14 12:54:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 12:54:55,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 12:54:56,045 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 12:54:56,047 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 12:54:56,122 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 12:54:56,132 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 12:54:56,132 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 12:54:56,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:54:56 BoogieIcfgContainer [2022-12-14 12:54:56,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 12:54:56,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 12:54:56,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 12:54:56,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 12:54:56,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:54:55" (1/3) ... [2022-12-14 12:54:56,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b586d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:54:56, skipping insertion in model container [2022-12-14 12:54:56,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:54:55" (2/3) ... [2022-12-14 12:54:56,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b586d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:54:56, skipping insertion in model container [2022-12-14 12:54:56,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:54:56" (3/3) ... [2022-12-14 12:54:56,141 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2022-12-14 12:54:56,155 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 12:54:56,155 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 12:54:56,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 12:54:56,200 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d817fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 12:54:56,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 12:54:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 12:54:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 12:54:56,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:54:56,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:54:56,213 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:54:56,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:54:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2097990987, now seen corresponding path program 1 times [2022-12-14 12:54:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:54:56,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160495892] [2022-12-14 12:54:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:54:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:54:56,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:54:56,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160495892] [2022-12-14 12:54:56,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160495892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:54:56,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:54:56,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 12:54:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474470342] [2022-12-14 12:54:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:54:56,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 12:54:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:54:56,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 12:54:56,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:54:56,454 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 12:54:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:54:56,510 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-12-14 12:54:56,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 12:54:56,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-12-14 12:54:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:54:56,522 INFO L225 Difference]: With dead ends: 36 [2022-12-14 12:54:56,522 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 12:54:56,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:54:56,529 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:54:56,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:54:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 12:54:56,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-12-14 12:54:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 12:54:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-12-14 12:54:56,576 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2022-12-14 12:54:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:54:56,576 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-12-14 12:54:56,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 12:54:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-12-14 12:54:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 12:54:56,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:54:56,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:54:56,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 12:54:56,579 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:54:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:54:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1328370967, now seen corresponding path program 1 times [2022-12-14 12:54:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:54:56,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965833574] [2022-12-14 12:54:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:56,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:54:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:54:56,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:54:56,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965833574] [2022-12-14 12:54:56,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965833574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:54:56,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:54:56,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 12:54:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067339990] [2022-12-14 12:54:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:54:56,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 12:54:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:54:56,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 12:54:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:54:56,663 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 12:54:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:54:56,686 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-12-14 12:54:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 12:54:56,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-12-14 12:54:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:54:56,687 INFO L225 Difference]: With dead ends: 32 [2022-12-14 12:54:56,687 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 12:54:56,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:54:56,689 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:54:56,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:54:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 12:54:56,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-12-14 12:54:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 12:54:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-12-14 12:54:56,694 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2022-12-14 12:54:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:54:56,694 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-12-14 12:54:56,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 12:54:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-12-14 12:54:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 12:54:56,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:54:56,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:54:56,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 12:54:56,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:54:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:54:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1296553538, now seen corresponding path program 1 times [2022-12-14 12:54:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:54:56,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107534056] [2022-12-14 12:54:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:54:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:54:56,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:54:56,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107534056] [2022-12-14 12:54:56,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107534056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:54:56,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482343038] [2022-12-14 12:54:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:56,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:54:56,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:54:56,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:54:56,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 12:54:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:56,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 12:54:56,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:54:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:54:56,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:54:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:54:57,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482343038] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:54:57,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1148793208] [2022-12-14 12:54:57,091 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-12-14 12:54:57,091 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:54:57,094 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:54:57,098 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:54:57,098 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:54:57,172 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 39 for LOIs [2022-12-14 12:54:57,201 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 39 for LOIs [2022-12-14 12:54:57,207 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:54:57,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1148793208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:54:57,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:54:57,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7, 7] total 17 [2022-12-14 12:54:57,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078395903] [2022-12-14 12:54:57,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:54:57,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:54:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:54:57,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:54:57,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-12-14 12:54:57,439 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:54:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:54:57,530 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-12-14 12:54:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:54:57,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2022-12-14 12:54:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:54:57,532 INFO L225 Difference]: With dead ends: 68 [2022-12-14 12:54:57,532 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 12:54:57,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-12-14 12:54:57,533 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:54:57,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:54:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 12:54:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-12-14 12:54:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-14 12:54:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-12-14 12:54:57,541 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2022-12-14 12:54:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:54:57,541 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-12-14 12:54:57,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:54:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-12-14 12:54:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 12:54:57,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:54:57,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:54:57,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 12:54:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:54:57,744 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:54:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:54:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash -28918515, now seen corresponding path program 1 times [2022-12-14 12:54:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:54:57,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138015855] [2022-12-14 12:54:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:57,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:54:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:54:57,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:54:57,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138015855] [2022-12-14 12:54:57,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138015855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:54:57,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024768411] [2022-12-14 12:54:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:57,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:54:57,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:54:57,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:54:57,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 12:54:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:57,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 12:54:57,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:54:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 12:54:57,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:54:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:54:58,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024768411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:54:58,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136361418] [2022-12-14 12:54:58,220 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 12:54:58,220 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:54:58,221 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-12-14 12:54:58,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:54:58,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2022-12-14 12:54:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861899920] [2022-12-14 12:54:58,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:54:58,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 12:54:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:54:58,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 12:54:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-14 12:54:58,224 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 12:54:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:54:58,383 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-12-14 12:54:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 12:54:58,384 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2022-12-14 12:54:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:54:58,386 INFO L225 Difference]: With dead ends: 85 [2022-12-14 12:54:58,386 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 12:54:58,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:54:58,388 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:54:58,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 94 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:54:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 12:54:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-12-14 12:54:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 12:54:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-12-14 12:54:58,397 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2022-12-14 12:54:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:54:58,397 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-12-14 12:54:58,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 12:54:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-12-14 12:54:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 12:54:58,398 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:54:58,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:54:58,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 12:54:58,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-14 12:54:58,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:54:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:54:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash -243412115, now seen corresponding path program 1 times [2022-12-14 12:54:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:54:58,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103940908] [2022-12-14 12:54:58,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:58,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:54:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 12:54:58,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:54:58,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103940908] [2022-12-14 12:54:58,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103940908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:54:58,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69540197] [2022-12-14 12:54:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:58,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:54:58,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:54:58,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:54:58,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 12:54:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:58,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 12:54:58,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:54:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:54:58,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:54:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 12:54:59,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69540197] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:54:59,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [339564352] [2022-12-14 12:54:59,084 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 12:54:59,084 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:54:59,084 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-12-14 12:54:59,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:54:59,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-12-14 12:54:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918861510] [2022-12-14 12:54:59,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:54:59,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 12:54:59,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:54:59,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 12:54:59,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-12-14 12:54:59,086 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 12:54:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:54:59,437 INFO L93 Difference]: Finished difference Result 121 states and 203 transitions. [2022-12-14 12:54:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 12:54:59,437 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-12-14 12:54:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:54:59,440 INFO L225 Difference]: With dead ends: 121 [2022-12-14 12:54:59,441 INFO L226 Difference]: Without dead ends: 77 [2022-12-14 12:54:59,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2022-12-14 12:54:59,443 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:54:59,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 198 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:54:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-14 12:54:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-12-14 12:54:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-12-14 12:54:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2022-12-14 12:54:59,454 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 36 [2022-12-14 12:54:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:54:59,454 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2022-12-14 12:54:59,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 12:54:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2022-12-14 12:54:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 12:54:59,456 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:54:59,456 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:54:59,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 12:54:59,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:54:59,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:54:59,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:54:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 403750738, now seen corresponding path program 1 times [2022-12-14 12:54:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:54:59,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318236882] [2022-12-14 12:54:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:54:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 12:54:59,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:54:59,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318236882] [2022-12-14 12:54:59,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318236882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:54:59,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989448081] [2022-12-14 12:54:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:54:59,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:54:59,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:54:59,854 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:54:59,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 12:54:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:54:59,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 12:54:59,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:54:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 12:54:59,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:55:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 12:55:00,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989448081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:55:00,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1317270223] [2022-12-14 12:55:00,287 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 12:55:00,287 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:55:00,287 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-12-14 12:55:00,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:55:00,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2022-12-14 12:55:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79801768] [2022-12-14 12:55:00,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:55:00,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 12:55:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:55:00,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 12:55:00,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-12-14 12:55:00,289 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2022-12-14 12:55:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:55:00,453 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2022-12-14 12:55:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 12:55:00,454 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 50 [2022-12-14 12:55:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:55:00,457 INFO L225 Difference]: With dead ends: 119 [2022-12-14 12:55:00,457 INFO L226 Difference]: Without dead ends: 97 [2022-12-14 12:55:00,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-12-14 12:55:00,459 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:55:00,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 94 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:55:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-14 12:55:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2022-12-14 12:55:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 11 states have return successors, (39), 17 states have call predecessors, (39), 14 states have call successors, (39) [2022-12-14 12:55:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2022-12-14 12:55:00,471 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 50 [2022-12-14 12:55:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:55:00,471 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2022-12-14 12:55:00,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2022-12-14 12:55:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2022-12-14 12:55:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-14 12:55:00,473 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:55:00,473 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:55:00,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 12:55:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:00,675 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:55:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:55:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1766289300, now seen corresponding path program 1 times [2022-12-14 12:55:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:55:00,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364988057] [2022-12-14 12:55:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:55:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 12:55:00,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:55:00,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364988057] [2022-12-14 12:55:00,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364988057] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:55:00,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138404103] [2022-12-14 12:55:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:00,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:00,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:55:00,911 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:55:00,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 12:55:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:00,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 12:55:00,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:55:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 12:55:01,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:55:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-14 12:55:01,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138404103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:55:01,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [765321422] [2022-12-14 12:55:01,621 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 12:55:01,621 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:55:01,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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-12-14 12:55:01,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:55:01,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 22 [2022-12-14 12:55:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569790865] [2022-12-14 12:55:01,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:55:01,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 12:55:01,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:55:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 12:55:01,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-12-14 12:55:01,624 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 states have internal predecessors, (71), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-12-14 12:55:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:55:02,175 INFO L93 Difference]: Finished difference Result 204 states and 411 transitions. [2022-12-14 12:55:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 12:55:02,176 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 states have internal predecessors, (71), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 79 [2022-12-14 12:55:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:55:02,179 INFO L225 Difference]: With dead ends: 204 [2022-12-14 12:55:02,179 INFO L226 Difference]: Without dead ends: 115 [2022-12-14 12:55:02,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 147 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 12:55:02,181 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 94 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 12:55:02,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 267 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 12:55:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-14 12:55:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2022-12-14 12:55:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.171875) internal successors, (75), 66 states have internal predecessors, (75), 19 states have call successors, (19), 8 states have call predecessors, (19), 14 states have return successors, (50), 23 states have call predecessors, (50), 19 states have call successors, (50) [2022-12-14 12:55:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2022-12-14 12:55:02,204 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 79 [2022-12-14 12:55:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:55:02,204 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2022-12-14 12:55:02,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 states have internal predecessors, (71), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-12-14 12:55:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2022-12-14 12:55:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-14 12:55:02,209 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:55:02,210 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 12:55:02,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 12:55:02,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:02,411 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:55:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:55:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1530453204, now seen corresponding path program 2 times [2022-12-14 12:55:02,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:55:02,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489126723] [2022-12-14 12:55:02,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:02,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:55:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 40 proven. 139 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2022-12-14 12:55:02,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:55:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489126723] [2022-12-14 12:55:02,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489126723] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:55:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698272384] [2022-12-14 12:55:02,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:55:02,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:02,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:55:02,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:55:02,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 12:55:02,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:55:02,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:55:02,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 12:55:02,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:55:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2022-12-14 12:55:02,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:55:02,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698272384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:55:02,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:55:02,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2022-12-14 12:55:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274022067] [2022-12-14 12:55:02,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:55:02,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 12:55:02,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:55:02,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 12:55:02,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 12:55:02,663 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 12:55:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:55:02,699 INFO L93 Difference]: Finished difference Result 188 states and 309 transitions. [2022-12-14 12:55:02,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:55:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 154 [2022-12-14 12:55:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:55:02,701 INFO L225 Difference]: With dead ends: 188 [2022-12-14 12:55:02,701 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 12:55:02,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:55:02,703 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:55:02,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 71 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:55:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 12:55:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-12-14 12:55:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 19 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (48), 23 states have call predecessors, (48), 19 states have call successors, (48) [2022-12-14 12:55:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2022-12-14 12:55:02,717 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 154 [2022-12-14 12:55:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:55:02,717 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2022-12-14 12:55:02,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 12:55:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2022-12-14 12:55:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-14 12:55:02,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:55:02,720 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 12:55:02,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 12:55:02,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 12:55:02,921 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:55:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:55:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash -3420712, now seen corresponding path program 1 times [2022-12-14 12:55:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:55:02,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414260830] [2022-12-14 12:55:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:55:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 42 proven. 136 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2022-12-14 12:55:03,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:55:03,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414260830] [2022-12-14 12:55:03,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414260830] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:55:03,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160162931] [2022-12-14 12:55:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:03,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:03,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:55:03,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:55:03,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 12:55:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:03,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 12:55:03,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:55:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 42 proven. 136 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2022-12-14 12:55:03,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:55:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 42 proven. 144 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-12-14 12:55:03,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160162931] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:55:03,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2117356362] [2022-12-14 12:55:03,783 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 12:55:03,784 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:55:03,784 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-12-14 12:55:03,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:55:03,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2022-12-14 12:55:03,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249889997] [2022-12-14 12:55:03,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:55:03,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 12:55:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:55:03,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 12:55:03,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-12-14 12:55:03,787 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 15 states have internal predecessors, (55), 11 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2022-12-14 12:55:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:55:03,911 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2022-12-14 12:55:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 12:55:03,911 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 15 states have internal predecessors, (55), 11 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) Word has length 132 [2022-12-14 12:55:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:55:03,914 INFO L225 Difference]: With dead ends: 144 [2022-12-14 12:55:03,914 INFO L226 Difference]: Without dead ends: 130 [2022-12-14 12:55:03,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 256 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:55:03,915 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:55:03,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 81 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:55:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-14 12:55:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2022-12-14 12:55:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 20 states have call successors, (20), 8 states have call predecessors, (20), 16 states have return successors, (55), 25 states have call predecessors, (55), 20 states have call successors, (55) [2022-12-14 12:55:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2022-12-14 12:55:03,926 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 132 [2022-12-14 12:55:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:55:03,927 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2022-12-14 12:55:03,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 15 states have internal predecessors, (55), 11 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2022-12-14 12:55:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2022-12-14 12:55:03,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-14 12:55:03,928 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:55:03,929 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 12:55:03,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 12:55:04,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-14 12:55:04,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:55:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:55:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1687293718, now seen corresponding path program 2 times [2022-12-14 12:55:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:55:04,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28367248] [2022-12-14 12:55:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:04,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:55:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 63 proven. 178 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2022-12-14 12:55:04,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:55:04,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28367248] [2022-12-14 12:55:04,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28367248] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:55:04,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399476072] [2022-12-14 12:55:04,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:55:04,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:04,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:55:04,381 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:55:04,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 12:55:04,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 12:55:04,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:55:04,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 12:55:04,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:55:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 255 proven. 32 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2022-12-14 12:55:04,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:55:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 255 proven. 32 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2022-12-14 12:55:05,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399476072] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:55:05,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967259009] [2022-12-14 12:55:05,019 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 12:55:05,019 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:55:05,019 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-12-14 12:55:05,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:55:05,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 18 [2022-12-14 12:55:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113999505] [2022-12-14 12:55:05,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:55:05,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 12:55:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:55:05,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 12:55:05,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-12-14 12:55:05,022 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 18 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 18 states have internal predecessors, (66), 10 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2022-12-14 12:55:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:55:05,309 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2022-12-14 12:55:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 12:55:05,309 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 18 states have internal predecessors, (66), 10 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) Word has length 187 [2022-12-14 12:55:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:55:05,312 INFO L225 Difference]: With dead ends: 261 [2022-12-14 12:55:05,312 INFO L226 Difference]: Without dead ends: 151 [2022-12-14 12:55:05,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 362 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2022-12-14 12:55:05,314 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 82 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:55:05,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 140 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:55:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-14 12:55:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2022-12-14 12:55:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 87 states have internal predecessors, (100), 25 states have call successors, (25), 11 states have call predecessors, (25), 19 states have return successors, (83), 31 states have call predecessors, (83), 25 states have call successors, (83) [2022-12-14 12:55:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2022-12-14 12:55:05,325 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 187 [2022-12-14 12:55:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:55:05,325 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2022-12-14 12:55:05,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 18 states have internal predecessors, (66), 10 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2022-12-14 12:55:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2022-12-14 12:55:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-12-14 12:55:05,327 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:55:05,328 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 14, 14, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-12-14 12:55:05,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 12:55:05,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 12:55:05,529 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:55:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:55:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2126315464, now seen corresponding path program 3 times [2022-12-14 12:55:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:55:05,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310511522] [2022-12-14 12:55:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:05,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:55:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 157 proven. 234 refuted. 0 times theorem prover too weak. 1567 trivial. 0 not checked. [2022-12-14 12:55:05,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:55:05,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310511522] [2022-12-14 12:55:05,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310511522] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:55:05,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637279730] [2022-12-14 12:55:05,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:55:05,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:05,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:55:05,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:55:05,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 12:55:05,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:55:05,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:55:05,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 12:55:05,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:55:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 1125 proven. 166 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2022-12-14 12:55:06,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:55:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 163 proven. 600 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2022-12-14 12:55:07,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637279730] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:55:07,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [193461938] [2022-12-14 12:55:07,197 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 12:55:07,197 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:55:07,198 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-12-14 12:55:07,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:55:07,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 19] total 30 [2022-12-14 12:55:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796588071] [2022-12-14 12:55:07,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:55:07,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 12:55:07,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:55:07,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 12:55:07,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2022-12-14 12:55:07,200 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand has 30 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 30 states have internal predecessors, (109), 22 states have call successors, (33), 2 states have call predecessors, (33), 13 states have return successors, (40), 15 states have call predecessors, (40), 22 states have call successors, (40) [2022-12-14 12:55:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:55:07,839 INFO L93 Difference]: Finished difference Result 314 states and 648 transitions. [2022-12-14 12:55:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 12:55:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 30 states have internal predecessors, (109), 22 states have call successors, (33), 2 states have call predecessors, (33), 13 states have return successors, (40), 15 states have call predecessors, (40), 22 states have call successors, (40) Word has length 265 [2022-12-14 12:55:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:55:07,842 INFO L225 Difference]: With dead ends: 314 [2022-12-14 12:55:07,842 INFO L226 Difference]: Without dead ends: 146 [2022-12-14 12:55:07,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 504 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=2231, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 12:55:07,844 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 112 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 12:55:07,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 326 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 12:55:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-14 12:55:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2022-12-14 12:55:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 23 states have call successors, (23), 13 states have call predecessors, (23), 16 states have return successors, (50), 27 states have call predecessors, (50), 23 states have call successors, (50) [2022-12-14 12:55:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 169 transitions. [2022-12-14 12:55:07,853 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 169 transitions. Word has length 265 [2022-12-14 12:55:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:55:07,853 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 169 transitions. [2022-12-14 12:55:07,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 30 states have internal predecessors, (109), 22 states have call successors, (33), 2 states have call predecessors, (33), 13 states have return successors, (40), 15 states have call predecessors, (40), 22 states have call successors, (40) [2022-12-14 12:55:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 169 transitions. [2022-12-14 12:55:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-14 12:55:07,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:55:07,855 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 12:55:07,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 12:55:08,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:08,056 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:55:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:55:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 865281880, now seen corresponding path program 4 times [2022-12-14 12:55:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:55:08,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120520133] [2022-12-14 12:55:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:55:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 190 proven. 63 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2022-12-14 12:55:08,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:55:08,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120520133] [2022-12-14 12:55:08,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120520133] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:55:08,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201777187] [2022-12-14 12:55:08,238 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:55:08,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:08,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:55:08,239 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:55:08,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 12:55:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:08,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 12:55:08,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:55:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 89 proven. 148 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2022-12-14 12:55:08,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:55:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 89 proven. 153 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2022-12-14 12:55:08,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201777187] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:55:08,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [410796304] [2022-12-14 12:55:08,826 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 12:55:08,826 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:55:08,827 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-12-14 12:55:08,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:55:08,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 23 [2022-12-14 12:55:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891601229] [2022-12-14 12:55:08,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:55:08,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 12:55:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:55:08,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 12:55:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-12-14 12:55:08,828 INFO L87 Difference]: Start difference. First operand 124 states and 169 transitions. Second operand has 23 states, 21 states have (on average 3.380952380952381) internal successors, (71), 23 states have internal predecessors, (71), 14 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (23), 13 states have call predecessors, (23), 14 states have call successors, (23) [2022-12-14 12:55:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:55:09,165 INFO L93 Difference]: Finished difference Result 259 states and 359 transitions. [2022-12-14 12:55:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 12:55:09,166 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.380952380952381) internal successors, (71), 23 states have internal predecessors, (71), 14 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (23), 13 states have call predecessors, (23), 14 states have call successors, (23) Word has length 185 [2022-12-14 12:55:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:55:09,168 INFO L225 Difference]: With dead ends: 259 [2022-12-14 12:55:09,168 INFO L226 Difference]: Without dead ends: 144 [2022-12-14 12:55:09,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 355 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 12:55:09,169 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 79 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:55:09,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 221 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:55:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-14 12:55:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 124. [2022-12-14 12:55:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 23 states have call successors, (23), 13 states have call predecessors, (23), 16 states have return successors, (44), 27 states have call predecessors, (44), 23 states have call successors, (44) [2022-12-14 12:55:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2022-12-14 12:55:09,182 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 185 [2022-12-14 12:55:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:55:09,182 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2022-12-14 12:55:09,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.380952380952381) internal successors, (71), 23 states have internal predecessors, (71), 14 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (23), 13 states have call predecessors, (23), 14 states have call successors, (23) [2022-12-14 12:55:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2022-12-14 12:55:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 12:55:09,184 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:55:09,184 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 12:55:09,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 12:55:09,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 12:55:09,385 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:55:09,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:55:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1038052067, now seen corresponding path program 5 times [2022-12-14 12:55:09,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:55:09,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756786110] [2022-12-14 12:55:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:55:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:55:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 27 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-12-14 12:55:09,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:55:09,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756786110] [2022-12-14 12:55:09,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756786110] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:55:09,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304821619] [2022-12-14 12:55:09,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:55:09,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:09,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:55:09,482 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:55:09,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 12:55:09,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 12:55:09,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:55:09,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 12:55:09,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:55:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 27 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-12-14 12:55:09,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:55:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 29 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2022-12-14 12:55:09,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304821619] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:55:09,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533509695] [2022-12-14 12:55:09,836 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 12:55:09,837 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:55:09,837 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-12-14 12:55:09,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:55:09,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2022-12-14 12:55:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109199200] [2022-12-14 12:55:09,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:55:09,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 12:55:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:55:09,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 12:55:09,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:55:09,839 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2022-12-14 12:55:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:55:09,915 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2022-12-14 12:55:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 12:55:09,916 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) Word has length 146 [2022-12-14 12:55:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:55:09,917 INFO L225 Difference]: With dead ends: 134 [2022-12-14 12:55:09,917 INFO L226 Difference]: Without dead ends: 127 [2022-12-14 12:55:09,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 286 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-14 12:55:09,918 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:55:09,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:55:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-14 12:55:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-12-14 12:55:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 23 states have call successors, (23), 13 states have call predecessors, (23), 16 states have return successors, (43), 27 states have call predecessors, (43), 23 states have call successors, (43) [2022-12-14 12:55:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2022-12-14 12:55:09,929 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 146 [2022-12-14 12:55:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:55:09,929 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2022-12-14 12:55:09,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2022-12-14 12:55:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2022-12-14 12:55:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 12:55:09,931 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:55:09,931 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 12:55:09,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 12:55:10,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:55:10,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:55:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:55:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1715223367, now seen corresponding path program 6 times [2022-12-14 12:55:10,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:55:10,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869752321] [2022-12-14 12:55:10,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:55:10,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:55:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 12:55:10,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 12:55:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 12:55:10,198 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 12:55:10,199 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 12:55:10,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 12:55:10,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 12:55:10,203 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 12:55:10,206 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 12:55:10,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 12:55:10 BoogieIcfgContainer [2022-12-14 12:55:10,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 12:55:10,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 12:55:10,238 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 12:55:10,238 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 12:55:10,239 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:54:56" (3/4) ... [2022-12-14 12:55:10,240 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 12:55:10,288 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 12:55:10,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 12:55:10,289 INFO L158 Benchmark]: Toolchain (without parser) took 14591.38ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 107.0MB in the beginning and 73.9MB in the end (delta: 33.1MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2022-12-14 12:55:10,289 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 12:55:10,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.18ms. Allocated memory is still 148.9MB. Free memory was 106.6MB in the beginning and 96.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 12:55:10,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.68ms. Allocated memory is still 148.9MB. Free memory was 96.4MB in the beginning and 95.2MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 12:55:10,290 INFO L158 Benchmark]: Boogie Preprocessor took 12.63ms. Allocated memory is still 148.9MB. Free memory was 95.2MB in the beginning and 93.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 12:55:10,290 INFO L158 Benchmark]: RCFGBuilder took 198.76ms. Allocated memory is still 148.9MB. Free memory was 93.9MB in the beginning and 83.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 12:55:10,290 INFO L158 Benchmark]: TraceAbstraction took 14101.47ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 83.1MB in the beginning and 79.2MB in the end (delta: 3.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-12-14 12:55:10,290 INFO L158 Benchmark]: Witness Printer took 50.08ms. Allocated memory is still 180.4MB. Free memory was 79.2MB in the beginning and 73.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 12:55:10,292 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.14ms. Allocated memory is still 148.9MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.18ms. Allocated memory is still 148.9MB. Free memory was 106.6MB in the beginning and 96.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.68ms. Allocated memory is still 148.9MB. Free memory was 96.4MB in the beginning and 95.2MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.63ms. Allocated memory is still 148.9MB. Free memory was 95.2MB in the beginning and 93.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 198.76ms. Allocated memory is still 148.9MB. Free memory was 93.9MB in the beginning and 83.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14101.47ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 83.1MB in the beginning and 79.2MB in the end (delta: 3.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Witness Printer took 50.08ms. Allocated memory is still 180.4MB. Free memory was 79.2MB in the beginning and 73.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [result=8, x=6] [L41] reach_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 14, TraceHistogramMax: 21, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 654 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603 mSDsluCounter, 1891 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1557 mSDsCounter, 801 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4042 IncrementalHoareTripleChecker+Invalid, 4843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 801 mSolverCounterUnsat, 334 mSDtfsCounter, 4042 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2669 GetRequests, 2342 SyntacticMatches, 51 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=10, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 160 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2774 NumberOfCodeBlocks, 2423 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3704 ConstructedInterpolants, 0 QuantifiedInterpolants, 5931 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2321 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 34 InterpolantComputations, 3 PerfectInterpolantSequences, 13765/16322 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: OVERALL_TIME: 0.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 13, TOOLS_POST_TIME: 0.0s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME: 0.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 12:55:10,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1947d91-fe35-4c24-86df-cc1e86d251d4/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE