./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.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_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI --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 0208408d43bfed3fb8998dae24b66601d82afc9c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:26:55,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:26:55,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:26:55,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:26:55,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:26:55,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:26:55,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:26:55,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:26:55,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:26:55,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:26:55,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:26:55,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:26:55,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:26:55,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:26:55,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:26:55,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:26:55,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:26:55,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:26:55,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:26:55,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:26:55,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:26:55,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:26:55,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:26:55,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:26:55,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:26:55,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:26:55,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:26:55,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:26:55,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:26:55,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:26:55,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:26:55,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:26:55,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:26:55,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:26:55,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:26:55,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:26:55,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:26:55,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:26:55,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:26:55,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:26:55,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:26:55,488 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:26:55,513 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:26:55,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:26:55,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:26:55,518 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:26:55,519 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:26:55,519 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:26:55,520 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:26:55,520 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:26:55,520 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:26:55,521 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:26:55,521 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:26:55,521 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:26:55,522 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:26:55,523 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:26:55,523 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:26:55,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:26:55,525 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:26:55,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:26:55,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:26:55,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:26:55,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:26:55,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:26:55,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:26:55,527 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:26:55,527 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:26:55,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:26:55,528 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:26:55,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:26:55,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:26:55,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:26:55,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:26:55,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:26:55,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:26:55,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:26:55,532 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:26:55,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:26:55,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:26:55,533 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:26:55,534 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:26:55,534 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI 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 -> 0208408d43bfed3fb8998dae24b66601d82afc9c [2021-10-11 02:26:55,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:26:55,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:26:55,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:26:55,892 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:26:55,893 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:26:55,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2021-10-11 02:26:55,977 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/data/0dbfc6f53/c86a07dc971840abb01308042309b785/FLAG57fc5fcc4 [2021-10-11 02:26:56,533 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:26:56,534 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2021-10-11 02:26:56,546 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/data/0dbfc6f53/c86a07dc971840abb01308042309b785/FLAG57fc5fcc4 [2021-10-11 02:26:56,897 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/data/0dbfc6f53/c86a07dc971840abb01308042309b785 [2021-10-11 02:26:56,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:26:56,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:26:56,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:26:56,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:26:56,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:26:56,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:26:56" (1/1) ... [2021-10-11 02:26:56,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f37d9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:56, skipping insertion in model container [2021-10-11 02:26:56,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:26:56" (1/1) ... [2021-10-11 02:26:56,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:26:56,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:26:57,155 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c[946,959] [2021-10-11 02:26:57,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:26:57,176 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:26:57,198 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c[946,959] [2021-10-11 02:26:57,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:26:57,221 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:26:57,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57 WrapperNode [2021-10-11 02:26:57,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:26:57,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:26:57,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:26:57,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:26:57,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... [2021-10-11 02:26:57,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... [2021-10-11 02:26:57,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:26:57,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:26:57,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:26:57,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:26:57,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... [2021-10-11 02:26:57,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... [2021-10-11 02:26:57,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... [2021-10-11 02:26:57,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... [2021-10-11 02:26:57,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... [2021-10-11 02:26:57,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... [2021-10-11 02:26:57,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... [2021-10-11 02:26:57,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:26:57,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:26:57,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:26:57,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:26:57,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:26:57,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:26:57,356 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-10-11 02:26:57,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-10-11 02:26:57,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:26:57,356 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-10-11 02:26:57,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-10-11 02:26:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:26:57,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:26:57,626 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:26:57,627 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 02:26:57,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:57 BoogieIcfgContainer [2021-10-11 02:26:57,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:26:57,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:26:57,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:26:57,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:26:57,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:26:56" (1/3) ... [2021-10-11 02:26:57,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49156aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:26:57, skipping insertion in model container [2021-10-11 02:26:57,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:57" (2/3) ... [2021-10-11 02:26:57,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49156aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:26:57, skipping insertion in model container [2021-10-11 02:26:57,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:57" (3/3) ... [2021-10-11 02:26:57,638 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2021-10-11 02:26:57,651 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:26:57,654 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:26:57,665 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:26:57,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:26:57,687 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:26:57,687 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:26:57,687 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:26:57,687 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:26:57,688 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:26:57,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:26:57,688 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:26:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2021-10-11 02:26:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:26:57,723 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:57,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:57,724 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:57,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2021-10-11 02:26:57,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:57,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785057686] [2021-10-11 02:26:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:58,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785057686] [2021-10-11 02:26:58,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:58,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:26:58,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431201662] [2021-10-11 02:26:58,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:26:58,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:26:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:26:58,151 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2021-10-11 02:26:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:58,301 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2021-10-11 02:26:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:26:58,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-10-11 02:26:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:58,313 INFO L225 Difference]: With dead ends: 34 [2021-10-11 02:26:58,314 INFO L226 Difference]: Without dead ends: 26 [2021-10-11 02:26:58,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:26:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-11 02:26:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-11 02:26:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-11 02:26:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-11 02:26:58,361 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2021-10-11 02:26:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:58,362 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-11 02:26:58,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:26:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-11 02:26:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:26:58,363 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:58,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:58,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:26:58,364 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:58,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:58,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2021-10-11 02:26:58,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:58,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795418071] [2021-10-11 02:26:58,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:58,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795418071] [2021-10-11 02:26:58,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:58,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:26:58,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932719219] [2021-10-11 02:26:58,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:26:58,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:58,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:26:58,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:26:58,426 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2021-10-11 02:26:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:58,496 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2021-10-11 02:26:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:26:58,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-10-11 02:26:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:58,499 INFO L225 Difference]: With dead ends: 32 [2021-10-11 02:26:58,499 INFO L226 Difference]: Without dead ends: 28 [2021-10-11 02:26:58,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:26:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-10-11 02:26:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-10-11 02:26:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-11 02:26:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-11 02:26:58,507 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2021-10-11 02:26:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:58,508 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-11 02:26:58,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:26:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-11 02:26:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:26:58,509 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:58,509 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:58,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:26:58,510 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2021-10-11 02:26:58,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:58,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609537395] [2021-10-11 02:26:58,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:26:58,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609537395] [2021-10-11 02:26:58,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112702762] [2021-10-11 02:26:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:26:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:58,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:26:58,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:26:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:26:58,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:26:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:26:59,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367222090] [2021-10-11 02:26:59,175 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-11 02:26:59,175 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:26:59,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:26:59,186 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:26:59,187 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:26:59,452 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) [2021-10-11 02:26:59,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:26:59,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-10-11 02:26:59,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200912611] [2021-10-11 02:26:59,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-10-11 02:26:59,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 02:26:59,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:26:59,457 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2021-10-11 02:26:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:59,735 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2021-10-11 02:26:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-11 02:26:59,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2021-10-11 02:26:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:59,741 INFO L225 Difference]: With dead ends: 54 [2021-10-11 02:26:59,741 INFO L226 Difference]: Without dead ends: 30 [2021-10-11 02:26:59,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:26:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-10-11 02:26:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-10-11 02:26:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-10-11 02:26:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-10-11 02:26:59,762 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2021-10-11 02:26:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:59,763 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-10-11 02:26:59,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-10-11 02:26:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-10-11 02:26:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:26:59,767 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:59,767 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] [2021-10-11 02:26:59,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-11 02:26:59,996 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2021-10-11 02:26:59,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:59,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823372089] [2021-10-11 02:26:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:27:00,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823372089] [2021-10-11 02:27:00,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742018577] [2021-10-11 02:27:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:00,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:27:00,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:27:00,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:27:00,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [962087494] [2021-10-11 02:27:00,599 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2021-10-11 02:27:00,600 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:00,601 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:27:00,601 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:27:00,602 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:27:00,875 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) [2021-10-11 02:27:00,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:00,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-10-11 02:27:00,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489935510] [2021-10-11 02:27:00,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-10-11 02:27:00,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:00,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-11 02:27:00,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:27:00,882 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2021-10-11 02:27:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:01,045 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2021-10-11 02:27:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:27:01,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2021-10-11 02:27:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:01,051 INFO L225 Difference]: With dead ends: 39 [2021-10-11 02:27:01,052 INFO L226 Difference]: Without dead ends: 35 [2021-10-11 02:27:01,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:27:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-11 02:27:01,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2021-10-11 02:27:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-10-11 02:27:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2021-10-11 02:27:01,073 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2021-10-11 02:27:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:01,073 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-10-11 02:27:01,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-10-11 02:27:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2021-10-11 02:27:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-11 02:27:01,079 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:01,079 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] [2021-10-11 02:27:01,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-11 02:27:01,304 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:01,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2021-10-11 02:27:01,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:01,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731758752] [2021-10-11 02:27:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:01,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:27:01,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731758752] [2021-10-11 02:27:01,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696658538] [2021-10-11 02:27:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:01,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:27:01,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:27:01,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:27:01,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [132746172] [2021-10-11 02:27:01,900 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:27:01,901 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:01,901 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) [2021-10-11 02:27:01,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:01,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2021-10-11 02:27:01,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325810010] [2021-10-11 02:27:01,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-10-11 02:27:01,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:01,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-11 02:27:01,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:27:01,909 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2021-10-11 02:27:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:02,168 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2021-10-11 02:27:02,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:27:02,170 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2021-10-11 02:27:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:02,176 INFO L225 Difference]: With dead ends: 66 [2021-10-11 02:27:02,184 INFO L226 Difference]: Without dead ends: 35 [2021-10-11 02:27:02,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-10-11 02:27:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-11 02:27:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-10-11 02:27:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-10-11 02:27:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2021-10-11 02:27:02,199 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2021-10-11 02:27:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:02,200 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-10-11 02:27:02,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-10-11 02:27:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2021-10-11 02:27:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:27:02,203 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:02,204 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] [2021-10-11 02:27:02,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-10-11 02:27:02,420 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2021-10-11 02:27:02,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:02,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916156412] [2021-10-11 02:27:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-11 02:27:02,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916156412] [2021-10-11 02:27:02,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455282861] [2021-10-11 02:27:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:02,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:27:02,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:27:02,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:27:03,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1209149143] [2021-10-11 02:27:03,110 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:27:03,111 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:03,111 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) [2021-10-11 02:27:03,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:03,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2021-10-11 02:27:03,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444115487] [2021-10-11 02:27:03,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-10-11 02:27:03,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:03,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-11 02:27:03,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:27:03,114 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 17 states. [2021-10-11 02:27:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:03,646 INFO L93 Difference]: Finished difference Result 98 states and 158 transitions. [2021-10-11 02:27:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-11 02:27:03,647 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2021-10-11 02:27:03,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:03,653 INFO L225 Difference]: With dead ends: 98 [2021-10-11 02:27:03,653 INFO L226 Difference]: Without dead ends: 65 [2021-10-11 02:27:03,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2021-10-11 02:27:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-11 02:27:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2021-10-11 02:27:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-10-11 02:27:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2021-10-11 02:27:03,684 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 36 [2021-10-11 02:27:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:03,685 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-10-11 02:27:03,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-10-11 02:27:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2021-10-11 02:27:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-11 02:27:03,687 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:03,687 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] [2021-10-11 02:27:03,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:03,888 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2021-10-11 02:27:03,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:03,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827263395] [2021-10-11 02:27:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:27:03,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827263395] [2021-10-11 02:27:03,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712997591] [2021-10-11 02:27:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:04,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:27:04,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:27:04,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-11 02:27:04,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [39727066] [2021-10-11 02:27:04,519 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:27:04,519 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:04,520 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) [2021-10-11 02:27:04,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:04,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2021-10-11 02:27:04,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639991938] [2021-10-11 02:27:04,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:27:04,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:04,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:27:04,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:27:04,524 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 11 states. [2021-10-11 02:27:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:04,660 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2021-10-11 02:27:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:27:04,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2021-10-11 02:27:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:04,666 INFO L225 Difference]: With dead ends: 81 [2021-10-11 02:27:04,667 INFO L226 Difference]: Without dead ends: 77 [2021-10-11 02:27:04,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:27:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-10-11 02:27:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2021-10-11 02:27:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-10-11 02:27:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2021-10-11 02:27:04,700 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 50 [2021-10-11 02:27:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:04,700 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-10-11 02:27:04,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:27:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2021-10-11 02:27:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 02:27:04,704 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:04,704 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:04,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-10-11 02:27:04,928 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1667877015, now seen corresponding path program 1 times [2021-10-11 02:27:04,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:04,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656955689] [2021-10-11 02:27:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-10-11 02:27:05,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656955689] [2021-10-11 02:27:05,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573918696] [2021-10-11 02:27:05,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:05,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:27:05,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-10-11 02:27:05,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-10-11 02:27:05,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2110372124] [2021-10-11 02:27:05,417 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:27:05,417 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:05,418 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) [2021-10-11 02:27:05,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:05,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2021-10-11 02:27:05,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499298579] [2021-10-11 02:27:05,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:27:05,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:05,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:27:05,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:27:05,421 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 9 states. [2021-10-11 02:27:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:05,518 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2021-10-11 02:27:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:27:05,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2021-10-11 02:27:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:05,521 INFO L225 Difference]: With dead ends: 69 [2021-10-11 02:27:05,522 INFO L226 Difference]: Without dead ends: 65 [2021-10-11 02:27:05,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:27:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-11 02:27:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2021-10-11 02:27:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-10-11 02:27:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2021-10-11 02:27:05,548 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 51 [2021-10-11 02:27:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:05,548 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-10-11 02:27:05,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:27:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2021-10-11 02:27:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-11 02:27:05,553 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:05,553 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:05,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:05,768 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1164844098, now seen corresponding path program 1 times [2021-10-11 02:27:05,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:05,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937195334] [2021-10-11 02:27:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-10-11 02:27:06,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937195334] [2021-10-11 02:27:06,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225292038] [2021-10-11 02:27:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:06,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjunts are in the unsatisfiable core [2021-10-11 02:27:06,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-10-11 02:27:06,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-10-11 02:27:07,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [972903295] [2021-10-11 02:27:07,004 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:27:07,004 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:07,005 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) [2021-10-11 02:27:07,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:07,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2021-10-11 02:27:07,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648051198] [2021-10-11 02:27:07,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-10-11 02:27:07,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:07,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-11 02:27:07,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:27:07,011 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 21 states. [2021-10-11 02:27:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:07,228 INFO L93 Difference]: Finished difference Result 105 states and 193 transitions. [2021-10-11 02:27:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-11 02:27:07,228 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2021-10-11 02:27:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:07,231 INFO L225 Difference]: With dead ends: 105 [2021-10-11 02:27:07,231 INFO L226 Difference]: Without dead ends: 101 [2021-10-11 02:27:07,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 111 SyntacticMatches, 17 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-10-11 02:27:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-10-11 02:27:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2021-10-11 02:27:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-10-11 02:27:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 122 transitions. [2021-10-11 02:27:07,248 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 122 transitions. Word has length 64 [2021-10-11 02:27:07,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:07,249 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 122 transitions. [2021-10-11 02:27:07,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-10-11 02:27:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 122 transitions. [2021-10-11 02:27:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-11 02:27:07,251 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:07,251 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:07,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-10-11 02:27:07,473 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash -306100689, now seen corresponding path program 2 times [2021-10-11 02:27:07,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:07,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632028615] [2021-10-11 02:27:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 46 proven. 17 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-10-11 02:27:07,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632028615] [2021-10-11 02:27:07,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850130347] [2021-10-11 02:27:07,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:07,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-10-11 02:27:07,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:07,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:27:07,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-10-11 02:27:07,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-11 02:27:08,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [885441454] [2021-10-11 02:27:08,251 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:27:08,251 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:08,252 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) [2021-10-11 02:27:08,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:08,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 15 [2021-10-11 02:27:08,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641326592] [2021-10-11 02:27:08,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-10-11 02:27:08,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-11 02:27:08,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:27:08,255 INFO L87 Difference]: Start difference. First operand 69 states and 122 transitions. Second operand 15 states. [2021-10-11 02:27:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:08,461 INFO L93 Difference]: Finished difference Result 87 states and 151 transitions. [2021-10-11 02:27:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:27:08,462 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2021-10-11 02:27:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:08,465 INFO L225 Difference]: With dead ends: 87 [2021-10-11 02:27:08,465 INFO L226 Difference]: Without dead ends: 83 [2021-10-11 02:27:08,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:27:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-10-11 02:27:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2021-10-11 02:27:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-10-11 02:27:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 105 transitions. [2021-10-11 02:27:08,487 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 105 transitions. Word has length 79 [2021-10-11 02:27:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:08,487 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 105 transitions. [2021-10-11 02:27:08,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-10-11 02:27:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 105 transitions. [2021-10-11 02:27:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-11 02:27:08,490 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:08,490 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:08,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-10-11 02:27:08,707 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash -976355400, now seen corresponding path program 1 times [2021-10-11 02:27:08,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:08,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691099021] [2021-10-11 02:27:08,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-10-11 02:27:08,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691099021] [2021-10-11 02:27:08,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378341136] [2021-10-11 02:27:08,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:27:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:08,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:27:08,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-10-11 02:27:08,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-11 02:27:09,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2008546048] [2021-10-11 02:27:09,541 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:27:09,541 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:09,542 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) [2021-10-11 02:27:09,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:09,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 13 [2021-10-11 02:27:09,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971737660] [2021-10-11 02:27:09,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-10-11 02:27:09,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:09,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 02:27:09,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:27:09,546 INFO L87 Difference]: Start difference. First operand 63 states and 105 transitions. Second operand 13 states. [2021-10-11 02:27:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:09,741 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2021-10-11 02:27:09,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:27:09,742 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2021-10-11 02:27:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:09,743 INFO L225 Difference]: With dead ends: 79 [2021-10-11 02:27:09,743 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:27:09,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:27:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:27:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:27:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:27:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:27:09,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2021-10-11 02:27:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:09,745 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:27:09,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-10-11 02:27:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:27:09,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:27:09,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-10-11 02:27:09,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:27:10,258 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2021-10-11 02:27:10,276 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:27:10,276 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:27:10,276 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2021-10-11 02:27:10,276 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2021-10-11 02:27:10,277 INFO L262 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2021-10-11 02:27:10,277 INFO L258 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4)) [2021-10-11 02:27:10,277 INFO L262 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2021-10-11 02:27:10,277 INFO L258 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 4 ULTIMATE.start_main_~x~0) [2021-10-11 02:27:10,277 INFO L265 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2021-10-11 02:27:10,278 INFO L258 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= |fibo2_#in~n| fibo2_~n) (< 1 fibo2_~n) (<= fibo2_~n |fibo2_#in~n|)) [2021-10-11 02:27:10,278 INFO L262 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2021-10-11 02:27:10,278 INFO L258 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#in~n| fibo2_~n)) (.cse1 (<= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (<= |fibo2_#t~ret9| 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) .cse1) (and (<= 4 |fibo2_#in~n|) .cse0 .cse1))) [2021-10-11 02:27:10,278 INFO L262 CegarLoopResult]: For program point L22(lines 22 26) no Hoare annotation was computed. [2021-10-11 02:27:10,278 INFO L262 CegarLoopResult]: For program point L25-3(line 25) no Hoare annotation was computed. [2021-10-11 02:27:10,278 INFO L262 CegarLoopResult]: For program point L20(lines 20 26) no Hoare annotation was computed. [2021-10-11 02:27:10,278 INFO L262 CegarLoopResult]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2021-10-11 02:27:10,279 INFO L262 CegarLoopResult]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2021-10-11 02:27:10,279 INFO L265 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2021-10-11 02:27:10,280 INFO L258 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (<= |fibo1_#in~n| fibo1_~n) (<= fibo1_~n |fibo1_#in~n|)) [2021-10-11 02:27:10,280 INFO L262 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2021-10-11 02:27:10,280 INFO L258 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse1 (<= |fibo1_#in~n| fibo1_~n)) (.cse2 (<= fibo1_~n |fibo1_#in~n|))) (or (and (let ((.cse0 (<= 3 fibo1_~n))) (or (and (<= |fibo1_#in~n| 3) .cse0) (and .cse0 .cse1 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)))) .cse2) (and (<= |fibo1_#in~n| 2) (< 1 fibo1_~n) .cse2 (= |fibo1_#t~ret7| 1)) (and (<= 5 |fibo1_#in~n|) .cse1 .cse2))) [2021-10-11 02:27:10,280 INFO L262 CegarLoopResult]: For program point L12(lines 12 16) no Hoare annotation was computed. [2021-10-11 02:27:10,281 INFO L262 CegarLoopResult]: For program point L15-3(line 15) no Hoare annotation was computed. [2021-10-11 02:27:10,281 INFO L262 CegarLoopResult]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2021-10-11 02:27:10,281 INFO L262 CegarLoopResult]: For program point L10(lines 10 16) no Hoare annotation was computed. [2021-10-11 02:27:10,281 INFO L262 CegarLoopResult]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2021-10-11 02:27:10,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:27:10 BoogieIcfgContainer [2021-10-11 02:27:10,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:27:10,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:27:10,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:27:10,295 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:27:10,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:57" (3/4) ... [2021-10-11 02:27:10,301 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:27:10,306 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2021-10-11 02:27:10,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2021-10-11 02:27:10,314 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-10-11 02:27:10,314 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 02:27:10,315 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-11 02:27:10,315 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:27:10,364 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b70cd07-5ead-44d0-9307-f082c37e363e/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:27:10,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:27:10,366 INFO L168 Benchmark]: Toolchain (without parser) took 13462.27 ms. Allocated memory was 100.7 MB in the beginning and 188.7 MB in the end (delta: 88.1 MB). Free memory was 70.4 MB in the beginning and 75.1 MB in the end (delta: -4.8 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:10,366 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 100.7 MB. Free memory is still 55.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:27:10,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.07 ms. Allocated memory is still 100.7 MB. Free memory was 70.2 MB in the beginning and 76.3 MB in the end (delta: -6.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:10,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.28 ms. Allocated memory is still 100.7 MB. Free memory was 76.3 MB in the beginning and 74.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:10,368 INFO L168 Benchmark]: Boogie Preprocessor took 20.24 ms. Allocated memory is still 100.7 MB. Free memory was 74.9 MB in the beginning and 73.9 MB in the end (delta: 964.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:27:10,368 INFO L168 Benchmark]: RCFGBuilder took 352.42 ms. Allocated memory is still 100.7 MB. Free memory was 73.9 MB in the beginning and 59.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:10,369 INFO L168 Benchmark]: TraceAbstraction took 12663.37 ms. Allocated memory was 100.7 MB in the beginning and 188.7 MB in the end (delta: 88.1 MB). Free memory was 58.9 MB in the beginning and 78.3 MB in the end (delta: -19.4 MB). Peak memory consumption was 70.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:10,369 INFO L168 Benchmark]: Witness Printer took 70.20 ms. Allocated memory is still 188.7 MB. Free memory was 78.3 MB in the beginning and 75.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:10,371 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.26 ms. Allocated memory is still 100.7 MB. Free memory is still 55.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 316.07 ms. Allocated memory is still 100.7 MB. Free memory was 70.2 MB in the beginning and 76.3 MB in the end (delta: -6.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.28 ms. Allocated memory is still 100.7 MB. Free memory was 76.3 MB in the beginning and 74.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.24 ms. Allocated memory is still 100.7 MB. Free memory was 74.9 MB in the beginning and 73.9 MB in the end (delta: 964.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 352.42 ms. Allocated memory is still 100.7 MB. Free memory was 73.9 MB in the beginning and 59.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12663.37 ms. Allocated memory was 100.7 MB in the beginning and 188.7 MB in the end (delta: 88.1 MB). Free memory was 58.9 MB in the beginning and 78.3 MB in the end (delta: -19.4 MB). Peak memory consumption was 70.3 MB. Max. memory is 16.1 GB. * Witness Printer took 70.20 ms. Allocated memory is still 188.7 MB. Free memory was 78.3 MB in the beginning and 75.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 4 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.2s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 263 SDtfs, 282 SDslu, 1592 SDs, 0 SdLazy, 1493 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 988 GetRequests, 795 SyntacticMatches, 44 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 97 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 86 PreInvPairs, 141 NumberOfFragments, 109 HoareAnnotationTreeSize, 86 FomulaSimplifications, 747 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 271 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 869 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1265 ConstructedInterpolants, 0 QuantifiedInterpolants, 153984 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1161 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 946/1296 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 correct! Received shutdown request...