./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99889f5d790024002a8c8a36b020b427b7a21ac2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.0-7b2dab5 [2020-12-09 18:09:25,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 18:09:25,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 18:09:25,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 18:09:25,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 18:09:25,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 18:09:25,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 18:09:25,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 18:09:25,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 18:09:25,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 18:09:25,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 18:09:25,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 18:09:25,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 18:09:25,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 18:09:25,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 18:09:25,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 18:09:25,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 18:09:25,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 18:09:25,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 18:09:25,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 18:09:25,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 18:09:25,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 18:09:25,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 18:09:25,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 18:09:25,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 18:09:25,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 18:09:25,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 18:09:25,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 18:09:25,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 18:09:25,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 18:09:25,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 18:09:25,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 18:09:25,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 18:09:25,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 18:09:25,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 18:09:25,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 18:09:25,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 18:09:25,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 18:09:25,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 18:09:25,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 18:09:25,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 18:09:25,490 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 18:09:25,512 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 18:09:25,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 18:09:25,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 18:09:25,513 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 18:09:25,513 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 18:09:25,514 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 18:09:25,514 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 18:09:25,514 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 18:09:25,514 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 18:09:25,514 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 18:09:25,514 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 18:09:25,514 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 18:09:25,514 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 18:09:25,515 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 18:09:25,515 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 18:09:25,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 18:09:25,515 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 18:09:25,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 18:09:25,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 18:09:25,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 18:09:25,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 18:09:25,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 18:09:25,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 18:09:25,516 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 18:09:25,516 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 18:09:25,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 18:09:25,517 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 18:09:25,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 18:09:25,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 18:09:25,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 18:09:25,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:09:25,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 18:09:25,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 18:09:25,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 18:09:25,518 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 18:09:25,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 18:09:25,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 18:09:25,518 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 18:09:25,518 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 18:09:25,518 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99889f5d790024002a8c8a36b020b427b7a21ac2 [2020-12-09 18:09:25,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 18:09:25,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 18:09:25,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 18:09:25,735 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 18:09:25,735 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 18:09:25,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2020-12-09 18:09:25,777 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/data/48881d6bb/ee8d7a46a1294bfcac92d8d8bc419ba0/FLAGec529f91d [2020-12-09 18:09:26,145 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 18:09:26,145 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2020-12-09 18:09:26,151 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/data/48881d6bb/ee8d7a46a1294bfcac92d8d8bc419ba0/FLAGec529f91d [2020-12-09 18:09:26,161 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/data/48881d6bb/ee8d7a46a1294bfcac92d8d8bc419ba0 [2020-12-09 18:09:26,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 18:09:26,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 18:09:26,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 18:09:26,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 18:09:26,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 18:09:26,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1521b46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26, skipping insertion in model container [2020-12-09 18:09:26,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 18:09:26,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 18:09:26,287 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2020-12-09 18:09:26,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:09:26,297 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 18:09:26,309 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2020-12-09 18:09:26,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:09:26,319 INFO L208 MainTranslator]: Completed translation [2020-12-09 18:09:26,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26 WrapperNode [2020-12-09 18:09:26,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 18:09:26,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 18:09:26,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 18:09:26,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 18:09:26,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 18:09:26,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 18:09:26,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 18:09:26,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 18:09:26,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... [2020-12-09 18:09:26,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 18:09:26,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 18:09:26,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 18:09:26,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 18:09:26,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:09:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 18:09:26,412 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-12-09 18:09:26,412 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-12-09 18:09:26,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 18:09:26,412 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-12-09 18:09:26,412 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-12-09 18:09:26,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 18:09:26,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 18:09:26,567 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 18:09:26,568 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 18:09:26,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:09:26 BoogieIcfgContainer [2020-12-09 18:09:26,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 18:09:26,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 18:09:26,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 18:09:26,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 18:09:26,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:09:26" (1/3) ... [2020-12-09 18:09:26,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a14c509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:09:26, skipping insertion in model container [2020-12-09 18:09:26,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:09:26" (2/3) ... [2020-12-09 18:09:26,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a14c509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:09:26, skipping insertion in model container [2020-12-09 18:09:26,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:09:26" (3/3) ... [2020-12-09 18:09:26,575 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2020-12-09 18:09:26,585 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 18:09:26,587 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 18:09:26,595 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 18:09:26,611 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 18:09:26,611 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 18:09:26,611 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 18:09:26,611 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 18:09:26,611 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 18:09:26,611 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 18:09:26,612 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 18:09:26,612 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 18:09:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-12-09 18:09:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 18:09:26,625 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:26,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:26,626 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2020-12-09 18:09:26,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:26,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854139848] [2020-12-09 18:09:26,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:09:26,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854139848] [2020-12-09 18:09:26,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:09:26,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 18:09:26,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317790439] [2020-12-09 18:09:26,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 18:09:26,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:26,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 18:09:26,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:09:26,779 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2020-12-09 18:09:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:26,819 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-12-09 18:09:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:09:26,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 18:09:26,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:26,830 INFO L225 Difference]: With dead ends: 36 [2020-12-09 18:09:26,830 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 18:09:26,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:09:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 18:09:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-09 18:09:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 18:09:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-12-09 18:09:26,870 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2020-12-09 18:09:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:26,870 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-12-09 18:09:26,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 18:09:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-12-09 18:09:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 18:09:26,871 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:26,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:26,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 18:09:26,872 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:26,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2020-12-09 18:09:26,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:26,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530799952] [2020-12-09 18:09:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:09:26,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530799952] [2020-12-09 18:09:26,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:09:26,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 18:09:26,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693729695] [2020-12-09 18:09:26,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 18:09:26,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:26,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 18:09:26,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:09:26,917 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2020-12-09 18:09:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:26,932 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-12-09 18:09:26,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:09:26,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 18:09:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:26,934 INFO L225 Difference]: With dead ends: 32 [2020-12-09 18:09:26,934 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 18:09:26,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:09:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 18:09:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-12-09 18:09:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 18:09:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-12-09 18:09:26,939 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2020-12-09 18:09:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:26,940 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-12-09 18:09:26,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 18:09:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-12-09 18:09:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 18:09:26,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:26,941 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:26,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 18:09:26,941 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:26,942 INFO L82 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2020-12-09 18:09:26,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:26,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373900095] [2020-12-09 18:09:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 18:09:27,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373900095] [2020-12-09 18:09:27,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171662600] [2020-12-09 18:09:27,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:27,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 18:09:27,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 18:09:27,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 18:09:27,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [191678030] [2020-12-09 18:09:27,303 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2020-12-09 18:09:27,303 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:27,306 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:09:27,310 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:09:27,310 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:09:27,473 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:27,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:27,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2020-12-09 18:09:27,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527139704] [2020-12-09 18:09:27,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 18:09:27,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:27,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 18:09:27,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-09 18:09:27,476 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2020-12-09 18:09:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:27,592 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-12-09 18:09:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 18:09:27,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-09 18:09:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:27,593 INFO L225 Difference]: With dead ends: 54 [2020-12-09 18:09:27,593 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 18:09:27,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-12-09 18:09:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 18:09:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-12-09 18:09:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 18:09:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-12-09 18:09:27,599 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2020-12-09 18:09:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:27,599 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-12-09 18:09:27,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 18:09:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-12-09 18:09:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 18:09:27,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:27,600 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:27,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-09 18:09:27,802 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:27,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2020-12-09 18:09:27,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:27,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073520446] [2020-12-09 18:09:27,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 18:09:27,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073520446] [2020-12-09 18:09:27,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720380736] [2020-12-09 18:09:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:27,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 18:09:27,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 18:09:28,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 18:09:28,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1337299698] [2020-12-09 18:09:28,117 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 18:09:28,117 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:28,117 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:09:28,118 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:09:28,118 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:09:28,245 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:28,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:28,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2020-12-09 18:09:28,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100973845] [2020-12-09 18:09:28,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 18:09:28,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 18:09:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-09 18:09:28,247 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2020-12-09 18:09:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:28,315 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-12-09 18:09:28,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 18:09:28,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-12-09 18:09:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:28,316 INFO L225 Difference]: With dead ends: 39 [2020-12-09 18:09:28,316 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 18:09:28,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 18:09:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 18:09:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-12-09 18:09:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 18:09:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-12-09 18:09:28,322 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2020-12-09 18:09:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:28,322 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-12-09 18:09:28,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 18:09:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-12-09 18:09:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 18:09:28,324 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:28,324 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:28,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 18:09:28,526 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2020-12-09 18:09:28,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:28,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759695224] [2020-12-09 18:09:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 18:09:28,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759695224] [2020-12-09 18:09:28,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271566500] [2020-12-09 18:09:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:28,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 18:09:28,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 18:09:28,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:09:28,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2134497202] [2020-12-09 18:09:28,967 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:28,967 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:28,967 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:28,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:28,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2020-12-09 18:09:28,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982540767] [2020-12-09 18:09:28,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 18:09:28,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:28,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 18:09:28,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-12-09 18:09:28,969 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2020-12-09 18:09:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:29,105 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2020-12-09 18:09:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 18:09:29,105 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-12-09 18:09:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:29,106 INFO L225 Difference]: With dead ends: 66 [2020-12-09 18:09:29,106 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 18:09:29,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2020-12-09 18:09:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 18:09:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-09 18:09:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 18:09:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-12-09 18:09:29,112 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2020-12-09 18:09:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:29,113 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-12-09 18:09:29,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 18:09:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-12-09 18:09:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 18:09:29,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:29,114 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:29,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-09 18:09:29,314 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2020-12-09 18:09:29,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:29,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016849231] [2020-12-09 18:09:29,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 18:09:29,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016849231] [2020-12-09 18:09:29,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196008780] [2020-12-09 18:09:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:29,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 18:09:29,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 18:09:29,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 18:09:29,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [492978280] [2020-12-09 18:09:29,690 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:29,690 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:29,691 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:29,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:29,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2020-12-09 18:09:29,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508772521] [2020-12-09 18:09:29,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 18:09:29,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:29,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 18:09:29,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-12-09 18:09:29,693 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 18 states. [2020-12-09 18:09:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:30,008 INFO L93 Difference]: Finished difference Result 98 states and 158 transitions. [2020-12-09 18:09:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 18:09:30,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2020-12-09 18:09:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:30,011 INFO L225 Difference]: With dead ends: 98 [2020-12-09 18:09:30,011 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 18:09:30,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-12-09 18:09:30,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 18:09:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2020-12-09 18:09:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 18:09:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2020-12-09 18:09:30,022 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 36 [2020-12-09 18:09:30,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:30,022 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2020-12-09 18:09:30,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 18:09:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2020-12-09 18:09:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 18:09:30,024 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:30,024 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:30,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:30,226 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2020-12-09 18:09:30,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:30,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772664883] [2020-12-09 18:09:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 18:09:30,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772664883] [2020-12-09 18:09:30,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734366608] [2020-12-09 18:09:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:30,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 18:09:30,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-09 18:09:30,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-09 18:09:30,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [385438611] [2020-12-09 18:09:30,851 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:30,851 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:30,852 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:30,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:30,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2020-12-09 18:09:30,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121711260] [2020-12-09 18:09:30,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 18:09:30,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:30,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 18:09:30,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-12-09 18:09:30,854 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 17 states. [2020-12-09 18:09:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:31,010 INFO L93 Difference]: Finished difference Result 102 states and 193 transitions. [2020-12-09 18:09:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 18:09:31,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2020-12-09 18:09:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:31,012 INFO L225 Difference]: With dead ends: 102 [2020-12-09 18:09:31,012 INFO L226 Difference]: Without dead ends: 98 [2020-12-09 18:09:31,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2020-12-09 18:09:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-12-09 18:09:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2020-12-09 18:09:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 18:09:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2020-12-09 18:09:31,027 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 50 [2020-12-09 18:09:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:31,028 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2020-12-09 18:09:31,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 18:09:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2020-12-09 18:09:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-09 18:09:31,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:31,035 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:31,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-09 18:09:31,236 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:31,238 INFO L82 PathProgramCache]: Analyzing trace with hash -110138383, now seen corresponding path program 1 times [2020-12-09 18:09:31,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:31,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315006591] [2020-12-09 18:09:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 81 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-12-09 18:09:31,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315006591] [2020-12-09 18:09:31,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137487155] [2020-12-09 18:09:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:31,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 18:09:31,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2020-12-09 18:09:31,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 129 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2020-12-09 18:09:32,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [298701302] [2020-12-09 18:09:32,094 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:32,094 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:32,095 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:32,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:32,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2020-12-09 18:09:32,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420914459] [2020-12-09 18:09:32,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 18:09:32,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:32,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 18:09:32,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2020-12-09 18:09:32,096 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 23 states. [2020-12-09 18:09:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:32,626 INFO L93 Difference]: Finished difference Result 175 states and 367 transitions. [2020-12-09 18:09:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 18:09:32,627 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2020-12-09 18:09:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:32,629 INFO L225 Difference]: With dead ends: 175 [2020-12-09 18:09:32,629 INFO L226 Difference]: Without dead ends: 101 [2020-12-09 18:09:32,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 18:09:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-09 18:09:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2020-12-09 18:09:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-09 18:09:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2020-12-09 18:09:32,642 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 106 [2020-12-09 18:09:32,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:32,643 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2020-12-09 18:09:32,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 18:09:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2020-12-09 18:09:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-12-09 18:09:32,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:32,645 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 14, 13, 13, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:32,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:32,846 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:32,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:32,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1888157483, now seen corresponding path program 2 times [2020-12-09 18:09:32,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:32,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375536882] [2020-12-09 18:09:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 60 proven. 266 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2020-12-09 18:09:33,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375536882] [2020-12-09 18:09:33,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066523498] [2020-12-09 18:09:33,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:33,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 18:09:33,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:09:33,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 18:09:33,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 376 proven. 6 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2020-12-09 18:09:33,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 301 proven. 12 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2020-12-09 18:09:33,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629094208] [2020-12-09 18:09:33,796 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:33,796 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:33,797 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:33,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:33,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2020-12-09 18:09:33,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564376239] [2020-12-09 18:09:33,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 18:09:33,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:33,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 18:09:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-12-09 18:09:33,798 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand 18 states. [2020-12-09 18:09:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:34,120 INFO L93 Difference]: Finished difference Result 205 states and 314 transitions. [2020-12-09 18:09:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 18:09:34,120 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 212 [2020-12-09 18:09:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:34,122 INFO L225 Difference]: With dead ends: 205 [2020-12-09 18:09:34,122 INFO L226 Difference]: Without dead ends: 124 [2020-12-09 18:09:34,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 417 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2020-12-09 18:09:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-12-09 18:09:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2020-12-09 18:09:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-09 18:09:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2020-12-09 18:09:34,131 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 212 [2020-12-09 18:09:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:34,132 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2020-12-09 18:09:34,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 18:09:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2020-12-09 18:09:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-09 18:09:34,133 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:34,133 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 10, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:34,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-09 18:09:34,335 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:34,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash -225787115, now seen corresponding path program 1 times [2020-12-09 18:09:34,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:34,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042792765] [2020-12-09 18:09:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 67 proven. 171 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2020-12-09 18:09:34,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042792765] [2020-12-09 18:09:34,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437515275] [2020-12-09 18:09:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:34,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 18:09:34,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 30 proven. 250 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2020-12-09 18:09:34,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 30 proven. 266 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2020-12-09 18:09:35,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [32009925] [2020-12-09 18:09:35,637 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:35,637 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:35,637 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:35,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:35,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 25 [2020-12-09 18:09:35,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818658641] [2020-12-09 18:09:35,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 18:09:35,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:35,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 18:09:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2020-12-09 18:09:35,639 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand 25 states. [2020-12-09 18:09:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:36,234 INFO L93 Difference]: Finished difference Result 225 states and 391 transitions. [2020-12-09 18:09:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 18:09:36,234 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 160 [2020-12-09 18:09:36,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:36,235 INFO L225 Difference]: With dead ends: 225 [2020-12-09 18:09:36,235 INFO L226 Difference]: Without dead ends: 127 [2020-12-09 18:09:36,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2020-12-09 18:09:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-09 18:09:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2020-12-09 18:09:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-12-09 18:09:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2020-12-09 18:09:36,245 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 160 [2020-12-09 18:09:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:36,246 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2020-12-09 18:09:36,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 18:09:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2020-12-09 18:09:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-12-09 18:09:36,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:36,248 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:36,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-09 18:09:36,449 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:36,450 INFO L82 PathProgramCache]: Analyzing trace with hash -895030172, now seen corresponding path program 1 times [2020-12-09 18:09:36,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:36,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726082815] [2020-12-09 18:09:36,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 119 proven. 253 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2020-12-09 18:09:36,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726082815] [2020-12-09 18:09:36,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603585591] [2020-12-09 18:09:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:36,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 18:09:36,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 70 proven. 425 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2020-12-09 18:09:36,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 70 proven. 449 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2020-12-09 18:09:38,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2084817854] [2020-12-09 18:09:38,163 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:38,163 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:38,163 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:38,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:38,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 17] total 23 [2020-12-09 18:09:38,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767198091] [2020-12-09 18:09:38,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 18:09:38,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:38,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 18:09:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2020-12-09 18:09:38,165 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand 23 states. [2020-12-09 18:09:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:38,396 INFO L93 Difference]: Finished difference Result 137 states and 230 transitions. [2020-12-09 18:09:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 18:09:38,396 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 227 [2020-12-09 18:09:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:38,398 INFO L225 Difference]: With dead ends: 137 [2020-12-09 18:09:38,398 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 18:09:38,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2020-12-09 18:09:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 18:09:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2020-12-09 18:09:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-09 18:09:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 202 transitions. [2020-12-09 18:09:38,412 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 202 transitions. Word has length 227 [2020-12-09 18:09:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:38,413 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 202 transitions. [2020-12-09 18:09:38,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 18:09:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 202 transitions. [2020-12-09 18:09:38,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2020-12-09 18:09:38,426 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:38,427 INFO L422 BasicCegarLoop]: trace histogram [40, 40, 37, 37, 31, 30, 20, 20, 20, 20, 20, 20, 20, 18, 18, 18, 18, 18, 18, 18, 13, 10, 9, 7, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:38,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-12-09 18:09:38,627 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:38,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1813803180, now seen corresponding path program 2 times [2020-12-09 18:09:38,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:38,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703946636] [2020-12-09 18:09:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8056 backedges. 182 proven. 1345 refuted. 0 times theorem prover too weak. 6529 trivial. 0 not checked. [2020-12-09 18:09:38,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703946636] [2020-12-09 18:09:38,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549105510] [2020-12-09 18:09:38,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:39,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-09 18:09:39,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:09:39,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 18:09:39,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8056 backedges. 1136 proven. 31 refuted. 0 times theorem prover too weak. 6889 trivial. 0 not checked. [2020-12-09 18:09:39,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8056 backedges. 1136 proven. 32 refuted. 0 times theorem prover too weak. 6888 trivial. 0 not checked. [2020-12-09 18:09:40,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1794805788] [2020-12-09 18:09:40,917 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:40,918 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:40,918 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:40,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:40,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 26 [2020-12-09 18:09:40,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872227456] [2020-12-09 18:09:40,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-09 18:09:40,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:40,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-09 18:09:40,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2020-12-09 18:09:40,921 INFO L87 Difference]: Start difference. First operand 125 states and 202 transitions. Second operand 26 states. [2020-12-09 18:09:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:41,725 INFO L93 Difference]: Finished difference Result 322 states and 705 transitions. [2020-12-09 18:09:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-12-09 18:09:41,726 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 526 [2020-12-09 18:09:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:41,729 INFO L225 Difference]: With dead ends: 322 [2020-12-09 18:09:41,729 INFO L226 Difference]: Without dead ends: 206 [2020-12-09 18:09:41,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1098 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=458, Invalid=2512, Unknown=0, NotChecked=0, Total=2970 [2020-12-09 18:09:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-12-09 18:09:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 159. [2020-12-09 18:09:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-12-09 18:09:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 272 transitions. [2020-12-09 18:09:41,743 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 272 transitions. Word has length 526 [2020-12-09 18:09:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:41,743 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 272 transitions. [2020-12-09 18:09:41,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-09 18:09:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 272 transitions. [2020-12-09 18:09:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2020-12-09 18:09:41,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:41,748 INFO L422 BasicCegarLoop]: trace histogram [56, 56, 49, 49, 46, 44, 28, 28, 28, 28, 28, 28, 28, 24, 24, 24, 24, 24, 24, 24, 20, 18, 12, 3, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:41,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-12-09 18:09:41,949 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash 502507964, now seen corresponding path program 3 times [2020-12-09 18:09:41,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:41,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243118103] [2020-12-09 18:09:41,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15461 backedges. 424 proven. 1472 refuted. 0 times theorem prover too weak. 13565 trivial. 0 not checked. [2020-12-09 18:09:42,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243118103] [2020-12-09 18:09:42,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435542174] [2020-12-09 18:09:42,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:42,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 18:09:42,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:09:42,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 18:09:42,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15461 backedges. 5385 proven. 181 refuted. 0 times theorem prover too weak. 9895 trivial. 0 not checked. [2020-12-09 18:09:43,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15461 backedges. 474 proven. 2245 refuted. 0 times theorem prover too weak. 12742 trivial. 0 not checked. [2020-12-09 18:09:46,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [750110230] [2020-12-09 18:09:46,046 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:46,046 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:46,046 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:46,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:46,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 19] total 28 [2020-12-09 18:09:46,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715380263] [2020-12-09 18:09:46,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-09 18:09:46,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:46,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-09 18:09:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2020-12-09 18:09:46,049 INFO L87 Difference]: Start difference. First operand 159 states and 272 transitions. Second operand 28 states. [2020-12-09 18:09:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:47,001 INFO L93 Difference]: Finished difference Result 388 states and 795 transitions. [2020-12-09 18:09:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-12-09 18:09:47,002 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 723 [2020-12-09 18:09:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:47,004 INFO L225 Difference]: With dead ends: 388 [2020-12-09 18:09:47,004 INFO L226 Difference]: Without dead ends: 237 [2020-12-09 18:09:47,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1492 GetRequests, 1433 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=521, Invalid=2901, Unknown=0, NotChecked=0, Total=3422 [2020-12-09 18:09:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-12-09 18:09:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 194. [2020-12-09 18:09:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-12-09 18:09:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 317 transitions. [2020-12-09 18:09:47,018 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 317 transitions. Word has length 723 [2020-12-09 18:09:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:47,019 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 317 transitions. [2020-12-09 18:09:47,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-09 18:09:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 317 transitions. [2020-12-09 18:09:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2020-12-09 18:09:47,024 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:47,024 INFO L422 BasicCegarLoop]: trace histogram [64, 64, 55, 55, 49, 47, 32, 32, 32, 32, 32, 32, 32, 27, 27, 27, 27, 27, 27, 27, 22, 15, 15, 8, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:47,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2020-12-09 18:09:47,225 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash 558139955, now seen corresponding path program 4 times [2020-12-09 18:09:47,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:47,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331424176] [2020-12-09 18:09:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 19649 backedges. 626 proven. 1517 refuted. 0 times theorem prover too weak. 17506 trivial. 0 not checked. [2020-12-09 18:09:47,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331424176] [2020-12-09 18:09:47,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073578518] [2020-12-09 18:09:47,793 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:48,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 18:09:48,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 19649 backedges. 331 proven. 2413 refuted. 0 times theorem prover too weak. 16905 trivial. 0 not checked. [2020-12-09 18:09:48,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 19649 backedges. 331 proven. 2457 refuted. 0 times theorem prover too weak. 16861 trivial. 0 not checked. [2020-12-09 18:09:52,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [770423671] [2020-12-09 18:09:52,299 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:52,299 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:52,299 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:52,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:52,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 21] total 26 [2020-12-09 18:09:52,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171135908] [2020-12-09 18:09:52,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-09 18:09:52,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-09 18:09:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2020-12-09 18:09:52,302 INFO L87 Difference]: Start difference. First operand 194 states and 317 transitions. Second operand 26 states. [2020-12-09 18:09:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:09:52,593 INFO L93 Difference]: Finished difference Result 247 states and 480 transitions. [2020-12-09 18:09:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 18:09:52,593 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 813 [2020-12-09 18:09:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:09:52,597 INFO L225 Difference]: With dead ends: 247 [2020-12-09 18:09:52,597 INFO L226 Difference]: Without dead ends: 243 [2020-12-09 18:09:52,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1653 GetRequests, 1615 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=283, Invalid=1123, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 18:09:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-12-09 18:09:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 230. [2020-12-09 18:09:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-09 18:09:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 426 transitions. [2020-12-09 18:09:52,612 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 426 transitions. Word has length 813 [2020-12-09 18:09:52,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:09:52,612 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 426 transitions. [2020-12-09 18:09:52,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-09 18:09:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 426 transitions. [2020-12-09 18:09:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1303 [2020-12-09 18:09:52,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:09:52,624 INFO L422 BasicCegarLoop]: trace histogram [102, 102, 89, 89, 77, 76, 51, 51, 51, 51, 51, 51, 51, 44, 44, 44, 44, 44, 44, 44, 32, 26, 26, 12, 1, 1, 1, 1, 1, 1] [2020-12-09 18:09:52,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:52,825 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:09:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:09:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash 692902961, now seen corresponding path program 5 times [2020-12-09 18:09:52,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:09:52,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654887517] [2020-12-09 18:09:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:09:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:09:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 50928 backedges. 579 proven. 3492 refuted. 0 times theorem prover too weak. 46857 trivial. 0 not checked. [2020-12-09 18:09:53,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654887517] [2020-12-09 18:09:53,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169457745] [2020-12-09 18:09:53,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:09:54,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-09 18:09:54,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:09:54,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 18:09:54,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:09:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 50928 backedges. 3281 proven. 33 refuted. 0 times theorem prover too weak. 47614 trivial. 0 not checked. [2020-12-09 18:09:55,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:09:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 50928 backedges. 3281 proven. 35 refuted. 0 times theorem prover too weak. 47612 trivial. 0 not checked. [2020-12-09 18:09:59,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [772151868] [2020-12-09 18:09:59,407 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:09:59,407 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:09:59,407 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:09:59,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:09:59,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2020-12-09 18:09:59,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294402164] [2020-12-09 18:09:59,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 18:09:59,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:09:59,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 18:09:59,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2020-12-09 18:09:59,411 INFO L87 Difference]: Start difference. First operand 230 states and 426 transitions. Second operand 24 states. [2020-12-09 18:10:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:00,151 INFO L93 Difference]: Finished difference Result 528 states and 1179 transitions. [2020-12-09 18:10:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-09 18:10:00,151 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1302 [2020-12-09 18:10:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:00,155 INFO L225 Difference]: With dead ends: 528 [2020-12-09 18:10:00,155 INFO L226 Difference]: Without dead ends: 312 [2020-12-09 18:10:00,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2647 GetRequests, 2597 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2020-12-09 18:10:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-12-09 18:10:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2020-12-09 18:10:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2020-12-09 18:10:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 543 transitions. [2020-12-09 18:10:00,176 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 543 transitions. Word has length 1302 [2020-12-09 18:10:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:00,176 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 543 transitions. [2020-12-09 18:10:00,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 18:10:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 543 transitions. [2020-12-09 18:10:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1849 [2020-12-09 18:10:00,196 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:00,197 INFO L422 BasicCegarLoop]: trace histogram [138, 138, 133, 133, 110, 109, 69, 69, 69, 69, 69, 69, 69, 66, 66, 66, 66, 66, 66, 66, 44, 40, 28, 24, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:00,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2020-12-09 18:10:00,398 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1548259413, now seen corresponding path program 6 times [2020-12-09 18:10:00,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:00,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786327346] [2020-12-09 18:10:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 976 proven. 4871 refuted. 0 times theorem prover too weak. 96922 trivial. 0 not checked. [2020-12-09 18:10:02,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786327346] [2020-12-09 18:10:02,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753702442] [2020-12-09 18:10:02,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:10:02,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 18:10:02,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:10:02,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 18:10:02,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 24224 proven. 427 refuted. 0 times theorem prover too weak. 78118 trivial. 0 not checked. [2020-12-09 18:10:05,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:10:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 1051 proven. 7845 refuted. 0 times theorem prover too weak. 93873 trivial. 0 not checked. [2020-12-09 18:10:12,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [876491659] [2020-12-09 18:10:12,515 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:10:12,515 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:10:12,515 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:10:12,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:10:12,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 23] total 32 [2020-12-09 18:10:12,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129111321] [2020-12-09 18:10:12,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-09 18:10:12,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:12,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-09 18:10:12,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2020-12-09 18:10:12,519 INFO L87 Difference]: Start difference. First operand 285 states and 543 transitions. Second operand 32 states. [2020-12-09 18:10:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:13,676 INFO L93 Difference]: Finished difference Result 643 states and 1369 transitions. [2020-12-09 18:10:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-12-09 18:10:13,676 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1848 [2020-12-09 18:10:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:13,681 INFO L225 Difference]: With dead ends: 643 [2020-12-09 18:10:13,681 INFO L226 Difference]: Without dead ends: 370 [2020-12-09 18:10:13,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3751 GetRequests, 3681 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=698, Invalid=4132, Unknown=0, NotChecked=0, Total=4830 [2020-12-09 18:10:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-12-09 18:10:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 322. [2020-12-09 18:10:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-12-09 18:10:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 601 transitions. [2020-12-09 18:10:13,704 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 601 transitions. Word has length 1848 [2020-12-09 18:10:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:13,705 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 601 transitions. [2020-12-09 18:10:13,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-09 18:10:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 601 transitions. [2020-12-09 18:10:13,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1373 [2020-12-09 18:10:13,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:13,717 INFO L422 BasicCegarLoop]: trace histogram [102, 102, 99, 99, 82, 81, 51, 51, 51, 51, 51, 51, 51, 49, 49, 49, 49, 49, 49, 49, 33, 30, 20, 18, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:13,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:10:13,918 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1397024322, now seen corresponding path program 7 times [2020-12-09 18:10:13,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:13,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161177275] [2020-12-09 18:10:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 56373 backedges. 971 proven. 4039 refuted. 0 times theorem prover too weak. 51363 trivial. 0 not checked. [2020-12-09 18:10:15,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161177275] [2020-12-09 18:10:15,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304521961] [2020-12-09 18:10:15,148 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:10:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:15,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 3078 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 18:10:15,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 56373 backedges. 998 proven. 4364 refuted. 0 times theorem prover too weak. 51011 trivial. 0 not checked. [2020-12-09 18:10:17,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:10:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 56373 backedges. 1002 proven. 4412 refuted. 0 times theorem prover too weak. 50959 trivial. 0 not checked. [2020-12-09 18:10:23,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1474855642] [2020-12-09 18:10:23,068 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:10:23,068 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:10:23,068 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:10:23,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:10:23,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 23] total 28 [2020-12-09 18:10:23,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673770340] [2020-12-09 18:10:23,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-09 18:10:23,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:23,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-09 18:10:23,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2020-12-09 18:10:23,072 INFO L87 Difference]: Start difference. First operand 322 states and 601 transitions. Second operand 28 states. [2020-12-09 18:10:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:23,475 INFO L93 Difference]: Finished difference Result 387 states and 816 transitions. [2020-12-09 18:10:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 18:10:23,475 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1372 [2020-12-09 18:10:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:23,480 INFO L225 Difference]: With dead ends: 387 [2020-12-09 18:10:23,480 INFO L226 Difference]: Without dead ends: 330 [2020-12-09 18:10:23,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2775 GetRequests, 2737 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 18:10:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-12-09 18:10:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 307. [2020-12-09 18:10:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2020-12-09 18:10:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 511 transitions. [2020-12-09 18:10:23,499 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 511 transitions. Word has length 1372 [2020-12-09 18:10:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:23,500 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 511 transitions. [2020-12-09 18:10:23,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-09 18:10:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 511 transitions. [2020-12-09 18:10:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2020-12-09 18:10:23,508 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:23,508 INFO L422 BasicCegarLoop]: trace histogram [81, 81, 76, 76, 64, 63, 40, 40, 40, 40, 40, 40, 40, 38, 38, 38, 38, 38, 38, 38, 26, 23, 17, 13, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:23,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2020-12-09 18:10:23,709 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2032445914, now seen corresponding path program 8 times [2020-12-09 18:10:23,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:23,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329350825] [2020-12-09 18:10:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 34261 backedges. 1021 proven. 2282 refuted. 0 times theorem prover too weak. 30958 trivial. 0 not checked. [2020-12-09 18:10:24,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329350825] [2020-12-09 18:10:24,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336163193] [2020-12-09 18:10:24,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:10:24,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2020-12-09 18:10:24,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:10:24,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 18:10:24,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 34261 backedges. 11525 proven. 157 refuted. 0 times theorem prover too weak. 22579 trivial. 0 not checked. [2020-12-09 18:10:25,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:10:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 34261 backedges. 2431 proven. 594 refuted. 0 times theorem prover too weak. 31236 trivial. 0 not checked. [2020-12-09 18:10:29,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2105899644] [2020-12-09 18:10:29,227 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:10:29,227 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:10:29,227 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:10:29,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:10:29,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 26 [2020-12-09 18:10:29,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217473356] [2020-12-09 18:10:29,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-09 18:10:29,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:29,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-09 18:10:29,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2020-12-09 18:10:29,230 INFO L87 Difference]: Start difference. First operand 307 states and 511 transitions. Second operand 26 states. [2020-12-09 18:10:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:29,981 INFO L93 Difference]: Finished difference Result 787 states and 1415 transitions. [2020-12-09 18:10:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-12-09 18:10:29,982 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1072 [2020-12-09 18:10:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:29,987 INFO L225 Difference]: With dead ends: 787 [2020-12-09 18:10:29,987 INFO L226 Difference]: Without dead ends: 484 [2020-12-09 18:10:29,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2188 GetRequests, 2135 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=452, Invalid=2304, Unknown=0, NotChecked=0, Total=2756 [2020-12-09 18:10:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-12-09 18:10:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 375. [2020-12-09 18:10:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-12-09 18:10:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 659 transitions. [2020-12-09 18:10:30,013 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 659 transitions. Word has length 1072 [2020-12-09 18:10:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:30,013 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 659 transitions. [2020-12-09 18:10:30,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-09 18:10:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 659 transitions. [2020-12-09 18:10:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1795 [2020-12-09 18:10:30,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:30,033 INFO L422 BasicCegarLoop]: trace histogram [134, 134, 129, 129, 108, 105, 67, 67, 67, 67, 67, 67, 67, 64, 64, 64, 64, 64, 64, 64, 44, 38, 26, 24, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:30,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:10:30,234 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:30,234 INFO L82 PathProgramCache]: Analyzing trace with hash 523807569, now seen corresponding path program 9 times [2020-12-09 18:10:30,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:30,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731243458] [2020-12-09 18:10:30,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 96814 backedges. 1375 proven. 3815 refuted. 0 times theorem prover too weak. 91624 trivial. 0 not checked. [2020-12-09 18:10:32,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731243458] [2020-12-09 18:10:32,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717479557] [2020-12-09 18:10:32,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:10:32,576 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 18:10:32,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:10:32,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 3192 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 18:10:32,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 96814 backedges. 40331 proven. 1307 refuted. 0 times theorem prover too weak. 55176 trivial. 0 not checked. [2020-12-09 18:10:34,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:10:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 96814 backedges. 1629 proven. 8698 refuted. 0 times theorem prover too weak. 86487 trivial. 0 not checked. [2020-12-09 18:10:43,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2119081764] [2020-12-09 18:10:43,604 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:10:43,604 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:10:43,604 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:10:43,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:10:43,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 29] total 41 [2020-12-09 18:10:43,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341088471] [2020-12-09 18:10:43,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-09 18:10:43,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-09 18:10:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2020-12-09 18:10:43,609 INFO L87 Difference]: Start difference. First operand 375 states and 659 transitions. Second operand 41 states. [2020-12-09 18:10:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:45,243 INFO L93 Difference]: Finished difference Result 967 states and 1819 transitions. [2020-12-09 18:10:45,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-12-09 18:10:45,243 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1794 [2020-12-09 18:10:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:45,248 INFO L225 Difference]: With dead ends: 967 [2020-12-09 18:10:45,248 INFO L226 Difference]: Without dead ends: 436 [2020-12-09 18:10:45,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3648 GetRequests, 3564 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=937, Invalid=6035, Unknown=0, NotChecked=0, Total=6972 [2020-12-09 18:10:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-12-09 18:10:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 333. [2020-12-09 18:10:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-12-09 18:10:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 540 transitions. [2020-12-09 18:10:45,272 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 540 transitions. Word has length 1794 [2020-12-09 18:10:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:45,273 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 540 transitions. [2020-12-09 18:10:45,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-09 18:10:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 540 transitions. [2020-12-09 18:10:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1495 [2020-12-09 18:10:45,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:45,287 INFO L422 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 89, 88, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 34, 34, 22, 20, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:45,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2020-12-09 18:10:45,487 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:45,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1148438999, now seen corresponding path program 10 times [2020-12-09 18:10:45,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:45,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933580816] [2020-12-09 18:10:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 2934 proven. 1957 refuted. 0 times theorem prover too weak. 62041 trivial. 0 not checked. [2020-12-09 18:10:46,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933580816] [2020-12-09 18:10:46,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446340617] [2020-12-09 18:10:46,823 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:10:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:47,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 3349 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 18:10:47,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 3453 proven. 2409 refuted. 0 times theorem prover too weak. 61070 trivial. 0 not checked. [2020-12-09 18:10:49,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:10:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 66932 backedges. 3453 proven. 2461 refuted. 0 times theorem prover too weak. 61018 trivial. 0 not checked. [2020-12-09 18:10:56,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1604122299] [2020-12-09 18:10:56,032 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:10:56,032 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:10:56,032 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:10:56,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:10:56,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 23] total 29 [2020-12-09 18:10:56,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637719076] [2020-12-09 18:10:56,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-09 18:10:56,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:10:56,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-09 18:10:56,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2020-12-09 18:10:56,035 INFO L87 Difference]: Start difference. First operand 333 states and 540 transitions. Second operand 29 states. [2020-12-09 18:10:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:10:56,331 INFO L93 Difference]: Finished difference Result 351 states and 572 transitions. [2020-12-09 18:10:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 18:10:56,331 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1494 [2020-12-09 18:10:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:10:56,335 INFO L225 Difference]: With dead ends: 351 [2020-12-09 18:10:56,335 INFO L226 Difference]: Without dead ends: 317 [2020-12-09 18:10:56,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3017 GetRequests, 2978 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 18:10:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-12-09 18:10:56,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 312. [2020-12-09 18:10:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2020-12-09 18:10:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 466 transitions. [2020-12-09 18:10:56,351 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 466 transitions. Word has length 1494 [2020-12-09 18:10:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:10:56,352 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 466 transitions. [2020-12-09 18:10:56,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-09 18:10:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 466 transitions. [2020-12-09 18:10:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1318 [2020-12-09 18:10:56,362 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:10:56,363 INFO L422 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 78, 78, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 30, 30, 19, 18, 1, 1, 1, 1, 1, 1] [2020-12-09 18:10:56,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-12-09 18:10:56,564 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:10:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:10:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1272483232, now seen corresponding path program 11 times [2020-12-09 18:10:56,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:10:56,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150926383] [2020-12-09 18:10:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:10:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:10:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 51894 backedges. 1029 proven. 3260 refuted. 0 times theorem prover too weak. 47605 trivial. 0 not checked. [2020-12-09 18:10:57,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150926383] [2020-12-09 18:10:57,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797284699] [2020-12-09 18:10:57,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:10:58,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2020-12-09 18:10:58,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:10:58,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 18:10:58,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:10:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 51894 backedges. 19954 proven. 157 refuted. 0 times theorem prover too weak. 31783 trivial. 0 not checked. [2020-12-09 18:10:59,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:11:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 51894 backedges. 3172 proven. 904 refuted. 0 times theorem prover too weak. 47818 trivial. 0 not checked. [2020-12-09 18:11:03,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [72326199] [2020-12-09 18:11:03,989 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:11:03,989 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:11:03,990 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:11:03,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:11:03,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 31 [2020-12-09 18:11:03,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657176003] [2020-12-09 18:11:03,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-12-09 18:11:03,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:03,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-12-09 18:11:03,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2020-12-09 18:11:03,993 INFO L87 Difference]: Start difference. First operand 312 states and 466 transitions. Second operand 31 states. [2020-12-09 18:11:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:04,798 INFO L93 Difference]: Finished difference Result 670 states and 1037 transitions. [2020-12-09 18:11:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-09 18:11:04,799 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1317 [2020-12-09 18:11:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:04,802 INFO L225 Difference]: With dead ends: 670 [2020-12-09 18:11:04,802 INFO L226 Difference]: Without dead ends: 322 [2020-12-09 18:11:04,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2679 GetRequests, 2622 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=2720, Unknown=0, NotChecked=0, Total=3192 [2020-12-09 18:11:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-12-09 18:11:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 301. [2020-12-09 18:11:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-12-09 18:11:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 415 transitions. [2020-12-09 18:11:04,818 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 415 transitions. Word has length 1317 [2020-12-09 18:11:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:04,819 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 415 transitions. [2020-12-09 18:11:04,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-12-09 18:11:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 415 transitions. [2020-12-09 18:11:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1454 [2020-12-09 18:11:04,831 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:11:04,831 INFO L422 BasicCegarLoop]: trace histogram [108, 108, 105, 105, 86, 86, 54, 54, 54, 54, 54, 54, 54, 52, 52, 52, 52, 52, 52, 52, 34, 32, 22, 19, 1, 1, 1, 1, 1, 1] [2020-12-09 18:11:05,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2020-12-09 18:11:05,032 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:11:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:11:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash 524491586, now seen corresponding path program 12 times [2020-12-09 18:11:05,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:11:05,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985314750] [2020-12-09 18:11:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:11:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:11:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 63290 backedges. 1926 proven. 2827 refuted. 0 times theorem prover too weak. 58537 trivial. 0 not checked. [2020-12-09 18:11:06,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985314750] [2020-12-09 18:11:06,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928619598] [2020-12-09 18:11:06,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:11:06,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 18:11:06,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 18:11:06,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 2585 conjuncts, 34 conjunts are in the unsatisfiable core [2020-12-09 18:11:06,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:11:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 63290 backedges. 31435 proven. 3730 refuted. 0 times theorem prover too weak. 28125 trivial. 0 not checked. [2020-12-09 18:11:08,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:11:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 63290 backedges. 2234 proven. 7374 refuted. 0 times theorem prover too weak. 53682 trivial. 0 not checked. [2020-12-09 18:11:17,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [329311921] [2020-12-09 18:11:17,729 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 18:11:17,729 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:11:17,729 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:11:17,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 18:11:17,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 35] total 46 [2020-12-09 18:11:17,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71926647] [2020-12-09 18:11:17,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-12-09 18:11:17,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:11:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-12-09 18:11:17,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1861, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 18:11:17,733 INFO L87 Difference]: Start difference. First operand 301 states and 415 transitions. Second operand 46 states. [2020-12-09 18:11:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:11:19,785 INFO L93 Difference]: Finished difference Result 718 states and 1089 transitions. [2020-12-09 18:11:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-12-09 18:11:19,785 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1453 [2020-12-09 18:11:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:11:19,789 INFO L225 Difference]: With dead ends: 718 [2020-12-09 18:11:19,789 INFO L226 Difference]: Without dead ends: 388 [2020-12-09 18:11:19,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2974 GetRequests, 2879 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1210, Invalid=7720, Unknown=0, NotChecked=0, Total=8930 [2020-12-09 18:11:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-09 18:11:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 285. [2020-12-09 18:11:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2020-12-09 18:11:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 367 transitions. [2020-12-09 18:11:19,807 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 367 transitions. Word has length 1453 [2020-12-09 18:11:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:11:19,808 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 367 transitions. [2020-12-09 18:11:19,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-12-09 18:11:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 367 transitions. [2020-12-09 18:11:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2020-12-09 18:11:19,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:11:19,817 INFO L422 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1] [2020-12-09 18:11:20,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-12-09 18:11:20,018 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:11:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:11:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1265411898, now seen corresponding path program 13 times [2020-12-09 18:11:20,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:11:20,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025628752] [2020-12-09 18:11:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:11:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 18:11:20,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 18:11:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 18:11:20,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 18:11:20,667 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 18:11:20,667 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 18:11:20,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-09 18:11:20,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:11:20 BoogieIcfgContainer [2020-12-09 18:11:20,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 18:11:20,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 18:11:20,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 18:11:20,867 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 18:11:20,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:09:26" (3/4) ... [2020-12-09 18:11:20,869 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 18:11:21,087 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1176c262-d5a8-4caf-bacd-9007c5c542b9/bin/utaipan/witness.graphml [2020-12-09 18:11:21,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 18:11:21,088 INFO L168 Benchmark]: Toolchain (without parser) took 114923.09 ms. Allocated memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 57.7 MB in the beginning and 790.4 MB in the end (delta: -732.7 MB). Peak memory consumption was 890.0 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:21,088 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 98.6 MB. Free memory is still 73.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:11:21,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.49 ms. Allocated memory is still 98.6 MB. Free memory was 57.4 MB in the beginning and 74.0 MB in the end (delta: -16.5 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:21,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.86 ms. Allocated memory is still 98.6 MB. Free memory was 74.0 MB in the beginning and 72.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:21,088 INFO L168 Benchmark]: Boogie Preprocessor took 15.54 ms. Allocated memory is still 98.6 MB. Free memory was 72.6 MB in the beginning and 71.9 MB in the end (delta: 720.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:21,089 INFO L168 Benchmark]: RCFGBuilder took 209.87 ms. Allocated memory is still 98.6 MB. Free memory was 71.5 MB in the beginning and 69.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:21,089 INFO L168 Benchmark]: TraceAbstraction took 114296.64 ms. Allocated memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 68.8 MB in the beginning and 840.4 MB in the end (delta: -771.6 MB). Peak memory consumption was 852.4 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:21,089 INFO L168 Benchmark]: Witness Printer took 219.50 ms. Allocated memory is still 1.7 GB. Free memory was 840.4 MB in the beginning and 790.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. [2020-12-09 18:11:21,091 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.17 ms. Allocated memory is still 98.6 MB. Free memory is still 73.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 154.49 ms. Allocated memory is still 98.6 MB. Free memory was 57.4 MB in the beginning and 74.0 MB in the end (delta: -16.5 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 21.86 ms. Allocated memory is still 98.6 MB. Free memory was 74.0 MB in the beginning and 72.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 15.54 ms. Allocated memory is still 98.6 MB. Free memory was 72.6 MB in the beginning and 71.9 MB in the end (delta: 720.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 209.87 ms. Allocated memory is still 98.6 MB. Free memory was 71.5 MB in the beginning and 69.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 114296.64 ms. Allocated memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 68.8 MB in the beginning and 840.4 MB in the end (delta: -771.6 MB). Peak memory consumption was 852.4 MB. Max. memory is 16.1 GB. * Witness Printer took 219.50 ms. Allocated memory is still 1.7 GB. Free memory was 840.4 MB in the beginning and 790.4 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 55 [L41] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 114.0s, OverallIterations: 23, TraceHistogramMax: 138, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 706 SDtfs, 2666 SDslu, 6815 SDs, 0 SdLazy, 14431 SolverSat, 3595 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29852 GetRequests, 28962 SyntacticMatches, 35 SemanticMatches, 855 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9719 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 667 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 81.2s InterpolantComputationTime, 30397 NumberOfCodeBlocks, 26301 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 43712 ConstructedInterpolants, 0 QuantifiedInterpolants, 64553238 SizeOfPredicates, 162 NumberOfNonLiveVariables, 23136 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 62 InterpolantComputations, 2 PerfectInterpolantSequences, 1624734/1710432 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! Received shutdown request...