./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:01:49,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:01:49,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:01:49,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:01:49,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:01:49,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:01:49,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:01:49,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:01:49,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:01:49,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:01:49,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:01:49,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:01:49,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:01:49,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:01:49,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:01:49,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:01:49,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:01:49,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:01:49,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:01:49,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:01:49,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:01:49,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:01:49,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:01:49,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:01:49,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:01:49,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:01:49,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:01:49,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:01:49,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:01:49,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:01:49,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:01:49,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:01:49,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:01:49,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:01:49,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:01:49,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:01:49,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:01:49,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:01:49,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:01:49,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:01:49,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:01:49,465 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:01:49,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:01:49,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:01:49,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:01:49,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:01:49,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:01:49,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:01:49,508 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:01:49,508 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:01:49,508 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:01:49,508 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:01:49,509 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:01:49,510 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:01:49,510 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:01:49,510 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:01:49,511 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:01:49,511 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:01:49,511 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:01:49,511 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:01:49,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:01:49,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:01:49,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:01:49,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:01:49,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:01:49,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:01:49,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:01:49,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:01:49,514 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:01:49,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:01:49,515 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:01:49,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:01:49,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:01:49,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:01:49,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:01:49,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:01:49,517 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:01:49,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:01:49,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:01:49,518 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:01:49,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:01:49,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:01:49,518 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:01:49,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/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_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur 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 [2022-11-26 00:01:49,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:01:49,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:01:49,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:01:49,894 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:01:49,894 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:01:49,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/recursive/Fibonacci04.c [2022-11-26 00:01:52,952 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:01:53,165 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:01:53,166 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/sv-benchmarks/c/recursive/Fibonacci04.c [2022-11-26 00:01:53,174 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/data/5f2e32ab7/09b8183fc5f444f1a4f6b4b63ac2539a/FLAG749273392 [2022-11-26 00:01:53,194 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/data/5f2e32ab7/09b8183fc5f444f1a4f6b4b63ac2539a [2022-11-26 00:01:53,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:01:53,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:01:53,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:01:53,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:01:53,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:01:53,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e7c0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53, skipping insertion in model container [2022-11-26 00:01:53,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:01:53,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:01:53,419 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2022-11-26 00:01:53,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:01:53,439 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:01:53,456 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2022-11-26 00:01:53,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:01:53,470 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:01:53,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53 WrapperNode [2022-11-26 00:01:53,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:01:53,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:01:53,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:01:53,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:01:53,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,508 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-11-26 00:01:53,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:01:53,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:01:53,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:01:53,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:01:53,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,533 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:01:53,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:01:53,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:01:53,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:01:53,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (1/1) ... [2022-11-26 00:01:53,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:01:53,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:01:53,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:01:53,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:01:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-11-26 00:01:53,615 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-11-26 00:01:53,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:01:53,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:01:53,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:01:53,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:01:53,684 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:01:53,686 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:01:53,820 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:01:53,834 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:01:53,834 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:01:53,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:53 BoogieIcfgContainer [2022-11-26 00:01:53,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:01:53,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:01:53,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:01:53,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:01:53,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:01:53" (1/3) ... [2022-11-26 00:01:53,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f27d6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:53, skipping insertion in model container [2022-11-26 00:01:53,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:53" (2/3) ... [2022-11-26 00:01:53,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f27d6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:53, skipping insertion in model container [2022-11-26 00:01:53,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:53" (3/3) ... [2022-11-26 00:01:53,858 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2022-11-26 00:01:53,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:01:53,885 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:01:53,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:01:53,962 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fbd0d46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:01:53,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:01:53,968 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) [2022-11-26 00:01:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:01:53,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:53,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:53,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:01:53,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2022-11-26 00:01:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:53,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244739128] [2022-11-26 00:01:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:01:54,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:54,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244739128] [2022-11-26 00:01:54,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244739128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:01:54,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:01:54,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:01:54,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876198699] [2022-11-26 00:01:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:01:54,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:01:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:54,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:01:54,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:01:54,393 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) [2022-11-26 00:01:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:54,494 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-11-26 00:01:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:01:54,505 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 [2022-11-26 00:01:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:54,514 INFO L225 Difference]: With dead ends: 27 [2022-11-26 00:01:54,518 INFO L226 Difference]: Without dead ends: 17 [2022-11-26 00:01:54,521 INFO L412 NwaCegarLoop]: 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 [2022-11-26 00:01:54,525 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:54,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 25 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:01:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-26 00:01:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-26 00:01:54,574 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) [2022-11-26 00:01:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-26 00:01:54,579 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2022-11-26 00:01:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:54,580 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-26 00:01:54,581 INFO L496 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) [2022-11-26 00:01:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-26 00:01:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:01:54,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:54,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:54,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:01:54,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:01:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2022-11-26 00:01:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:54,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615660672] [2022-11-26 00:01:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:01:54,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615660672] [2022-11-26 00:01:54,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615660672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:01:54,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:01:54,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:01:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695825737] [2022-11-26 00:01:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:01:54,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:01:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:54,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:01:54,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:01:54,703 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) [2022-11-26 00:01:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:54,758 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-11-26 00:01:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:01:54,758 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 [2022-11-26 00:01:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:54,760 INFO L225 Difference]: With dead ends: 23 [2022-11-26 00:01:54,760 INFO L226 Difference]: Without dead ends: 19 [2022-11-26 00:01:54,760 INFO L412 NwaCegarLoop]: 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 [2022-11-26 00:01:54,762 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:54,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:01:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-26 00:01:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-26 00:01:54,775 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) [2022-11-26 00:01:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-26 00:01:54,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-11-26 00:01:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:54,777 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-26 00:01:54,777 INFO L496 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) [2022-11-26 00:01:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-26 00:01:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:01:54,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:54,778 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:54,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:01:54,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:01:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:54,780 INFO L85 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2022-11-26 00:01:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:54,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304380143] [2022-11-26 00:01:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:01:54,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:54,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304380143] [2022-11-26 00:01:54,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304380143] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:01:54,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37170562] [2022-11-26 00:01:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:54,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:54,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:01:54,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:01:54,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:01:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:55,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:01:55,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:01:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:01:55,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:01:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:01:55,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37170562] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:01:55,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2038552313] [2022-11-26 00:01:55,382 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 00:01:55,382 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:01:55,386 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:01:55,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:01:55,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-11-26 00:01:55,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108658939] [2022-11-26 00:01:55,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:01:55,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:01:55,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:55,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:01:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:01:55,392 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) [2022-11-26 00:01:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:55,576 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-11-26 00:01:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:01:55,577 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 [2022-11-26 00:01:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:55,579 INFO L225 Difference]: With dead ends: 41 [2022-11-26 00:01:55,579 INFO L226 Difference]: Without dead ends: 24 [2022-11-26 00:01:55,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:01:55,581 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:55,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 46 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:01:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-26 00:01:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-26 00:01:55,600 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) [2022-11-26 00:01:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-11-26 00:01:55,602 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 22 [2022-11-26 00:01:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:55,602 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-11-26 00:01:55,603 INFO L496 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) [2022-11-26 00:01:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-11-26 00:01:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-26 00:01:55,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:55,605 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:55,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:01:55,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:55,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:01:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash 271867855, now seen corresponding path program 1 times [2022-11-26 00:01:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:55,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250043210] [2022-11-26 00:01:55,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 00:01:56,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:56,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250043210] [2022-11-26 00:01:56,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250043210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:01:56,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156328720] [2022-11-26 00:01:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:01:56,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:01:56,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:01:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:56,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:01:56,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:01:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 00:01:56,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:01:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-26 00:01:56,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156328720] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:01:56,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1997665650] [2022-11-26 00:01:56,746 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 00:01:56,746 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:01:56,747 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:01:56,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:01:56,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2022-11-26 00:01:56,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226738133] [2022-11-26 00:01:56,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:01:56,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:01:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:56,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:01:56,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:01:56,755 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) [2022-11-26 00:01:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:56,908 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. [2022-11-26 00:01:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:01:56,909 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 [2022-11-26 00:01:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:56,918 INFO L225 Difference]: With dead ends: 43 [2022-11-26 00:01:56,918 INFO L226 Difference]: Without dead ends: 37 [2022-11-26 00:01:56,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:01:56,923 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:56,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 47 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:01:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-26 00:01:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-11-26 00:01:56,939 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) [2022-11-26 00:01:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2022-11-26 00:01:56,941 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 50 [2022-11-26 00:01:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:56,941 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2022-11-26 00:01:56,941 INFO L496 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) [2022-11-26 00:01:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2022-11-26 00:01:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-26 00:01:56,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:56,953 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 10, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:56,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:01:57,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:57,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:01:57,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1320545923, now seen corresponding path program 2 times [2022-11-26 00:01:57,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:57,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352301649] [2022-11-26 00:01:57,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 158 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2022-11-26 00:01:57,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:57,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352301649] [2022-11-26 00:01:57,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352301649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:01:57,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981300975] [2022-11-26 00:01:57,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:01:57,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:57,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:01:57,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:01:57,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:01:57,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-26 00:01:57,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:01:57,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:01:57,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:01:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 202 proven. 12 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2022-11-26 00:01:57,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:01:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 202 proven. 14 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-11-26 00:01:58,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981300975] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:01:58,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2003228554] [2022-11-26 00:01:58,197 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 00:01:58,198 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:01:58,198 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:01:58,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:01:58,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2022-11-26 00:01:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895139912] [2022-11-26 00:01:58,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:01:58,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:01:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:01:58,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:01:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:01:58,202 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) [2022-11-26 00:01:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:01:58,546 INFO L93 Difference]: Finished difference Result 91 states and 192 transitions. [2022-11-26 00:01:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 00:01:58,547 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 [2022-11-26 00:01:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:01:58,548 INFO L225 Difference]: With dead ends: 91 [2022-11-26 00:01:58,549 INFO L226 Difference]: Without dead ends: 59 [2022-11-26 00:01:58,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 198 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:01:58,551 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:01:58,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 71 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:01:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-26 00:01:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-11-26 00:01:58,563 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) [2022-11-26 00:01:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2022-11-26 00:01:58,565 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 103 [2022-11-26 00:01:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:01:58,569 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2022-11-26 00:01:58,569 INFO L496 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) [2022-11-26 00:01:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2022-11-26 00:01:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-26 00:01:58,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:01:58,572 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:01:58,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:01:58,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:58,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:01:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:01:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1362250110, now seen corresponding path program 3 times [2022-11-26 00:01:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:01:58,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815530786] [2022-11-26 00:01:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:01:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:01:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:01:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 231 proven. 68 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2022-11-26 00:01:59,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:01:59,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815530786] [2022-11-26 00:01:59,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815530786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:01:59,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94290362] [2022-11-26 00:01:59,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:01:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:01:59,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:01:59,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:01:59,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:01:59,152 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:01:59,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:01:59,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 00:01:59,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:01:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 264 proven. 67 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-11-26 00:01:59,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:02:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 264 proven. 89 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2022-11-26 00:02:00,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94290362] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:02:00,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1272116248] [2022-11-26 00:02:00,296 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 00:02:00,296 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:02:00,296 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:02:00,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:02:00,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 13] total 17 [2022-11-26 00:02:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160494713] [2022-11-26 00:02:00,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:02:00,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:02:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:02:00,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:02:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:02:00,302 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) [2022-11-26 00:02:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:02:00,479 INFO L93 Difference]: Finished difference Result 77 states and 129 transitions. [2022-11-26 00:02:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:02:00,480 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 [2022-11-26 00:02:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:02:00,487 INFO L225 Difference]: With dead ends: 77 [2022-11-26 00:02:00,487 INFO L226 Difference]: Without dead ends: 60 [2022-11-26 00:02:00,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 228 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:02:00,492 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:02:00,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:02:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-26 00:02:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2022-11-26 00:02:00,515 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) [2022-11-26 00:02:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-11-26 00:02:00,516 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 119 [2022-11-26 00:02:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:02:00,517 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-11-26 00:02:00,517 INFO L496 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) [2022-11-26 00:02:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-11-26 00:02:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-26 00:02:00,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:02:00,519 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:02:00,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:02:00,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:02:00,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:02:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:02:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash -82417497, now seen corresponding path program 4 times [2022-11-26 00:02:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:02:00,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627781090] [2022-11-26 00:02:00,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:02:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:02:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:02:00,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:02:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:02:00,808 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:02:00,808 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:02:00,809 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 00:02:00,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:02:00,814 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2022-11-26 00:02:00,822 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:02:00,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:02:00 BoogieIcfgContainer [2022-11-26 00:02:00,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:02:00,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:02:00,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:02:00,898 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:02:00,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:53" (3/4) ... [2022-11-26 00:02:00,901 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-26 00:02:00,952 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:02:00,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:02:00,953 INFO L158 Benchmark]: Toolchain (without parser) took 7751.50ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 82.8MB in the beginning and 56.4MB in the end (delta: 26.4MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2022-11-26 00:02:00,953 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 125.8MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:02:00,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.96ms. Allocated memory is still 125.8MB. Free memory was 82.4MB in the beginning and 72.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-26 00:02:00,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.02ms. Allocated memory is still 125.8MB. Free memory was 72.4MB in the beginning and 70.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:02:00,954 INFO L158 Benchmark]: Boogie Preprocessor took 28.54ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 69.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:02:00,955 INFO L158 Benchmark]: RCFGBuilder took 306.49ms. Allocated memory is still 125.8MB. Free memory was 69.9MB in the beginning and 60.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-26 00:02:00,955 INFO L158 Benchmark]: TraceAbstraction took 7048.71ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 59.4MB in the beginning and 60.6MB in the end (delta: -1.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2022-11-26 00:02:00,956 INFO L158 Benchmark]: Witness Printer took 54.86ms. Allocated memory is still 165.7MB. Free memory was 60.6MB in the beginning and 56.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:02:00,957 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.25ms. Allocated memory is still 125.8MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.96ms. Allocated memory is still 125.8MB. Free memory was 82.4MB in the beginning and 72.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.02ms. Allocated memory is still 125.8MB. Free memory was 72.4MB in the beginning and 70.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.54ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 69.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.49ms. Allocated memory is still 125.8MB. Free memory was 69.9MB in the beginning and 60.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7048.71ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 59.4MB in the beginning and 60.6MB in the end (delta: -1.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Witness Printer took 54.86ms. Allocated memory is still 165.7MB. Free memory was 60.6MB in the beginning and 56.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 535 IncrementalHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 85 mSDtfsCounter, 535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 566 SyntacticMatches, 13 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s 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, 3.8s InterpolantComputationTime, 712 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 887 ConstructedInterpolants, 0 QuantifiedInterpolants, 1619 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! [2022-11-26 00:02:00,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e91b209a-a69e-44e1-896f-d7db99196b98/bin/utaipan-ByfvJB40ur/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