./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-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-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe4c237d03da6bf7a86f5cd898d20e467d10d950 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 20:26:33,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 20:26:33,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 20:26:33,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 20:26:33,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 20:26:33,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 20:26:33,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 20:26:33,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 20:26:33,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 20:26:33,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 20:26:33,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 20:26:33,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 20:26:33,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 20:26:33,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 20:26:33,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 20:26:33,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 20:26:33,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 20:26:33,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 20:26:33,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 20:26:33,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 20:26:33,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 20:26:33,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 20:26:33,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 20:26:33,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 20:26:33,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 20:26:33,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 20:26:33,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 20:26:33,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 20:26:33,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 20:26:33,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 20:26:33,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 20:26:33,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 20:26:33,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 20:26:33,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 20:26:33,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 20:26:33,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 20:26:33,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 20:26:33,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 20:26:33,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 20:26:33,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 20:26:33,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 20:26:33,952 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 20:26:33,973 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 20:26:33,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 20:26:33,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 20:26:33,974 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 20:26:33,974 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 20:26:33,974 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 20:26:33,975 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 20:26:33,975 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 20:26:33,975 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 20:26:33,975 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 20:26:33,975 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 20:26:33,975 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 20:26:33,976 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 20:26:33,976 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 20:26:33,976 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 20:26:33,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 20:26:33,977 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 20:26:33,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 20:26:33,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 20:26:33,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 20:26:33,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 20:26:33,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 20:26:33,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 20:26:33,978 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 20:26:33,978 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 20:26:33,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 20:26:33,979 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 20:26:33,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 20:26:33,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 20:26:33,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 20:26:33,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:26:33,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 20:26:33,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 20:26:33,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 20:26:33,980 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 20:26:33,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 20:26:33,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 20:26:33,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 20:26:33,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 20:26:33,981 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe4c237d03da6bf7a86f5cd898d20e467d10d950 [2020-12-09 20:26:34,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 20:26:34,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 20:26:34,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 20:26:34,180 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 20:26:34,181 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 20:26:34,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2020-12-09 20:26:34,224 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/data/461006550/11e83d9d38ca4368a050f445742419a0/FLAGeee72540f [2020-12-09 20:26:34,587 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 20:26:34,588 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2020-12-09 20:26:34,594 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/data/461006550/11e83d9d38ca4368a050f445742419a0/FLAGeee72540f [2020-12-09 20:26:34,603 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/data/461006550/11e83d9d38ca4368a050f445742419a0 [2020-12-09 20:26:34,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 20:26:34,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 20:26:34,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 20:26:34,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 20:26:34,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 20:26:34,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f7aff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34, skipping insertion in model container [2020-12-09 20:26:34,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 20:26:34,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 20:26:34,736 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c[947,960] [2020-12-09 20:26:34,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:26:34,748 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 20:26:34,763 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c[947,960] [2020-12-09 20:26:34,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 20:26:34,777 INFO L208 MainTranslator]: Completed translation [2020-12-09 20:26:34,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34 WrapperNode [2020-12-09 20:26:34,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 20:26:34,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 20:26:34,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 20:26:34,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 20:26:34,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 20:26:34,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 20:26:34,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 20:26:34,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 20:26:34,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... [2020-12-09 20:26:34,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 20:26:34,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 20:26:34,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 20:26:34,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 20:26:34,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 20:26:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 20:26:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-12-09 20:26:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-12-09 20:26:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 20:26:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-12-09 20:26:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-12-09 20:26:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 20:26:34,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 20:26:35,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 20:26:35,056 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 20:26:35,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:26:35 BoogieIcfgContainer [2020-12-09 20:26:35,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 20:26:35,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 20:26:35,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 20:26:35,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 20:26:35,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:26:34" (1/3) ... [2020-12-09 20:26:35,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b928565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:26:35, skipping insertion in model container [2020-12-09 20:26:35,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:26:34" (2/3) ... [2020-12-09 20:26:35,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b928565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:26:35, skipping insertion in model container [2020-12-09 20:26:35,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:26:35" (3/3) ... [2020-12-09 20:26:35,066 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-1.c [2020-12-09 20:26:35,079 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 20:26:35,081 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 20:26:35,091 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 20:26:35,113 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 20:26:35,113 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 20:26:35,113 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 20:26:35,113 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 20:26:35,114 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 20:26:35,114 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 20:26:35,114 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 20:26:35,114 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 20:26:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-12-09 20:26:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 20:26:35,134 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:35,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:35,135 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:35,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:35,140 INFO L82 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2020-12-09 20:26:35,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:35,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162120514] [2020-12-09 20:26:35,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:35,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162120514] [2020-12-09 20:26:35,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:35,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:26:35,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964920630] [2020-12-09 20:26:35,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:26:35,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:35,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:26:35,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:26:35,318 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2020-12-09 20:26:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:35,387 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-12-09 20:26:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:26:35,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 20:26:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:35,397 INFO L225 Difference]: With dead ends: 34 [2020-12-09 20:26:35,397 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 20:26:35,399 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 [2020-12-09 20:26:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 20:26:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-09 20:26:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 20:26:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-12-09 20:26:35,436 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2020-12-09 20:26:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:35,436 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-12-09 20:26:35,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:26:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-12-09 20:26:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 20:26:35,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:35,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:35,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 20:26:35,438 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2020-12-09 20:26:35,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:35,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728764955] [2020-12-09 20:26:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 20:26:35,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728764955] [2020-12-09 20:26:35,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 20:26:35,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 20:26:35,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489810104] [2020-12-09 20:26:35,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 20:26:35,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:35,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 20:26:35,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 20:26:35,488 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2020-12-09 20:26:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:35,536 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-12-09 20:26:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 20:26:35,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 20:26:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:35,538 INFO L225 Difference]: With dead ends: 32 [2020-12-09 20:26:35,538 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 20:26:35,539 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 [2020-12-09 20:26:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 20:26:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-12-09 20:26:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 20:26:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-12-09 20:26:35,546 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2020-12-09 20:26:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:35,546 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-12-09 20:26:35,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 20:26:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-12-09 20:26:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 20:26:35,547 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:35,547 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:35,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 20:26:35,547 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2020-12-09 20:26:35,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:35,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430273285] [2020-12-09 20:26:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:26:35,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430273285] [2020-12-09 20:26:35,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133160012] [2020-12-09 20:26:35,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:35,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 20:26:35,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:26:35,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:26:35,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1107626586] [2020-12-09 20:26:35,876 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2020-12-09 20:26:35,876 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:35,880 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 20:26:35,884 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 20:26:35,884 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 20:26:36,025 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:36,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:36,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2020-12-09 20:26:36,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000370352] [2020-12-09 20:26:36,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 20:26:36,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 20:26:36,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-09 20:26:36,027 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2020-12-09 20:26:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:36,143 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-12-09 20:26:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 20:26:36,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-09 20:26:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:36,145 INFO L225 Difference]: With dead ends: 54 [2020-12-09 20:26:36,145 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 20:26:36,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-12-09 20:26:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 20:26:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-12-09 20:26:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 20:26:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-12-09 20:26:36,150 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2020-12-09 20:26:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:36,150 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-12-09 20:26:36,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 20:26:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-12-09 20:26:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 20:26:36,151 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:36,152 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:36,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-09 20:26:36,353 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2020-12-09 20:26:36,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:36,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894657826] [2020-12-09 20:26:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:26:36,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894657826] [2020-12-09 20:26:36,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587323760] [2020-12-09 20:26:36,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:36,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 20:26:36,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:26:36,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 20:26:36,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891746504] [2020-12-09 20:26:36,712 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 20:26:36,712 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:36,712 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 20:26:36,713 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 20:26:36,713 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 20:26:36,831 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:36,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:36,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2020-12-09 20:26:36,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134135225] [2020-12-09 20:26:36,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 20:26:36,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:36,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 20:26:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-09 20:26:36,833 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2020-12-09 20:26:36,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:36,908 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-12-09 20:26:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 20:26:36,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-12-09 20:26:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:36,909 INFO L225 Difference]: With dead ends: 39 [2020-12-09 20:26:36,909 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 20:26:36,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 20:26:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 20:26:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-12-09 20:26:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 20:26:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-12-09 20:26:36,915 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2020-12-09 20:26:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:36,915 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-12-09 20:26:36,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 20:26:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-12-09 20:26:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 20:26:36,917 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:36,917 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:37,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 20:26:37,118 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2020-12-09 20:26:37,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:37,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791972246] [2020-12-09 20:26:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 20:26:37,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791972246] [2020-12-09 20:26:37,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540198026] [2020-12-09 20:26:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:37,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 20:26:37,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 20:26:37,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 20:26:37,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1709554262] [2020-12-09 20:26:37,593 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:37,594 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:37,594 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:37,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:37,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2020-12-09 20:26:37,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646796304] [2020-12-09 20:26:37,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 20:26:37,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:37,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 20:26:37,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-12-09 20:26:37,596 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2020-12-09 20:26:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:37,726 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2020-12-09 20:26:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 20:26:37,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-12-09 20:26:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:37,727 INFO L225 Difference]: With dead ends: 66 [2020-12-09 20:26:37,727 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 20:26:37,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2020-12-09 20:26:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 20:26:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-09 20:26:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 20:26:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-12-09 20:26:37,733 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2020-12-09 20:26:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:37,734 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-12-09 20:26:37,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 20:26:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-12-09 20:26:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 20:26:37,735 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:37,735 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:37,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-09 20:26:37,937 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:37,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2020-12-09 20:26:37,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:37,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575716095] [2020-12-09 20:26:37,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 20:26:38,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575716095] [2020-12-09 20:26:38,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687165911] [2020-12-09 20:26:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:38,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 20:26:38,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 20:26:38,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 20:26:38,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1563448164] [2020-12-09 20:26:38,513 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:38,513 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:38,514 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:38,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:38,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2020-12-09 20:26:38,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441171402] [2020-12-09 20:26:38,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 20:26:38,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:38,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 20:26:38,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-12-09 20:26:38,515 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 18 states. [2020-12-09 20:26:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:38,851 INFO L93 Difference]: Finished difference Result 98 states and 158 transitions. [2020-12-09 20:26:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 20:26:38,852 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2020-12-09 20:26:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:38,854 INFO L225 Difference]: With dead ends: 98 [2020-12-09 20:26:38,854 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 20:26:38,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-12-09 20:26:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 20:26:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2020-12-09 20:26:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 20:26:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2020-12-09 20:26:38,864 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 36 [2020-12-09 20:26:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:38,864 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2020-12-09 20:26:38,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 20:26:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2020-12-09 20:26:38,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 20:26:38,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:38,866 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:39,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:39,068 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:39,069 INFO L82 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2020-12-09 20:26:39,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:39,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498125461] [2020-12-09 20:26:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 20:26:39,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498125461] [2020-12-09 20:26:39,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103654371] [2020-12-09 20:26:39,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:39,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 20:26:39,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-09 20:26:39,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-09 20:26:39,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [206622118] [2020-12-09 20:26:39,706 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:39,706 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:39,706 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:39,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:39,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2020-12-09 20:26:39,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488758781] [2020-12-09 20:26:39,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 20:26:39,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 20:26:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-12-09 20:26:39,708 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 17 states. [2020-12-09 20:26:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:39,859 INFO L93 Difference]: Finished difference Result 102 states and 193 transitions. [2020-12-09 20:26:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 20:26:39,860 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2020-12-09 20:26:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:39,862 INFO L225 Difference]: With dead ends: 102 [2020-12-09 20:26:39,862 INFO L226 Difference]: Without dead ends: 98 [2020-12-09 20:26:39,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2020-12-09 20:26:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-12-09 20:26:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2020-12-09 20:26:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 20:26:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2020-12-09 20:26:39,876 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 50 [2020-12-09 20:26:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:39,877 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2020-12-09 20:26:39,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 20:26:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2020-12-09 20:26:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-09 20:26:39,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:39,880 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:40,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-09 20:26:40,082 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash -110138383, now seen corresponding path program 1 times [2020-12-09 20:26:40,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:40,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130002672] [2020-12-09 20:26:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 81 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-12-09 20:26:40,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130002672] [2020-12-09 20:26:40,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341071667] [2020-12-09 20:26:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:40,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 20:26:40,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2020-12-09 20:26:40,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 129 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2020-12-09 20:26:41,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [898283213] [2020-12-09 20:26:41,013 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:41,013 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:41,013 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:41,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:41,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2020-12-09 20:26:41,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740616177] [2020-12-09 20:26:41,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 20:26:41,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 20:26:41,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2020-12-09 20:26:41,015 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 23 states. [2020-12-09 20:26:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:41,543 INFO L93 Difference]: Finished difference Result 175 states and 367 transitions. [2020-12-09 20:26:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 20:26:41,544 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2020-12-09 20:26:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:41,546 INFO L225 Difference]: With dead ends: 175 [2020-12-09 20:26:41,546 INFO L226 Difference]: Without dead ends: 101 [2020-12-09 20:26:41,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 20:26:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-09 20:26:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2020-12-09 20:26:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-09 20:26:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2020-12-09 20:26:41,560 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 106 [2020-12-09 20:26:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:41,560 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2020-12-09 20:26:41,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 20:26:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2020-12-09 20:26:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-09 20:26:41,562 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:41,562 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:41,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:41,763 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash 664758646, now seen corresponding path program 1 times [2020-12-09 20:26:41,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:41,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658470654] [2020-12-09 20:26:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 49 proven. 151 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2020-12-09 20:26:41,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658470654] [2020-12-09 20:26:41,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407153489] [2020-12-09 20:26:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:41,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 20:26:41,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 36 proven. 205 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2020-12-09 20:26:42,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 36 proven. 221 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2020-12-09 20:26:43,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [681972429] [2020-12-09 20:26:43,080 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:43,080 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:43,080 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:43,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:43,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 23 [2020-12-09 20:26:43,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238770498] [2020-12-09 20:26:43,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 20:26:43,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:43,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 20:26:43,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2020-12-09 20:26:43,082 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand 23 states. [2020-12-09 20:26:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:43,376 INFO L93 Difference]: Finished difference Result 129 states and 224 transitions. [2020-12-09 20:26:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 20:26:43,377 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 145 [2020-12-09 20:26:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:43,379 INFO L225 Difference]: With dead ends: 129 [2020-12-09 20:26:43,379 INFO L226 Difference]: Without dead ends: 125 [2020-12-09 20:26:43,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 20:26:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-09 20:26:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2020-12-09 20:26:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-12-09 20:26:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 191 transitions. [2020-12-09 20:26:43,397 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 191 transitions. Word has length 145 [2020-12-09 20:26:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:43,398 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 191 transitions. [2020-12-09 20:26:43,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 20:26:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2020-12-09 20:26:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2020-12-09 20:26:43,405 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:43,405 INFO L422 BasicCegarLoop]: trace histogram [30, 30, 27, 27, 23, 23, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 10, 8, 7, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:43,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-09 20:26:43,607 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:43,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1130194814, now seen corresponding path program 2 times [2020-12-09 20:26:43,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:43,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156346086] [2020-12-09 20:26:43,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 124 proven. 831 refuted. 0 times theorem prover too weak. 3427 trivial. 0 not checked. [2020-12-09 20:26:43,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156346086] [2020-12-09 20:26:43,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623019206] [2020-12-09 20:26:43,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:43,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-12-09 20:26:43,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:26:44,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 20:26:44,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 577 proven. 113 refuted. 0 times theorem prover too weak. 3692 trivial. 0 not checked. [2020-12-09 20:26:44,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4382 backedges. 577 proven. 125 refuted. 0 times theorem prover too weak. 3680 trivial. 0 not checked. [2020-12-09 20:26:45,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [271239692] [2020-12-09 20:26:45,532 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:45,532 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:45,532 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:45,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:45,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 25 [2020-12-09 20:26:45,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420908506] [2020-12-09 20:26:45,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 20:26:45,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 20:26:45,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2020-12-09 20:26:45,535 INFO L87 Difference]: Start difference. First operand 115 states and 191 transitions. Second operand 25 states. [2020-12-09 20:26:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:46,458 INFO L93 Difference]: Finished difference Result 327 states and 842 transitions. [2020-12-09 20:26:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-09 20:26:46,458 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 391 [2020-12-09 20:26:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:46,462 INFO L225 Difference]: With dead ends: 327 [2020-12-09 20:26:46,462 INFO L226 Difference]: Without dead ends: 220 [2020-12-09 20:26:46,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 772 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=2188, Unknown=0, NotChecked=0, Total=2550 [2020-12-09 20:26:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-12-09 20:26:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 192. [2020-12-09 20:26:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-12-09 20:26:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 377 transitions. [2020-12-09 20:26:46,483 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 377 transitions. Word has length 391 [2020-12-09 20:26:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:46,483 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 377 transitions. [2020-12-09 20:26:46,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 20:26:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 377 transitions. [2020-12-09 20:26:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2020-12-09 20:26:46,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:46,492 INFO L422 BasicCegarLoop]: trace histogram [44, 44, 35, 35, 32, 28, 22, 22, 22, 22, 22, 22, 22, 17, 17, 17, 17, 17, 17, 17, 15, 12, 7, 6, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:46,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-09 20:26:46,694 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:46,695 INFO L82 PathProgramCache]: Analyzing trace with hash -731860153, now seen corresponding path program 3 times [2020-12-09 20:26:46,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:46,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016614728] [2020-12-09 20:26:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8506 backedges. 232 proven. 1103 refuted. 0 times theorem prover too weak. 7171 trivial. 0 not checked. [2020-12-09 20:26:47,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016614728] [2020-12-09 20:26:47,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813811552] [2020-12-09 20:26:47,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:47,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:26:47,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:26:47,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 20:26:47,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8506 backedges. 1425 proven. 6 refuted. 0 times theorem prover too weak. 7075 trivial. 0 not checked. [2020-12-09 20:26:47,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8506 backedges. 257 proven. 927 refuted. 0 times theorem prover too weak. 7322 trivial. 0 not checked. [2020-12-09 20:26:49,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [362723907] [2020-12-09 20:26:49,080 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:49,080 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:49,080 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:49,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:49,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 20 [2020-12-09 20:26:49,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819312876] [2020-12-09 20:26:49,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-09 20:26:49,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:49,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-09 20:26:49,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2020-12-09 20:26:49,082 INFO L87 Difference]: Start difference. First operand 192 states and 377 transitions. Second operand 20 states. [2020-12-09 20:26:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:49,569 INFO L93 Difference]: Finished difference Result 369 states and 787 transitions. [2020-12-09 20:26:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-09 20:26:49,569 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 537 [2020-12-09 20:26:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:49,572 INFO L225 Difference]: With dead ends: 369 [2020-12-09 20:26:49,573 INFO L226 Difference]: Without dead ends: 183 [2020-12-09 20:26:49,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1108 GetRequests, 1068 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 20:26:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-12-09 20:26:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2020-12-09 20:26:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-09 20:26:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 318 transitions. [2020-12-09 20:26:49,593 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 318 transitions. Word has length 537 [2020-12-09 20:26:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:49,593 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 318 transitions. [2020-12-09 20:26:49,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-09 20:26:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 318 transitions. [2020-12-09 20:26:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2020-12-09 20:26:49,597 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:49,597 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 25, 25, 22, 21, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 10, 7, 6, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:49,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-12-09 20:26:49,798 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:49,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:49,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1982009846, now seen corresponding path program 4 times [2020-12-09 20:26:49,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:49,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856067432] [2020-12-09 20:26:49,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3781 backedges. 172 proven. 598 refuted. 0 times theorem prover too weak. 3011 trivial. 0 not checked. [2020-12-09 20:26:50,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856067432] [2020-12-09 20:26:50,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462956737] [2020-12-09 20:26:50,002 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:50,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 20:26:50,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3781 backedges. 172 proven. 598 refuted. 0 times theorem prover too weak. 3011 trivial. 0 not checked. [2020-12-09 20:26:50,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3781 backedges. 172 proven. 614 refuted. 0 times theorem prover too weak. 2995 trivial. 0 not checked. [2020-12-09 20:26:51,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [33375514] [2020-12-09 20:26:51,770 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:51,770 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:51,771 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:51,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:51,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 17 [2020-12-09 20:26:51,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566001374] [2020-12-09 20:26:51,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 20:26:51,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 20:26:51,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-12-09 20:26:51,772 INFO L87 Difference]: Start difference. First operand 174 states and 318 transitions. Second operand 17 states. [2020-12-09 20:26:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:51,948 INFO L93 Difference]: Finished difference Result 223 states and 474 transitions. [2020-12-09 20:26:51,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 20:26:51,948 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 364 [2020-12-09 20:26:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:51,951 INFO L225 Difference]: With dead ends: 223 [2020-12-09 20:26:51,951 INFO L226 Difference]: Without dead ends: 219 [2020-12-09 20:26:51,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 724 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2020-12-09 20:26:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-12-09 20:26:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2020-12-09 20:26:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-12-09 20:26:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 395 transitions. [2020-12-09 20:26:51,966 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 395 transitions. Word has length 364 [2020-12-09 20:26:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:51,966 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 395 transitions. [2020-12-09 20:26:51,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 20:26:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 395 transitions. [2020-12-09 20:26:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2020-12-09 20:26:51,969 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:51,970 INFO L422 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 28, 27, 18, 18, 18, 18, 18, 18, 18, 16, 16, 16, 16, 16, 16, 16, 12, 9, 8, 6, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:52,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-12-09 20:26:52,171 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash 148314006, now seen corresponding path program 5 times [2020-12-09 20:26:52,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:52,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188626049] [2020-12-09 20:26:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6453 backedges. 239 proven. 791 refuted. 0 times theorem prover too weak. 5423 trivial. 0 not checked. [2020-12-09 20:26:52,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188626049] [2020-12-09 20:26:52,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559710130] [2020-12-09 20:26:52,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:52,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-12-09 20:26:52,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:26:52,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 20:26:52,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6453 backedges. 2246 proven. 34 refuted. 0 times theorem prover too weak. 4173 trivial. 0 not checked. [2020-12-09 20:26:52,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6453 backedges. 1032 proven. 152 refuted. 0 times theorem prover too weak. 5269 trivial. 0 not checked. [2020-12-09 20:26:54,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316971242] [2020-12-09 20:26:54,498 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:54,498 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:54,498 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:54,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:54,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 22 [2020-12-09 20:26:54,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149874827] [2020-12-09 20:26:54,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 20:26:54,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 20:26:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2020-12-09 20:26:54,500 INFO L87 Difference]: Start difference. First operand 199 states and 395 transitions. Second operand 22 states. [2020-12-09 20:26:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:55,071 INFO L93 Difference]: Finished difference Result 557 states and 1372 transitions. [2020-12-09 20:26:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-09 20:26:55,071 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 472 [2020-12-09 20:26:55,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:55,076 INFO L225 Difference]: With dead ends: 557 [2020-12-09 20:26:55,076 INFO L226 Difference]: Without dead ends: 352 [2020-12-09 20:26:55,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 935 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=293, Invalid=1513, Unknown=0, NotChecked=0, Total=1806 [2020-12-09 20:26:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-12-09 20:26:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 257. [2020-12-09 20:26:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-12-09 20:26:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 553 transitions. [2020-12-09 20:26:55,100 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 553 transitions. Word has length 472 [2020-12-09 20:26:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:55,100 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 553 transitions. [2020-12-09 20:26:55,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 20:26:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 553 transitions. [2020-12-09 20:26:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2020-12-09 20:26:55,104 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:55,104 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 26, 26, 23, 22, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 10, 8, 6, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:55,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2020-12-09 20:26:55,305 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:55,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash 620277855, now seen corresponding path program 6 times [2020-12-09 20:26:55,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:55,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159544469] [2020-12-09 20:26:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4084 backedges. 265 proven. 533 refuted. 0 times theorem prover too weak. 3286 trivial. 0 not checked. [2020-12-09 20:26:55,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159544469] [2020-12-09 20:26:55,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274098354] [2020-12-09 20:26:55,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:55,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:26:55,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:26:55,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 20:26:55,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4084 backedges. 2159 proven. 176 refuted. 0 times theorem prover too weak. 1749 trivial. 0 not checked. [2020-12-09 20:26:55,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:26:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4084 backedges. 295 proven. 943 refuted. 0 times theorem prover too weak. 2846 trivial. 0 not checked. [2020-12-09 20:26:57,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1303231386] [2020-12-09 20:26:57,926 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:26:57,926 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:26:57,926 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:26:57,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:26:57,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 19] total 27 [2020-12-09 20:26:57,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123443448] [2020-12-09 20:26:57,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 20:26:57,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:26:57,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 20:26:57,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2020-12-09 20:26:57,928 INFO L87 Difference]: Start difference. First operand 257 states and 553 transitions. Second operand 27 states. [2020-12-09 20:26:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:26:58,723 INFO L93 Difference]: Finished difference Result 479 states and 1132 transitions. [2020-12-09 20:26:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-12-09 20:26:58,723 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 378 [2020-12-09 20:26:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:26:58,726 INFO L225 Difference]: With dead ends: 479 [2020-12-09 20:26:58,726 INFO L226 Difference]: Without dead ends: 228 [2020-12-09 20:26:58,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 742 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=458, Invalid=2512, Unknown=0, NotChecked=0, Total=2970 [2020-12-09 20:26:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-12-09 20:26:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 170. [2020-12-09 20:26:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-09 20:26:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 271 transitions. [2020-12-09 20:26:58,740 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 271 transitions. Word has length 378 [2020-12-09 20:26:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:26:58,740 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 271 transitions. [2020-12-09 20:26:58,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 20:26:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 271 transitions. [2020-12-09 20:26:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2020-12-09 20:26:58,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:26:58,743 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 36, 36, 33, 31, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 15, 10, 10, 5, 1, 1, 1, 1, 1, 1] [2020-12-09 20:26:58,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:58,944 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:26:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:26:58,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1273327099, now seen corresponding path program 7 times [2020-12-09 20:26:58,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:26:58,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338739424] [2020-12-09 20:26:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:26:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 430 proven. 574 refuted. 0 times theorem prover too weak. 7573 trivial. 0 not checked. [2020-12-09 20:26:59,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338739424] [2020-12-09 20:26:59,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289185904] [2020-12-09 20:26:59,229 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:26:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:26:59,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 20:26:59,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:26:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 454 proven. 1116 refuted. 0 times theorem prover too weak. 7007 trivial. 0 not checked. [2020-12-09 20:26:59,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:27:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 456 proven. 1144 refuted. 0 times theorem prover too weak. 6977 trivial. 0 not checked. [2020-12-09 20:27:02,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [797679812] [2020-12-09 20:27:02,369 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:27:02,369 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:27:02,370 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:27:02,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:27:02,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 19] total 29 [2020-12-09 20:27:02,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918186019] [2020-12-09 20:27:02,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-09 20:27:02,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:27:02,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-09 20:27:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2020-12-09 20:27:02,372 INFO L87 Difference]: Start difference. First operand 170 states and 271 transitions. Second operand 29 states. [2020-12-09 20:27:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:27:03,582 INFO L93 Difference]: Finished difference Result 556 states and 1262 transitions. [2020-12-09 20:27:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-12-09 20:27:03,583 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 541 [2020-12-09 20:27:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:27:03,586 INFO L225 Difference]: With dead ends: 556 [2020-12-09 20:27:03,586 INFO L226 Difference]: Without dead ends: 254 [2020-12-09 20:27:03,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 1064 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=521, Invalid=3261, Unknown=0, NotChecked=0, Total=3782 [2020-12-09 20:27:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-12-09 20:27:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 200. [2020-12-09 20:27:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-12-09 20:27:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 297 transitions. [2020-12-09 20:27:03,601 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 297 transitions. Word has length 541 [2020-12-09 20:27:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:27:03,601 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 297 transitions. [2020-12-09 20:27:03,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-09 20:27:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 297 transitions. [2020-12-09 20:27:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2020-12-09 20:27:03,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:27:03,604 INFO L422 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 31, 29, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 12, 11, 10, 5, 1, 1, 1, 1, 1, 1] [2020-12-09 20:27:03,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2020-12-09 20:27:03,805 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:27:03,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:27:03,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1139966963, now seen corresponding path program 8 times [2020-12-09 20:27:03,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:27:03,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544993942] [2020-12-09 20:27:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:27:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:27:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7651 backedges. 630 proven. 113 refuted. 0 times theorem prover too weak. 6908 trivial. 0 not checked. [2020-12-09 20:27:04,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544993942] [2020-12-09 20:27:04,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53463784] [2020-12-09 20:27:04,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:27:04,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2020-12-09 20:27:04,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:27:04,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 20:27:04,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:27:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7651 backedges. 2014 proven. 34 refuted. 0 times theorem prover too weak. 5603 trivial. 0 not checked. [2020-12-09 20:27:04,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:27:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7651 backedges. 1091 proven. 104 refuted. 0 times theorem prover too weak. 6456 trivial. 0 not checked. [2020-12-09 20:27:06,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1773453417] [2020-12-09 20:27:06,201 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:27:06,201 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:27:06,201 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:27:06,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:27:06,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 22 [2020-12-09 20:27:06,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941191637] [2020-12-09 20:27:06,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 20:27:06,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:27:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 20:27:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2020-12-09 20:27:06,203 INFO L87 Difference]: Start difference. First operand 200 states and 297 transitions. Second operand 22 states. [2020-12-09 20:27:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:27:06,682 INFO L93 Difference]: Finished difference Result 404 states and 624 transitions. [2020-12-09 20:27:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-09 20:27:06,682 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 513 [2020-12-09 20:27:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:27:06,684 INFO L225 Difference]: With dead ends: 404 [2020-12-09 20:27:06,684 INFO L226 Difference]: Without dead ends: 207 [2020-12-09 20:27:06,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 1013 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=1439, Unknown=0, NotChecked=0, Total=1722 [2020-12-09 20:27:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-09 20:27:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 178. [2020-12-09 20:27:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-12-09 20:27:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 255 transitions. [2020-12-09 20:27:06,695 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 255 transitions. Word has length 513 [2020-12-09 20:27:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:27:06,695 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 255 transitions. [2020-12-09 20:27:06,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 20:27:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 255 transitions. [2020-12-09 20:27:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2020-12-09 20:27:06,698 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:27:06,698 INFO L422 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 31, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 8, 7, 1, 1, 1, 1, 1, 1] [2020-12-09 20:27:06,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:27:06,899 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:27:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:27:06,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1688245882, now seen corresponding path program 9 times [2020-12-09 20:27:06,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:27:06,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171856874] [2020-12-09 20:27:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:27:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:27:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 834 proven. 391 refuted. 0 times theorem prover too weak. 6849 trivial. 0 not checked. [2020-12-09 20:27:07,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171856874] [2020-12-09 20:27:07,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028315976] [2020-12-09 20:27:07,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:27:07,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 20:27:07,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:27:07,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 20:27:07,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:27:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 957 proven. 1662 refuted. 0 times theorem prover too weak. 5455 trivial. 0 not checked. [2020-12-09 20:27:07,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:27:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 957 proven. 1707 refuted. 0 times theorem prover too weak. 5410 trivial. 0 not checked. [2020-12-09 20:27:11,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523008214] [2020-12-09 20:27:11,620 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:27:11,621 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:27:11,621 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:27:11,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:27:11,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 31] total 41 [2020-12-09 20:27:11,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672374797] [2020-12-09 20:27:11,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-09 20:27:11,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:27:11,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-09 20:27:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1468, Unknown=0, NotChecked=0, Total=1640 [2020-12-09 20:27:11,623 INFO L87 Difference]: Start difference. First operand 178 states and 255 transitions. Second operand 41 states. [2020-12-09 20:27:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:27:13,149 INFO L93 Difference]: Finished difference Result 473 states and 794 transitions. [2020-12-09 20:27:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-12-09 20:27:13,150 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 527 [2020-12-09 20:27:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:27:13,152 INFO L225 Difference]: With dead ends: 473 [2020-12-09 20:27:13,152 INFO L226 Difference]: Without dead ends: 290 [2020-12-09 20:27:13,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1028 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=928, Invalid=5552, Unknown=0, NotChecked=0, Total=6480 [2020-12-09 20:27:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-12-09 20:27:13,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 206. [2020-12-09 20:27:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-09 20:27:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 282 transitions. [2020-12-09 20:27:13,166 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 282 transitions. Word has length 527 [2020-12-09 20:27:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:27:13,167 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 282 transitions. [2020-12-09 20:27:13,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-09 20:27:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 282 transitions. [2020-12-09 20:27:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2020-12-09 20:27:13,169 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:27:13,169 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2020-12-09 20:27:13,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2020-12-09 20:27:13,370 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:27:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:27:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1278903223, now seen corresponding path program 10 times [2020-12-09 20:27:13,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:27:13,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536709527] [2020-12-09 20:27:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:27:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:27:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6082 backedges. 0 proven. 2033 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2020-12-09 20:27:14,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536709527] [2020-12-09 20:27:14,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560444996] [2020-12-09 20:27:14,531 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:27:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:27:14,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 271 conjunts are in the unsatisfiable core [2020-12-09 20:27:14,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:27:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6082 backedges. 0 proven. 2033 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2020-12-09 20:27:15,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:27:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6082 backedges. 0 proven. 2033 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2020-12-09 20:27:19,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1952379168] [2020-12-09 20:27:19,593 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:27:19,593 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:27:19,593 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:27:19,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:27:19,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2020-12-09 20:27:19,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463089827] [2020-12-09 20:27:19,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 52 states [2020-12-09 20:27:19,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:27:19,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2020-12-09 20:27:19,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2527, Unknown=0, NotChecked=0, Total=2652 [2020-12-09 20:27:19,596 INFO L87 Difference]: Start difference. First operand 206 states and 282 transitions. Second operand 52 states. [2020-12-09 20:27:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:27:20,172 INFO L93 Difference]: Finished difference Result 214 states and 289 transitions. [2020-12-09 20:27:20,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-12-09 20:27:20,172 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 459 [2020-12-09 20:27:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:27:20,174 INFO L225 Difference]: With dead ends: 214 [2020-12-09 20:27:20,174 INFO L226 Difference]: Without dead ends: 201 [2020-12-09 20:27:20,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 907 SyntacticMatches, 96 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=2527, Unknown=0, NotChecked=0, Total=2652 [2020-12-09 20:27:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-12-09 20:27:20,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2020-12-09 20:27:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-12-09 20:27:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 271 transitions. [2020-12-09 20:27:20,184 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 271 transitions. Word has length 459 [2020-12-09 20:27:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:27:20,184 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 271 transitions. [2020-12-09 20:27:20,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2020-12-09 20:27:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 271 transitions. [2020-12-09 20:27:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2020-12-09 20:27:20,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 20:27:20,187 INFO L422 BasicCegarLoop]: trace histogram [38, 38, 35, 35, 30, 29, 19, 19, 19, 19, 19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 13, 10, 8, 6, 1, 1, 1, 1, 1, 1] [2020-12-09 20:27:20,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:27:20,387 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 20:27:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 20:27:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash -159280504, now seen corresponding path program 11 times [2020-12-09 20:27:20,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 20:27:20,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118707901] [2020-12-09 20:27:20,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 20:27:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 20:27:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 295 proven. 1035 refuted. 0 times theorem prover too weak. 5931 trivial. 0 not checked. [2020-12-09 20:27:20,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118707901] [2020-12-09 20:27:20,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024651788] [2020-12-09 20:27:20,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 20:27:21,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2020-12-09 20:27:21,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 20:27:21,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 20:27:21,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 20:27:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 294 proven. 1204 refuted. 0 times theorem prover too weak. 5763 trivial. 0 not checked. [2020-12-09 20:27:21,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 20:27:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 291 proven. 1237 refuted. 0 times theorem prover too weak. 5733 trivial. 0 not checked. [2020-12-09 20:27:24,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1944925793] [2020-12-09 20:27:24,203 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 20:27:24,203 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 20:27:24,203 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 20:27:24,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 20:27:24,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 20] total 27 [2020-12-09 20:27:24,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819530219] [2020-12-09 20:27:24,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 20:27:24,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 20:27:24,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 20:27:24,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2020-12-09 20:27:24,205 INFO L87 Difference]: Start difference. First operand 200 states and 271 transitions. Second operand 27 states. [2020-12-09 20:27:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 20:27:24,453 INFO L93 Difference]: Finished difference Result 203 states and 277 transitions. [2020-12-09 20:27:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 20:27:24,453 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 500 [2020-12-09 20:27:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 20:27:24,454 INFO L225 Difference]: With dead ends: 203 [2020-12-09 20:27:24,454 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 20:27:24,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1026 GetRequests, 979 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 20:27:24,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 20:27:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 20:27:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 20:27:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 20:27:24,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 500 [2020-12-09 20:27:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 20:27:24,456 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 20:27:24,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 20:27:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 20:27:24,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 20:27:24,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2020-12-09 20:27:24,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 20:27:26,548 WARN L197 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 40 [2020-12-09 20:27:26,686 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 1 [2020-12-09 20:27:27,047 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 14 [2020-12-09 20:27:27,171 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 1 [2020-12-09 20:27:28,089 WARN L197 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 36 [2020-12-09 20:27:28,324 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 8 [2020-12-09 20:27:28,326 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 20:27:28,326 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L258 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0)) [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L258 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 8 ULTIMATE.start_main_~x~0) [2020-12-09 20:27:28,327 INFO L265 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-12-09 20:27:28,327 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|)) [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L258 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#in~n| fibo2_~n))) (and (or (and .cse0 (<= 7 |fibo2_#in~n|)) (not (<= 5 |fibo2_#in~n|))) (let ((.cse1 (<= fibo2_~n |fibo2_#in~n|))) (or (and (<= 3 fibo2_~n) .cse1) (and (< 1 fibo2_~n) .cse1 (<= |fibo2_#in~n| 2)))) (or (and (<= |fibo2_#in~n| 3) (<= |fibo2_#t~ret9| 1) (<= 1 |fibo2_#t~ret9|)) (and (<= |fibo2_#t~ret9| 2) (<= 4 |fibo2_#in~n|) .cse0 (<= |fibo2_#in~n| 4) (<= 2 |fibo2_#t~ret9|)) (<= 8 |fibo2_#in~n|) (and (<= 8 |fibo2_#t~ret9|) (<= |fibo2_#t~ret9| 8) (<= 6 |fibo2_#in~n|))))) [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point L22(lines 22 26) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point L25-3(line 25) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point L20(lines 20 26) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2020-12-09 20:27:28,327 INFO L262 CegarLoopResult]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2020-12-09 20:27:28,328 INFO L265 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-12-09 20:27:28,328 INFO L258 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= |fibo1_#in~n| fibo1_~n) (<= 2 |fibo1_#in~n|) (<= fibo1_~n |fibo1_#in~n|) (or (<= |fibo1_#in~n| 3) (not (<= |fibo1_#in~n| 4)))) [2020-12-09 20:27:28,328 INFO L262 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-12-09 20:27:28,328 INFO L258 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (or (and (<= 13 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 13)) (<= |fibo1_#in~n| 7) (<= 9 |fibo1_#in~n|)) (or (and (<= |fibo1_#in~n| 4) (= |fibo1_#t~ret7| 1)) (not (<= |fibo1_#in~n| 6))) (let ((.cse0 (<= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 2) (< 1 fibo1_~n) .cse0) (and (<= |fibo1_#in~n| fibo1_~n) .cse0 (<= 3 |fibo1_#in~n|)))) (or (<= 6 fibo1_~n) (not (<= 4 |fibo1_#in~n|)))) [2020-12-09 20:27:28,328 INFO L262 CegarLoopResult]: For program point L12(lines 12 16) no Hoare annotation was computed. [2020-12-09 20:27:28,328 INFO L262 CegarLoopResult]: For program point L15-3(line 15) no Hoare annotation was computed. [2020-12-09 20:27:28,328 INFO L262 CegarLoopResult]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2020-12-09 20:27:28,328 INFO L262 CegarLoopResult]: For program point L10(lines 10 16) no Hoare annotation was computed. [2020-12-09 20:27:28,328 INFO L262 CegarLoopResult]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2020-12-09 20:27:28,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:27:28 BoogieIcfgContainer [2020-12-09 20:27:28,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 20:27:28,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 20:27:28,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 20:27:28,337 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 20:27:28,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:26:35" (3/4) ... [2020-12-09 20:27:28,339 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 20:27:28,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2020-12-09 20:27:28,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2020-12-09 20:27:28,345 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-12-09 20:27:28,345 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 20:27:28,346 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 20:27:28,346 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 20:27:28,367 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ac211851-8a7a-402f-9149-2b27040dbc9a/bin/utaipan/witness.graphml [2020-12-09 20:27:28,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 20:27:28,367 INFO L168 Benchmark]: Toolchain (without parser) took 53760.58 ms. Allocated memory was 100.7 MB in the beginning and 654.3 MB in the end (delta: 553.6 MB). Free memory was 60.7 MB in the beginning and 492.8 MB in the end (delta: -432.0 MB). Peak memory consumption was 122.8 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:28,368 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 100.7 MB. Free memory is still 76.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:27:28,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.29 ms. Allocated memory is still 100.7 MB. Free memory was 60.6 MB in the beginning and 77.2 MB in the end (delta: -16.5 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:28,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.54 ms. Allocated memory is still 100.7 MB. Free memory was 77.2 MB in the beginning and 75.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:28,368 INFO L168 Benchmark]: Boogie Preprocessor took 15.61 ms. Allocated memory is still 100.7 MB. Free memory was 75.8 MB in the beginning and 75.0 MB in the end (delta: 750.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 20:27:28,369 INFO L168 Benchmark]: RCFGBuilder took 239.51 ms. Allocated memory is still 100.7 MB. Free memory was 74.8 MB in the beginning and 71.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:28,369 INFO L168 Benchmark]: TraceAbstraction took 53277.09 ms. Allocated memory was 100.7 MB in the beginning and 654.3 MB in the end (delta: 553.6 MB). Free memory was 71.2 MB in the beginning and 494.8 MB in the end (delta: -423.7 MB). Peak memory consumption was 406.5 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:28,369 INFO L168 Benchmark]: Witness Printer took 29.79 ms. Allocated memory is still 654.3 MB. Free memory was 494.8 MB in the beginning and 492.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 20:27:28,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.11 ms. Allocated memory is still 100.7 MB. Free memory is still 76.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 169.29 ms. Allocated memory is still 100.7 MB. Free memory was 60.6 MB in the beginning and 77.2 MB in the end (delta: -16.5 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 23.54 ms. Allocated memory is still 100.7 MB. Free memory was 77.2 MB in the beginning and 75.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 15.61 ms. Allocated memory is still 100.7 MB. Free memory was 75.8 MB in the beginning and 75.0 MB in the end (delta: 750.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 239.51 ms. Allocated memory is still 100.7 MB. Free memory was 74.8 MB in the beginning and 71.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 53277.09 ms. Allocated memory was 100.7 MB in the beginning and 654.3 MB in the end (delta: 553.6 MB). Free memory was 71.2 MB in the beginning and 494.8 MB in the end (delta: -423.7 MB). Peak memory consumption was 406.5 MB. Max. memory is 16.1 GB. * Witness Printer took 29.79 ms. Allocated memory is still 654.3 MB. Free memory was 494.8 MB in the beginning and 492.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 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: 8 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 49.5s, OverallIterations: 19, TraceHistogramMax: 44, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 577 SDtfs, 1853 SDslu, 7017 SDs, 0 SdLazy, 10967 SolverSat, 2481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10792 GetRequests, 10020 SyntacticMatches, 138 SemanticMatches, 634 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 448 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 1103 PreInvPairs, 1799 NumberOfFragments, 167 HoareAnnotationTreeSize, 1103 FomulaSimplifications, 51484 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 39830 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 10217 NumberOfCodeBlocks, 9078 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 15263 ConstructedInterpolants, 0 QuantifiedInterpolants, 10103496 SizeOfPredicates, 109 NumberOfNonLiveVariables, 9063 ConjunctsInSsa, 478 ConjunctsInUnsatCore, 53 InterpolantComputations, 2 PerfectInterpolantSequences, 172285/197283 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...