./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P --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 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:42:25,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:42:25,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:42:26,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:42:26,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:42:26,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:42:26,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:42:26,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:42:26,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:42:26,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:42:26,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:42:26,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:42:26,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:42:26,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:42:26,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:42:26,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:42:26,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:42:26,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:42:26,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:42:26,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:42:26,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:42:26,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:42:26,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:42:26,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:42:26,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:42:26,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:42:26,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:42:26,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:42:26,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:42:26,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:42:26,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:42:26,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:42:26,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:42:26,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:42:26,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:42:26,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:42:26,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:42:26,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:42:26,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:42:26,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:42:26,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:42:26,145 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 01:42:26,197 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:42:26,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:42:26,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:42:26,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:42:26,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:42:26,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:42:26,206 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:42:26,206 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:42:26,206 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:42:26,206 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:42:26,208 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:42:26,208 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:42:26,208 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:42:26,208 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:42:26,209 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:42:26,209 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:42:26,209 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:42:26,209 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:42:26,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:42:26,210 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:42:26,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:42:26,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:42:26,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:42:26,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:42:26,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:42:26,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:42:26,214 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:42:26,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:42:26,215 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:42:26,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:42:26,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:42:26,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:42:26,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:42:26,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:42:26,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:42:26,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:42:26,217 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:42:26,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:42:26,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:42:26,218 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:42:26,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:42:26,218 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/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_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P 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 -> 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 [2021-11-21 01:42:26,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:42:26,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:42:26,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:42:26,511 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:42:26,512 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:42:26,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/recursive/Fibonacci04.c [2021-11-21 01:42:26,570 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/data/bd3a083b7/6388937fa3d14dc096a196ccf3ecebdc/FLAG6dd748602 [2021-11-21 01:42:27,045 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:42:27,045 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/sv-benchmarks/c/recursive/Fibonacci04.c [2021-11-21 01:42:27,051 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/data/bd3a083b7/6388937fa3d14dc096a196ccf3ecebdc/FLAG6dd748602 [2021-11-21 01:42:27,390 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/data/bd3a083b7/6388937fa3d14dc096a196ccf3ecebdc [2021-11-21 01:42:27,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:42:27,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:42:27,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:42:27,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:42:27,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:42:27,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddb3e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27, skipping insertion in model container [2021-11-21 01:42:27,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:42:27,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:42:27,623 WARN L230 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_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2021-11-21 01:42:27,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:42:27,639 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:42:27,667 WARN L230 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_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2021-11-21 01:42:27,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:42:27,683 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:42:27,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27 WrapperNode [2021-11-21 01:42:27,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:42:27,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:42:27,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:42:27,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:42:27,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,717 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2021-11-21 01:42:27,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:42:27,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:42:27,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:42:27,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:42:27,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:42:27,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:42:27,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:42:27,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:42:27,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (1/1) ... [2021-11-21 01:42:27,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:42:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:42:27,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:42:27,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:42:27,822 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-11-21 01:42:27,822 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-11-21 01:42:27,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:42:27,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:42:27,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:42:27,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:42:27,883 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:42:27,885 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:42:27,976 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:42:27,987 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:42:27,987 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-21 01:42:27,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:42:27 BoogieIcfgContainer [2021-11-21 01:42:27,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:42:27,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:42:27,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:42:27,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:42:27,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:42:27" (1/3) ... [2021-11-21 01:42:27,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fe396a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:42:27, skipping insertion in model container [2021-11-21 01:42:27,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:27" (2/3) ... [2021-11-21 01:42:27,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fe396a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:42:27, skipping insertion in model container [2021-11-21 01:42:27,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:42:27" (3/3) ... [2021-11-21 01:42:27,998 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2021-11-21 01:42:28,003 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:42:28,003 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:42:28,050 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:42:28,058 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:42:28,058 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:42:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-21 01:42:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-21 01:42:28,079 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:42:28,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:42:28,080 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:42:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:42:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2021-11-21 01:42:28,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:42:28,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600592677] [2021-11-21 01:42:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:28,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:42:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:42:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:42:28,291 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:42:28,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600592677] [2021-11-21 01:42:28,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600592677] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:42:28,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:42:28,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:42:28,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726789626] [2021-11-21 01:42:28,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:42:28,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 01:42:28,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:42:28,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 01:42:28,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:42:28,329 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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) [2021-11-21 01:42:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:42:28,453 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-11-21 01:42:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 01:42:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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 [2021-11-21 01:42:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:42:28,466 INFO L225 Difference]: With dead ends: 27 [2021-11-21 01:42:28,467 INFO L226 Difference]: Without dead ends: 17 [2021-11-21 01:42:28,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:42:28,492 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:42:28,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:42:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-21 01:42:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-21 01:42:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-21 01:42:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-11-21 01:42:28,532 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2021-11-21 01:42:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:42:28,533 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-11-21 01:42:28,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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) [2021-11-21 01:42:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-11-21 01:42:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:42:28,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:42:28,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:42:28,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:42:28,536 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:42:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:42:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2021-11-21 01:42:28,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:42:28,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995539418] [2021-11-21 01:42:28,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:28,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:42:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:42:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:42:28,620 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:42:28,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995539418] [2021-11-21 01:42:28,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995539418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:42:28,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:42:28,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:42:28,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700604187] [2021-11-21 01:42:28,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:42:28,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 01:42:28,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:42:28,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 01:42:28,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:42:28,626 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2021-11-21 01:42:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:42:28,693 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-11-21 01:42:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 01:42:28,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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 [2021-11-21 01:42:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:42:28,695 INFO L225 Difference]: With dead ends: 23 [2021-11-21 01:42:28,695 INFO L226 Difference]: Without dead ends: 19 [2021-11-21 01:42:28,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:42:28,698 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:42:28,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:42:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-21 01:42:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-21 01:42:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-21 01:42:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-11-21 01:42:28,706 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-11-21 01:42:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:42:28,707 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-11-21 01:42:28,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2021-11-21 01:42:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-11-21 01:42:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-21 01:42:28,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:42:28,709 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:42:28,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:42:28,710 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:42:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:42:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2021-11-21 01:42:28,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:42:28,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225829914] [2021-11-21 01:42:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:28,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:42:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:42:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 01:42:28,807 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:42:28,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225829914] [2021-11-21 01:42:28,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225829914] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:42:28,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565912464] [2021-11-21 01:42:28,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:28,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:42:28,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:42:28,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:42:28,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:42:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:42:28,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 01:42:28,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:42:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 01:42:29,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:42:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-21 01:42:29,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565912464] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:42:29,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1217575070] [2021-11-21 01:42:29,392 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-21 01:42:29,393 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:42:29,398 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-21 01:42:29,400 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:42:29,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2021-11-21 01:42:29,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967889813] [2021-11-21 01:42:29,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:42:29,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-21 01:42:29,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:42:29,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-21 01:42:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-21 01:42:29,408 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-21 01:42:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:42:29,580 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2021-11-21 01:42:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 01:42:29,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2021-11-21 01:42:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:42:29,585 INFO L225 Difference]: With dead ends: 41 [2021-11-21 01:42:29,585 INFO L226 Difference]: Without dead ends: 24 [2021-11-21 01:42:29,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-11-21 01:42:29,592 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:42:29,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 47 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:42:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-21 01:42:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-11-21 01:42:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-21 01:42:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-11-21 01:42:29,620 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 22 [2021-11-21 01:42:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:42:29,620 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-11-21 01:42:29,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-21 01:42:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-11-21 01:42:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-21 01:42:29,627 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:42:29,627 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-21 01:42:29,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:42:29,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:42:29,844 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:42:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:42:29,845 INFO L85 PathProgramCache]: Analyzing trace with hash 271867855, now seen corresponding path program 1 times [2021-11-21 01:42:29,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:42:29,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280772453] [2021-11-21 01:42:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:29,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:42:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:42:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-21 01:42:29,942 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:42:29,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280772453] [2021-11-21 01:42:29,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280772453] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:42:29,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324726520] [2021-11-21 01:42:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:29,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:42:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:42:29,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:42:29,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 01:42:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:42:29,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-21 01:42:30,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:42:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-21 01:42:30,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:42:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-21 01:42:30,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324726520] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:42:30,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1492767360] [2021-11-21 01:42:30,655 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-21 01:42:30,655 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:42:30,656 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-21 01:42:30,657 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:42:30,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2021-11-21 01:42:30,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827736435] [2021-11-21 01:42:30,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:42:30,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-21 01:42:30,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:42:30,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-21 01:42:30,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-11-21 01:42:30,661 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2021-11-21 01:42:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:42:30,816 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. [2021-11-21 01:42:30,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 01:42:30,817 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 50 [2021-11-21 01:42:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:42:30,820 INFO L225 Difference]: With dead ends: 43 [2021-11-21 01:42:30,820 INFO L226 Difference]: Without dead ends: 37 [2021-11-21 01:42:30,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-21 01:42:30,822 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:42:30,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 48 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:42:30,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-21 01:42:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2021-11-21 01:42:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2021-11-21 01:42:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2021-11-21 01:42:30,835 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 50 [2021-11-21 01:42:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:42:30,835 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2021-11-21 01:42:30,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2021-11-21 01:42:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2021-11-21 01:42:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-21 01:42:30,841 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:42:30,841 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 10, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2021-11-21 01:42:30,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:42:31,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:42:31,067 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:42:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:42:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1320545923, now seen corresponding path program 2 times [2021-11-21 01:42:31,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:42:31,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295774622] [2021-11-21 01:42:31,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:31,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:42:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:42:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 158 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2021-11-21 01:42:31,235 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:42:31,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295774622] [2021-11-21 01:42:31,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295774622] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:42:31,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536479314] [2021-11-21 01:42:31,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 01:42:31,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:42:31,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:42:31,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:42:31,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-21 01:42:31,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-21 01:42:31,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:42:31,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-21 01:42:31,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:42:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 202 proven. 12 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2021-11-21 01:42:31,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:42:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 202 proven. 14 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2021-11-21 01:42:32,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536479314] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:42:32,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [888667083] [2021-11-21 01:42:32,244 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-21 01:42:32,244 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:42:32,244 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-21 01:42:32,245 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:42:32,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2021-11-21 01:42:32,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859678780] [2021-11-21 01:42:32,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:42:32,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 01:42:32,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:42:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 01:42:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-11-21 01:42:32,249 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 8 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2021-11-21 01:42:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:42:32,587 INFO L93 Difference]: Finished difference Result 91 states and 192 transitions. [2021-11-21 01:42:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-21 01:42:32,588 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 8 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) Word has length 103 [2021-11-21 01:42:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:42:32,591 INFO L225 Difference]: With dead ends: 91 [2021-11-21 01:42:32,594 INFO L226 Difference]: Without dead ends: 59 [2021-11-21 01:42:32,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-11-21 01:42:32,601 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:42:32,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 72 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:42:32,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-21 01:42:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2021-11-21 01:42:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (31), 14 states have call predecessors, (31), 10 states have call successors, (31) [2021-11-21 01:42:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2021-11-21 01:42:32,627 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 103 [2021-11-21 01:42:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:42:32,629 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2021-11-21 01:42:32,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 8 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2021-11-21 01:42:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2021-11-21 01:42:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-21 01:42:32,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:42:32,640 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1] [2021-11-21 01:42:32,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:42:32,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:42:32,859 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:42:32,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:42:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1362250110, now seen corresponding path program 3 times [2021-11-21 01:42:32,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:42:32,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200917806] [2021-11-21 01:42:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:32,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:42:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:42:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 231 proven. 68 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2021-11-21 01:42:33,051 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:42:33,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200917806] [2021-11-21 01:42:33,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200917806] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:42:33,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363545145] [2021-11-21 01:42:33,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 01:42:33,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:42:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:42:33,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:42:33,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-21 01:42:33,131 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 01:42:33,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:42:33,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-21 01:42:33,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:42:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 264 proven. 67 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2021-11-21 01:42:33,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:42:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 264 proven. 89 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2021-11-21 01:42:34,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363545145] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:42:34,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [350289099] [2021-11-21 01:42:34,467 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-21 01:42:34,467 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:42:34,468 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-21 01:42:34,469 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:42:34,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 13] total 17 [2021-11-21 01:42:34,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502319930] [2021-11-21 01:42:34,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:42:34,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 01:42:34,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:42:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 01:42:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-11-21 01:42:34,473 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2021-11-21 01:42:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:42:34,638 INFO L93 Difference]: Finished difference Result 77 states and 129 transitions. [2021-11-21 01:42:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-21 01:42:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Word has length 119 [2021-11-21 01:42:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:42:34,643 INFO L225 Difference]: With dead ends: 77 [2021-11-21 01:42:34,643 INFO L226 Difference]: Without dead ends: 60 [2021-11-21 01:42:34,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2021-11-21 01:42:34,645 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:42:34,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:42:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-21 01:42:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2021-11-21 01:42:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (25), 14 states have call predecessors, (25), 10 states have call successors, (25) [2021-11-21 01:42:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-11-21 01:42:34,659 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 119 [2021-11-21 01:42:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:42:34,660 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-11-21 01:42:34,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2021-11-21 01:42:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2021-11-21 01:42:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-21 01:42:34,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:42:34,663 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2021-11-21 01:42:34,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-21 01:42:34,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:42:34,887 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:42:34,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:42:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash -82417497, now seen corresponding path program 4 times [2021-11-21 01:42:34,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:42:34,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13076069] [2021-11-21 01:42:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:42:34,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:42:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:42:34,914 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 01:42:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 01:42:34,962 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-21 01:42:34,963 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 01:42:34,964 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 01:42:34,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-21 01:42:34,969 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2021-11-21 01:42:34,972 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 01:42:35,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:42:35 BoogieIcfgContainer [2021-11-21 01:42:35,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 01:42:35,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 01:42:35,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 01:42:35,043 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 01:42:35,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:42:27" (3/4) ... [2021-11-21 01:42:35,045 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-21 01:42:35,119 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-21 01:42:35,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 01:42:35,120 INFO L158 Benchmark]: Toolchain (without parser) took 7725.84ms. Allocated memory was 92.3MB in the beginning and 153.1MB in the end (delta: 60.8MB). Free memory was 68.6MB in the beginning and 84.8MB in the end (delta: -16.2MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2021-11-21 01:42:35,121 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 92.3MB. Free memory was 67.8MB in the beginning and 67.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:42:35,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.55ms. Allocated memory is still 92.3MB. Free memory was 68.6MB in the beginning and 59.1MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:42:35,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.68ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 57.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:42:35,122 INFO L158 Benchmark]: Boogie Preprocessor took 30.97ms. Allocated memory is still 92.3MB. Free memory was 57.5MB in the beginning and 56.8MB in the end (delta: 716.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:42:35,122 INFO L158 Benchmark]: RCFGBuilder took 238.32ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 47.7MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 01:42:35,123 INFO L158 Benchmark]: TraceAbstraction took 7050.80ms. Allocated memory was 92.3MB in the beginning and 153.1MB in the end (delta: 60.8MB). Free memory was 47.2MB in the beginning and 89.0MB in the end (delta: -41.8MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2021-11-21 01:42:35,123 INFO L158 Benchmark]: Witness Printer took 77.09ms. Allocated memory is still 153.1MB. Free memory was 89.0MB in the beginning and 84.8MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:42:35,125 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.24ms. Allocated memory is still 92.3MB. Free memory was 67.8MB in the beginning and 67.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.55ms. Allocated memory is still 92.3MB. Free memory was 68.6MB in the beginning and 59.1MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.68ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 57.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.97ms. Allocated memory is still 92.3MB. Free memory was 57.5MB in the beginning and 56.8MB in the end (delta: 716.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 238.32ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 47.7MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7050.80ms. Allocated memory was 92.3MB in the beginning and 153.1MB in the end (delta: 60.8MB). Free memory was 47.2MB in the beginning and 89.0MB in the end (delta: -41.8MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Witness Printer took 77.09ms. Allocated memory is still 153.1MB. Free memory was 89.0MB in the beginning and 84.8MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 7, TraceHistogramMax: 17, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 529 IncrementalHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 85 mSDtfsCounter, 529 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 574 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=5, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 712 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 887 ConstructedInterpolants, 0 QuantifiedInterpolants, 1605 SizeOfPredicates, 13 NumberOfNonLiveVariables, 550 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 3667/4242 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-21 01:42:35,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53c0597c-4d6b-4dc3-97be-b5137ce9a48a/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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