./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE --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 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-24 10:22:34,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 10:22:34,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 10:22:34,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 10:22:34,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 10:22:34,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 10:22:34,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 10:22:34,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 10:22:34,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 10:22:34,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 10:22:34,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 10:22:34,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 10:22:34,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 10:22:34,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 10:22:34,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 10:22:34,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 10:22:34,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 10:22:34,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 10:22:34,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 10:22:34,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 10:22:34,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 10:22:34,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 10:22:34,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 10:22:34,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 10:22:34,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 10:22:34,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 10:22:34,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 10:22:34,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 10:22:34,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 10:22:34,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 10:22:34,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 10:22:34,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 10:22:34,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 10:22:34,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 10:22:34,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 10:22:34,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 10:22:34,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 10:22:34,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 10:22:34,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 10:22:34,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 10:22:34,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 10:22:34,516 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-24 10:22:34,540 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 10:22:34,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 10:22:34,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 10:22:34,542 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 10:22:34,542 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 10:22:34,542 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 10:22:34,542 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 10:22:34,543 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 10:22:34,543 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 10:22:34,543 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 10:22:34,543 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 10:22:34,543 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 10:22:34,544 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 10:22:34,544 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 10:22:34,544 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 10:22:34,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 10:22:34,545 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 10:22:34,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 10:22:34,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 10:22:34,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 10:22:34,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-24 10:22:34,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 10:22:34,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-24 10:22:34,547 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 10:22:34,547 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 10:22:34,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-24 10:22:34,547 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 10:22:34,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-24 10:22:34,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 10:22:34,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 10:22:34,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:22:34,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 10:22:34,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 10:22:34,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-24 10:22:34,549 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 10:22:34,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 10:22:34,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-24 10:22:34,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 10:22:34,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 10:22:34,550 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/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_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE 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 -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2021-10-24 10:22:34,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 10:22:34,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 10:22:34,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 10:22:34,859 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 10:22:34,860 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 10:22:34,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/recursive/Fibonacci05.c [2021-10-24 10:22:34,972 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/data/2a1042532/f1ed37a7d4eb432384f86d3747bb7bea/FLAGd42660138 [2021-10-24 10:22:35,379 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 10:22:35,379 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/sv-benchmarks/c/recursive/Fibonacci05.c [2021-10-24 10:22:35,385 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/data/2a1042532/f1ed37a7d4eb432384f86d3747bb7bea/FLAGd42660138 [2021-10-24 10:22:35,796 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/data/2a1042532/f1ed37a7d4eb432384f86d3747bb7bea [2021-10-24 10:22:35,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 10:22:35,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 10:22:35,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 10:22:35,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 10:22:35,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 10:22:35,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:22:35" (1/1) ... [2021-10-24 10:22:35,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a9e3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:35, skipping insertion in model container [2021-10-24 10:22:35,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:22:35" (1/1) ... [2021-10-24 10:22:35,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 10:22:35,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 10:22:35,985 WARN L228 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_5e9fe254-260d-4004-a900-19a0f8807844/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-10-24 10:22:35,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:22:35,998 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 10:22:36,026 WARN L228 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_5e9fe254-260d-4004-a900-19a0f8807844/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-10-24 10:22:36,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:22:36,071 INFO L208 MainTranslator]: Completed translation [2021-10-24 10:22:36,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36 WrapperNode [2021-10-24 10:22:36,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 10:22:36,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 10:22:36,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 10:22:36,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 10:22:36,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 10:22:36,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 10:22:36,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 10:22:36,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 10:22:36,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 10:22:36,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 10:22:36,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 10:22:36,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 10:22:36,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (1/1) ... [2021-10-24 10:22:36,191 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:22:36,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:22:36,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 10:22:36,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 10:22:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-10-24 10:22:36,280 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-10-24 10:22:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 10:22:36,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 10:22:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-24 10:22:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 10:22:36,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 10:22:36,604 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-24 10:22:36,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:22:36 BoogieIcfgContainer [2021-10-24 10:22:36,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 10:22:36,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 10:22:36,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 10:22:36,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 10:22:36,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:22:35" (1/3) ... [2021-10-24 10:22:36,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fecffe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:22:36, skipping insertion in model container [2021-10-24 10:22:36,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:22:36" (2/3) ... [2021-10-24 10:22:36,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fecffe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:22:36, skipping insertion in model container [2021-10-24 10:22:36,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:22:36" (3/3) ... [2021-10-24 10:22:36,632 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-10-24 10:22:36,638 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 10:22:36,638 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-24 10:22:36,702 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 10:22:36,710 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-24 10:22:36,710 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-24 10:22:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-24 10:22:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-24 10:22:36,734 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:22:36,735 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:22:36,736 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:22:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:22:36,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2021-10-24 10:22:36,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:22:36,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348230953] [2021-10-24 10:22:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:36,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:22:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:22:36,955 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:22:36,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348230953] [2021-10-24 10:22:36,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348230953] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:22:36,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:22:36,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:22:36,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340253826] [2021-10-24 10:22:36,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:22:36,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:22:36,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:22:36,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:22:36,981 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-24 10:22:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:22:37,057 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-10-24 10:22:37,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:22:37,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-10-24 10:22:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:22:37,067 INFO L225 Difference]: With dead ends: 27 [2021-10-24 10:22:37,068 INFO L226 Difference]: Without dead ends: 17 [2021-10-24 10:22:37,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:22:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-10-24 10:22:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-24 10:22:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-24 10:22:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-24 10:22:37,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2021-10-24 10:22:37,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:22:37,113 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-24 10:22:37,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-24 10:22:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-24 10:22:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-24 10:22:37,116 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:22:37,116 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:22:37,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 10:22:37,117 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:22:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:22:37,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2021-10-24 10:22:37,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:22:37,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093823243] [2021-10-24 10:22:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:37,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:22:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:22:37,249 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:22:37,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093823243] [2021-10-24 10:22:37,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093823243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:22:37,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:22:37,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:22:37,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713701961] [2021-10-24 10:22:37,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:22:37,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:22:37,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:22:37,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:22:37,266 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-24 10:22:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:22:37,330 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-10-24 10:22:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:22:37,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-10-24 10:22:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:22:37,332 INFO L225 Difference]: With dead ends: 23 [2021-10-24 10:22:37,332 INFO L226 Difference]: Without dead ends: 19 [2021-10-24 10:22:37,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:22:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-24 10:22:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-10-24 10:22:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-24 10:22:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-24 10:22:37,340 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-10-24 10:22:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:22:37,340 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-24 10:22:37,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-24 10:22:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-24 10:22:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-24 10:22:37,342 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:22:37,342 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:22:37,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 10:22:37,343 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:22:37,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:22:37,343 INFO L82 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2021-10-24 10:22:37,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:22:37,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870404124] [2021-10-24 10:22:37,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:37,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:22:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:22:37,419 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:22:37,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870404124] [2021-10-24 10:22:37,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870404124] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:22:37,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350356912] [2021-10-24 10:22:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:37,420 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:22:37,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:22:37,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:22:37,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-24 10:22:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:37,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-24 10:22:37,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:22:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 10:22:37,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:22:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-24 10:22:37,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350356912] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 10:22:37,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [466480444] [2021-10-24 10:22:37,891 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-24 10:22:37,892 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 10:22:37,897 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 10:22:37,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 10:22:37,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2021-10-24 10:22:37,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523456186] [2021-10-24 10:22:37,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-24 10:22:37,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:22:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-24 10:22:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-24 10:22:37,902 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-10-24 10:22:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:22:38,034 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2021-10-24 10:22:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-24 10:22:38,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2021-10-24 10:22:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:22:38,038 INFO L225 Difference]: With dead ends: 41 [2021-10-24 10:22:38,038 INFO L226 Difference]: Without dead ends: 24 [2021-10-24 10:22:38,042 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 113.8ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-10-24 10:22:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-24 10:22:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-24 10:22:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-10-24 10:22:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-10-24 10:22:38,063 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 22 [2021-10-24 10:22:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:22:38,064 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-10-24 10:22:38,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-10-24 10:22:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-10-24 10:22:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-24 10:22:38,071 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:22:38,071 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-10-24 10:22:38,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-24 10:22:38,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:22:38,297 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:22:38,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:22:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash 271867855, now seen corresponding path program 1 times [2021-10-24 10:22:38,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:22:38,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891250014] [2021-10-24 10:22:38,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:38,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:22:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-24 10:22:38,428 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:22:38,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891250014] [2021-10-24 10:22:38,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891250014] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:22:38,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756681226] [2021-10-24 10:22:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:38,429 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:22:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:22:38,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:22:38,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-24 10:22:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:38,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-24 10:22:38,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:22:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-24 10:22:38,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:22:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-24 10:22:39,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756681226] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 10:22:39,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1300028699] [2021-10-24 10:22:39,135 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-24 10:22:39,135 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 10:22:39,136 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 10:22:39,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 10:22:39,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2021-10-24 10:22:39,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962691066] [2021-10-24 10:22:39,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-24 10:22:39,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:22:39,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-24 10:22:39,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-10-24 10:22:39,139 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2021-10-24 10:22:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:22:39,259 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. [2021-10-24 10:22:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-24 10:22:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 50 [2021-10-24 10:22:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:22:39,264 INFO L225 Difference]: With dead ends: 43 [2021-10-24 10:22:39,264 INFO L226 Difference]: Without dead ends: 37 [2021-10-24 10:22:39,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 93.7ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-10-24 10:22:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-10-24 10:22:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2021-10-24 10:22:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2021-10-24 10:22:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2021-10-24 10:22:39,279 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 50 [2021-10-24 10:22:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:22:39,280 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2021-10-24 10:22:39,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2021-10-24 10:22:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2021-10-24 10:22:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-10-24 10:22:39,288 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:22:39,288 INFO L512 BasicCegarLoop]: trace histogram [19, 19, 13, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2021-10-24 10:22:39,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-24 10:22:39,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:22:39,511 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:22:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:22:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1035226507, now seen corresponding path program 2 times [2021-10-24 10:22:39,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:22:39,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138015479] [2021-10-24 10:22:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:39,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:22:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 52 proven. 316 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2021-10-24 10:22:39,742 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:22:39,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138015479] [2021-10-24 10:22:39,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138015479] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:22:39,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973137507] [2021-10-24 10:22:39,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-24 10:22:39,748 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:22:39,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:22:39,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:22:39,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-24 10:22:39,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-10-24 10:22:39,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 10:22:39,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-24 10:22:39,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:22:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 476 proven. 13 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2021-10-24 10:22:40,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:22:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 267 proven. 60 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-10-24 10:22:41,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973137507] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 10:22:41,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [73449426] [2021-10-24 10:22:41,119 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-24 10:22:41,119 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 10:22:41,119 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 10:22:41,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 10:22:41,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2021-10-24 10:22:41,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414842903] [2021-10-24 10:22:41,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-24 10:22:41,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:22:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-24 10:22:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-10-24 10:22:41,123 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 11 states have call successors, (15), 2 states have call predecessors, (15), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) [2021-10-24 10:22:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:22:41,576 INFO L93 Difference]: Finished difference Result 86 states and 173 transitions. [2021-10-24 10:22:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-24 10:22:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 11 states have call successors, (15), 2 states have call predecessors, (15), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) Word has length 130 [2021-10-24 10:22:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:22:41,585 INFO L225 Difference]: With dead ends: 86 [2021-10-24 10:22:41,585 INFO L226 Difference]: Without dead ends: 54 [2021-10-24 10:22:41,594 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 313.3ms TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2021-10-24 10:22:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-10-24 10:22:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-10-24 10:22:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2021-10-24 10:22:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2021-10-24 10:22:41,614 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 130 [2021-10-24 10:22:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:22:41,617 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2021-10-24 10:22:41,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 11 states have call successors, (15), 2 states have call predecessors, (15), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) [2021-10-24 10:22:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2021-10-24 10:22:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-10-24 10:22:41,634 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:22:41,634 INFO L512 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2021-10-24 10:22:41,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-24 10:22:41,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:22:41,850 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:22:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:22:41,850 INFO L82 PathProgramCache]: Analyzing trace with hash -454540380, now seen corresponding path program 3 times [2021-10-24 10:22:41,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:22:41,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515894387] [2021-10-24 10:22:41,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:41,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:22:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-24 10:22:42,073 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:22:42,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515894387] [2021-10-24 10:22:42,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515894387] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:22:42,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861300231] [2021-10-24 10:22:42,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-24 10:22:42,074 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:22:42,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:22:42,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:22:42,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-24 10:22:42,338 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-24 10:22:42,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 10:22:42,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-24 10:22:42,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:22:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-24 10:22:42,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:22:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2021-10-24 10:22:44,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861300231] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 10:22:44,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1810811387] [2021-10-24 10:22:44,461 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-24 10:22:44,462 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 10:22:44,462 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 10:22:44,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 10:22:44,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2021-10-24 10:22:44,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016995037] [2021-10-24 10:22:44,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-24 10:22:44,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:22:44,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-24 10:22:44,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-10-24 10:22:44,466 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (20), 9 states have call predecessors, (20), 13 states have call successors, (20) [2021-10-24 10:22:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:22:44,704 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2021-10-24 10:22:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-24 10:22:44,705 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (20), 9 states have call predecessors, (20), 13 states have call successors, (20) Word has length 173 [2021-10-24 10:22:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:22:44,713 INFO L225 Difference]: With dead ends: 70 [2021-10-24 10:22:44,713 INFO L226 Difference]: Without dead ends: 64 [2021-10-24 10:22:44,714 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 180.9ms TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2021-10-24 10:22:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-24 10:22:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-24 10:22:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 42 states have internal predecessors, (47), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (43), 15 states have call predecessors, (43), 11 states have call successors, (43) [2021-10-24 10:22:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 101 transitions. [2021-10-24 10:22:44,746 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 101 transitions. Word has length 173 [2021-10-24 10:22:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:22:44,749 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 101 transitions. [2021-10-24 10:22:44,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (20), 9 states have call predecessors, (20), 13 states have call successors, (20) [2021-10-24 10:22:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 101 transitions. [2021-10-24 10:22:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2021-10-24 10:22:44,765 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:22:44,766 INFO L512 BasicCegarLoop]: trace histogram [85, 85, 69, 42, 42, 42, 42, 42, 42, 42, 27, 16, 1, 1, 1, 1, 1, 1] [2021-10-24 10:22:44,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-24 10:22:44,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-24 10:22:44,981 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:22:44,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:22:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash 268512456, now seen corresponding path program 4 times [2021-10-24 10:22:44,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:22:44,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849725694] [2021-10-24 10:22:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:44,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:22:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20070 backedges. 1155 proven. 3628 refuted. 0 times theorem prover too weak. 15287 trivial. 0 not checked. [2021-10-24 10:22:45,483 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:22:45,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849725694] [2021-10-24 10:22:45,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849725694] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:22:45,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781405499] [2021-10-24 10:22:45,488 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-24 10:22:45,488 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:22:45,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:22:45,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:22:45,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-24 10:22:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:46,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 26 conjunts are in the unsatisfiable core [2021-10-24 10:22:46,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:22:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 20070 backedges. 9532 proven. 2375 refuted. 0 times theorem prover too weak. 8163 trivial. 0 not checked. [2021-10-24 10:22:47,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:22:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 20070 backedges. 1322 proven. 4180 refuted. 0 times theorem prover too weak. 14568 trivial. 0 not checked. [2021-10-24 10:22:52,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781405499] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 10:22:52,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1271913879] [2021-10-24 10:22:52,397 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-24 10:22:52,397 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 10:22:52,397 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 10:22:52,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 10:22:52,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 27] total 32 [2021-10-24 10:22:52,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119123504] [2021-10-24 10:22:52,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-24 10:22:52,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:22:52,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-24 10:22:52,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2021-10-24 10:22:52,404 INFO L87 Difference]: Start difference. First operand 64 states and 101 transitions. Second operand has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) [2021-10-24 10:22:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:22:53,342 INFO L93 Difference]: Finished difference Result 165 states and 343 transitions. [2021-10-24 10:22:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-24 10:22:53,342 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) Word has length 582 [2021-10-24 10:22:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:22:53,345 INFO L225 Difference]: With dead ends: 165 [2021-10-24 10:22:53,345 INFO L226 Difference]: Without dead ends: 105 [2021-10-24 10:22:53,348 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1213 GetRequests, 1155 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 719.0ms TimeCoverageRelationStatistics Valid=824, Invalid=2482, Unknown=0, NotChecked=0, Total=3306 [2021-10-24 10:22:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-10-24 10:22:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2021-10-24 10:22:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.044776119402985) internal successors, (70), 64 states have internal predecessors, (70), 17 states have call successors, (17), 14 states have call predecessors, (17), 9 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2021-10-24 10:22:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2021-10-24 10:22:53,377 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 582 [2021-10-24 10:22:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:22:53,383 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2021-10-24 10:22:53,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) [2021-10-24 10:22:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2021-10-24 10:22:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2021-10-24 10:22:53,407 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:22:53,408 INFO L512 BasicCegarLoop]: trace histogram [97, 97, 78, 48, 48, 48, 48, 48, 48, 48, 30, 19, 1, 1, 1, 1, 1, 1] [2021-10-24 10:22:53,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-24 10:22:53,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-24 10:22:53,621 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:22:53,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:22:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1312747780, now seen corresponding path program 5 times [2021-10-24 10:22:53,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:22:53,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397369576] [2021-10-24 10:22:53,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:22:53,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:22:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:22:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 2015 proven. 4150 refuted. 0 times theorem prover too weak. 19974 trivial. 0 not checked. [2021-10-24 10:22:54,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:22:54,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397369576] [2021-10-24 10:22:54,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397369576] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 10:22:54,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302166340] [2021-10-24 10:22:54,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-24 10:22:54,206 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:22:54,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:22:54,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 10:22:54,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-24 10:22:55,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2021-10-24 10:22:55,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-24 10:22:55,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-24 10:22:55,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:22:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3458 proven. 339 refuted. 0 times theorem prover too weak. 22342 trivial. 0 not checked. [2021-10-24 10:22:56,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:23:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3458 proven. 360 refuted. 0 times theorem prover too weak. 22321 trivial. 0 not checked. [2021-10-24 10:23:00,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302166340] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-24 10:23:00,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1034062251] [2021-10-24 10:23:00,159 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-24 10:23:00,159 INFO L166 IcfgInterpreter]: Building call graph [2021-10-24 10:23:00,159 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-24 10:23:00,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-24 10:23:00,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 17] total 30 [2021-10-24 10:23:00,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871329585] [2021-10-24 10:23:00,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-24 10:23:00,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:23:00,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-24 10:23:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2021-10-24 10:23:00,165 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (45), 22 states have call predecessors, (45), 21 states have call successors, (45) [2021-10-24 10:23:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:23:01,164 INFO L93 Difference]: Finished difference Result 221 states and 355 transitions. [2021-10-24 10:23:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-24 10:23:01,165 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (45), 22 states have call predecessors, (45), 21 states have call successors, (45) Word has length 663 [2021-10-24 10:23:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:23:01,168 INFO L225 Difference]: With dead ends: 221 [2021-10-24 10:23:01,169 INFO L226 Difference]: Without dead ends: 131 [2021-10-24 10:23:01,171 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1385 GetRequests, 1322 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 808.2ms TimeCoverageRelationStatistics Valid=841, Invalid=2941, Unknown=0, NotChecked=0, Total=3782 [2021-10-24 10:23:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-24 10:23:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2021-10-24 10:23:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.05) internal successors, (84), 77 states have internal predecessors, (84), 22 states have call successors, (22), 18 states have call predecessors, (22), 9 states have return successors, (46), 16 states have call predecessors, (46), 22 states have call successors, (46) [2021-10-24 10:23:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2021-10-24 10:23:01,188 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 152 transitions. Word has length 663 [2021-10-24 10:23:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:23:01,189 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 152 transitions. [2021-10-24 10:23:01,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (45), 22 states have call predecessors, (45), 21 states have call successors, (45) [2021-10-24 10:23:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2021-10-24 10:23:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2021-10-24 10:23:01,193 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:23:01,193 INFO L512 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2021-10-24 10:23:01,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-24 10:23:01,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 10:23:01,408 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 10:23:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:23:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2068824531, now seen corresponding path program 6 times [2021-10-24 10:23:01,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:23:01,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49972732] [2021-10-24 10:23:01,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:23:01,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:23:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 10:23:01,542 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-24 10:23:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 10:23:01,832 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-24 10:23:01,832 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-24 10:23:01,833 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:23:01,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-24 10:23:01,845 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 10:23:02,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:23:02 BoogieIcfgContainer [2021-10-24 10:23:02,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 10:23:02,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 10:23:02,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 10:23:02,070 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 10:23:02,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:22:36" (3/4) ... [2021-10-24 10:23:02,073 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-24 10:23:02,249 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/witness.graphml [2021-10-24 10:23:02,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 10:23:02,251 INFO L168 Benchmark]: Toolchain (without parser) took 26449.04 ms. Allocated memory was 107.0 MB in the beginning and 232.8 MB in the end (delta: 125.8 MB). Free memory was 72.7 MB in the beginning and 77.8 MB in the end (delta: -5.1 MB). Peak memory consumption was 121.2 MB. Max. memory is 16.1 GB. [2021-10-24 10:23:02,252 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 81.8 MB. Free memory is still 37.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:23:02,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.07 ms. Allocated memory is still 107.0 MB. Free memory was 72.5 MB in the beginning and 84.1 MB in the end (delta: -11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-24 10:23:02,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.43 ms. Allocated memory is still 107.0 MB. Free memory was 84.1 MB in the beginning and 82.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:23:02,253 INFO L168 Benchmark]: Boogie Preprocessor took 44.49 ms. Allocated memory is still 107.0 MB. Free memory was 82.7 MB in the beginning and 81.9 MB in the end (delta: 786.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:23:02,254 INFO L168 Benchmark]: RCFGBuilder took 429.93 ms. Allocated memory is still 107.0 MB. Free memory was 81.9 MB in the beginning and 71.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-24 10:23:02,254 INFO L168 Benchmark]: TraceAbstraction took 25459.47 ms. Allocated memory was 107.0 MB in the beginning and 232.8 MB in the end (delta: 125.8 MB). Free memory was 71.4 MB in the beginning and 99.1 MB in the end (delta: -27.7 MB). Peak memory consumption was 101.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:23:02,254 INFO L168 Benchmark]: Witness Printer took 179.82 ms. Allocated memory is still 232.8 MB. Free memory was 98.1 MB in the beginning and 77.8 MB in the end (delta: 20.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-24 10:23:02,256 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.28 ms. Allocated memory is still 81.8 MB. Free memory is still 37.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 269.07 ms. Allocated memory is still 107.0 MB. Free memory was 72.5 MB in the beginning and 84.1 MB in the end (delta: -11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.43 ms. Allocated memory is still 107.0 MB. Free memory was 84.1 MB in the beginning and 82.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.49 ms. Allocated memory is still 107.0 MB. Free memory was 82.7 MB in the beginning and 81.9 MB in the end (delta: 786.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 429.93 ms. Allocated memory is still 107.0 MB. Free memory was 81.9 MB in the beginning and 71.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25459.47 ms. Allocated memory was 107.0 MB in the beginning and 232.8 MB in the end (delta: 125.8 MB). Free memory was 71.4 MB in the beginning and 99.1 MB in the end (delta: -27.7 MB). Peak memory consumption was 101.1 MB. Max. memory is 16.1 GB. * Witness Printer took 179.82 ms. Allocated memory is still 232.8 MB. Free memory was 98.1 MB in the beginning and 77.8 MB in the end (delta: 20.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25140.3ms, OverallIterations: 9, TraceHistogramMax: 97, EmptinessCheckTime: 80.1ms, AutomataDifference: 3111.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 140 SDtfs, 871 SDslu, 522 SDs, 0 SdLazy, 1398 SolverSat, 1183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1205.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3431 GetRequests, 3217 SyntacticMatches, 7 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1814 ImplicationChecksByTransitivity, 2272.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=8, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 162.7ms AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 185.6ms SsaConstructionTime, 1178.2ms SatisfiabilityAnalysisTime, 16955.0ms InterpolantComputationTime, 3718 NumberOfCodeBlocks, 3424 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 4859 ConstructedInterpolants, 0 QuantifiedInterpolants, 6811 SizeOfPredicates, 33 NumberOfNonLiveVariables, 3135 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 129434/146661 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-24 10:23:02,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9fe254-260d-4004-a900-19a0f8807844/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...