./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci01-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:33:17,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:33:17,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:33:17,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:33:17,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:33:17,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:33:17,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:33:17,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:33:17,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:33:17,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:33:17,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:33:17,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:33:17,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:33:17,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:33:17,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:33:17,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:33:17,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:33:17,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:33:17,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:33:17,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:33:17,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:33:17,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:33:17,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:33:17,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:33:17,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:33:17,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:33:17,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:33:17,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:33:17,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:33:17,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:33:17,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:33:17,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:33:17,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:33:17,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:33:17,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:33:17,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:33:17,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:33:17,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:33:17,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:33:17,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:33:17,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:33:17,944 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 22:33:17,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:33:17,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:33:17,969 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:33:17,970 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:33:17,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:33:17,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:33:17,971 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:33:17,971 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:33:17,971 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:33:17,972 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:33:17,972 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:33:17,972 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:33:17,972 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:33:17,973 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:33:17,973 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:33:17,973 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:33:17,973 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:33:17,974 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:33:17,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:33:17,975 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:33:17,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:33:17,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:33:17,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:33:17,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:33:17,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:33:17,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:33:17,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:33:17,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:33:17,977 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:33:17,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:33:17,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:33:17,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:33:17,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:33:17,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:33:17,978 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:33:17,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:33:17,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:33:17,979 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:33:17,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:33:17,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:33:17,980 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:33:17,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 [2022-11-25 22:33:18,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:33:18,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:33:18,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:33:18,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:33:18,260 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:33:18,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/recursive/Fibonacci01-1.c [2022-11-25 22:33:21,497 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:33:21,827 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:33:21,828 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/sv-benchmarks/c/recursive/Fibonacci01-1.c [2022-11-25 22:33:21,836 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/data/11334fb55/d8594b0bd788495e9436ad67fbe4307f/FLAGec2d2f737 [2022-11-25 22:33:21,860 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/data/11334fb55/d8594b0bd788495e9436ad67fbe4307f [2022-11-25 22:33:21,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:33:21,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:33:21,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:33:21,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:33:21,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:33:21,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:33:21" (1/1) ... [2022-11-25 22:33:21,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec4b8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:21, skipping insertion in model container [2022-11-25 22:33:21,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:33:21" (1/1) ... [2022-11-25 22:33:21,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:33:21,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:33:22,094 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2022-11-25 22:33:22,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:33:22,111 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:33:22,128 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2022-11-25 22:33:22,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:33:22,144 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:33:22,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22 WrapperNode [2022-11-25 22:33:22,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:33:22,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:33:22,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:33:22,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:33:22,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,188 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-11-25 22:33:22,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:33:22,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:33:22,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:33:22,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:33:22,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,225 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:33:22,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:33:22,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:33:22,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:33:22,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (1/1) ... [2022-11-25 22:33:22,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:33:22,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:22,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:33:22,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:33:22,337 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-11-25 22:33:22,337 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-11-25 22:33:22,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:33:22,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:33:22,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:33:22,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:33:22,427 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:33:22,429 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:33:22,585 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:33:22,603 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:33:22,603 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 22:33:22,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:33:22 BoogieIcfgContainer [2022-11-25 22:33:22,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:33:22,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:33:22,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:33:22,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:33:22,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:33:21" (1/3) ... [2022-11-25 22:33:22,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7739b687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:33:22, skipping insertion in model container [2022-11-25 22:33:22,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:33:22" (2/3) ... [2022-11-25 22:33:22,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7739b687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:33:22, skipping insertion in model container [2022-11-25 22:33:22,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:33:22" (3/3) ... [2022-11-25 22:33:22,636 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2022-11-25 22:33:22,661 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:33:22,662 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 22:33:22,726 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:33:22,734 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1bf764a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:33:22,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 22:33:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:33:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 22:33:22,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:22,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:22,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1216674335, now seen corresponding path program 1 times [2022-11-25 22:33:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:22,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033713307] [2022-11-25 22:33:22,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:23,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:23,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033713307] [2022-11-25 22:33:23,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033713307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:33:23,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:33:23,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:33:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86285656] [2022-11-25 22:33:23,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:33:23,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:33:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:23,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:33:23,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:33:23,265 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:33:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:23,507 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-25 22:33:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:33:23,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-25 22:33:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:23,520 INFO L225 Difference]: With dead ends: 28 [2022-11-25 22:33:23,520 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 22:33:23,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:33:23,528 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:23,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:33:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 22:33:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-25 22:33:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 22:33:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-25 22:33:23,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-11-25 22:33:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:23,579 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-25 22:33:23,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:33:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-25 22:33:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:33:23,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:23,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:23,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:33:23,582 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1629096597, now seen corresponding path program 1 times [2022-11-25 22:33:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:23,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252473026] [2022-11-25 22:33:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:23,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:23,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252473026] [2022-11-25 22:33:23,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252473026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:33:23,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:33:23,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:33:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753413210] [2022-11-25 22:33:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:33:23,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:33:23,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:23,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:33:23,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:33:23,751 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:33:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:23,875 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-25 22:33:23,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:33:23,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-25 22:33:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:23,877 INFO L225 Difference]: With dead ends: 24 [2022-11-25 22:33:23,878 INFO L226 Difference]: Without dead ends: 20 [2022-11-25 22:33:23,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:33:23,880 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:23,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 31 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:33:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-25 22:33:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-25 22:33:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 22:33:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-25 22:33:23,889 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-11-25 22:33:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:23,890 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-25 22:33:23,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:33:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-25 22:33:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 22:33:23,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:23,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:23,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:33:23,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:23,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash 161002844, now seen corresponding path program 1 times [2022-11-25 22:33:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:23,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971893036] [2022-11-25 22:33:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:33:24,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:24,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971893036] [2022-11-25 22:33:24,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971893036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:24,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664073937] [2022-11-25 22:33:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:24,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:24,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:24,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:24,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 22:33:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:24,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:33:24,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:33:24,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:33:25,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664073937] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:25,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [437393968] [2022-11-25 22:33:25,211 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 22:33:25,212 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:33:25,217 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 22:33:25,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:25,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2022-11-25 22:33:25,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522406280] [2022-11-25 22:33:25,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:25,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 22:33:25,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:25,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 22:33:25,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-11-25 22:33:25,225 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-25 22:33:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:25,465 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-11-25 22:33:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:33:25,466 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2022-11-25 22:33:25,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:25,469 INFO L225 Difference]: With dead ends: 35 [2022-11-25 22:33:25,469 INFO L226 Difference]: Without dead ends: 20 [2022-11-25 22:33:25,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-11-25 22:33:25,477 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:25,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 82 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:33:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-25 22:33:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-25 22:33:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 22:33:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-11-25 22:33:25,497 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-11-25 22:33:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:25,497 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-11-25 22:33:25,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-25 22:33:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-11-25 22:33:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 22:33:25,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:25,499 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:25,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:25,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:25,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash 592483530, now seen corresponding path program 1 times [2022-11-25 22:33:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:25,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396453858] [2022-11-25 22:33:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 22:33:25,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:25,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396453858] [2022-11-25 22:33:25,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396453858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:25,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117952907] [2022-11-25 22:33:25,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:25,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:25,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:25,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:26,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 22:33:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:26,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:33:26,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 22:33:26,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:33:26,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117952907] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:26,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1936532786] [2022-11-25 22:33:26,779 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 22:33:26,779 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:33:26,780 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 22:33:26,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:26,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2022-11-25 22:33:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845666555] [2022-11-25 22:33:26,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:26,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 22:33:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:26,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 22:33:26,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-11-25 22:33:26,788 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-25 22:33:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:27,097 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-11-25 22:33:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:33:27,098 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 24 [2022-11-25 22:33:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:27,104 INFO L225 Difference]: With dead ends: 31 [2022-11-25 22:33:27,104 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 22:33:27,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-11-25 22:33:27,108 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:27,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 72 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:33:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 22:33:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-11-25 22:33:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-25 22:33:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-11-25 22:33:27,126 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2022-11-25 22:33:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:27,128 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-11-25 22:33:27,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-25 22:33:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-11-25 22:33:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 22:33:27,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:27,135 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:27,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 22:33:27,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-25 22:33:27,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1310194259, now seen corresponding path program 2 times [2022-11-25 22:33:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:27,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717173724] [2022-11-25 22:33:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 22:33:27,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:27,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717173724] [2022-11-25 22:33:27,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717173724] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:27,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686331104] [2022-11-25 22:33:27,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:33:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:27,513 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:27,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 22:33:27,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 22:33:27,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:33:27,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 22:33:27,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 22:33:27,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 22:33:28,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686331104] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:28,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1049081766] [2022-11-25 22:33:28,627 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 22:33:28,628 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:33:28,628 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 22:33:28,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:28,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 27 [2022-11-25 22:33:28,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451610508] [2022-11-25 22:33:28,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:28,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 22:33:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:28,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 22:33:28,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2022-11-25 22:33:28,635 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 21 states have internal predecessors, (49), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-25 22:33:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:29,221 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2022-11-25 22:33:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 22:33:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 21 states have internal predecessors, (49), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) Word has length 37 [2022-11-25 22:33:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:29,224 INFO L225 Difference]: With dead ends: 53 [2022-11-25 22:33:29,224 INFO L226 Difference]: Without dead ends: 31 [2022-11-25 22:33:29,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 22:33:29,226 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:29,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 126 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:33:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-25 22:33:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-11-25 22:33:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-25 22:33:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-11-25 22:33:29,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 37 [2022-11-25 22:33:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:29,235 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-11-25 22:33:29,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 21 states have internal predecessors, (49), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-25 22:33:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-11-25 22:33:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 22:33:29,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:29,237 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:29,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:29,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:29,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash 651238953, now seen corresponding path program 3 times [2022-11-25 22:33:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:29,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103557972] [2022-11-25 22:33:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 22:33:29,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:29,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103557972] [2022-11-25 22:33:29,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103557972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:29,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953963733] [2022-11-25 22:33:29,792 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 22:33:29,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:29,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:29,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:29,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 22:33:29,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 22:33:29,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:33:29,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 22:33:29,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 22:33:30,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 22:33:31,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953963733] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:31,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [182305120] [2022-11-25 22:33:31,047 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 22:33:31,047 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:33:31,048 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 22:33:31,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:31,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 29 [2022-11-25 22:33:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085669152] [2022-11-25 22:33:31,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:31,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 22:33:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 22:33:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2022-11-25 22:33:31,056 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 21 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 9 states have return successors, (14), 12 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-25 22:33:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:31,649 INFO L93 Difference]: Finished difference Result 53 states and 85 transitions. [2022-11-25 22:33:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 22:33:31,650 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 21 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 9 states have return successors, (14), 12 states have call predecessors, (14), 8 states have call successors, (14) Word has length 38 [2022-11-25 22:33:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:31,652 INFO L225 Difference]: With dead ends: 53 [2022-11-25 22:33:31,653 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 22:33:31,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=330, Invalid=1650, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 22:33:31,655 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:31,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 87 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:33:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 22:33:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-11-25 22:33:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2022-11-25 22:33:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2022-11-25 22:33:31,668 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 38 [2022-11-25 22:33:31,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:31,669 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2022-11-25 22:33:31,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 21 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 9 states have return successors, (14), 12 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-25 22:33:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2022-11-25 22:33:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 22:33:31,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:31,672 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:31,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:31,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:31,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash 240837571, now seen corresponding path program 4 times [2022-11-25 22:33:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:31,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706749827] [2022-11-25 22:33:31,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:31,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 42 proven. 46 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-25 22:33:31,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:31,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706749827] [2022-11-25 22:33:31,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706749827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:31,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982765818] [2022-11-25 22:33:31,991 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 22:33:31,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:31,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:31,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:32,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 22:33:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:32,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:33:32,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 42 proven. 46 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-25 22:33:32,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 42 proven. 46 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-25 22:33:32,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982765818] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:32,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [906536919] [2022-11-25 22:33:32,367 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 22:33:32,368 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:33:32,368 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 22:33:32,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:32,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-11-25 22:33:32,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168509184] [2022-11-25 22:33:32,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:32,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:33:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:32,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:33:32,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:33:32,373 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 22:33:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:32,502 INFO L93 Difference]: Finished difference Result 70 states and 132 transitions. [2022-11-25 22:33:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:33:32,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2022-11-25 22:33:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:32,504 INFO L225 Difference]: With dead ends: 70 [2022-11-25 22:33:32,505 INFO L226 Difference]: Without dead ends: 37 [2022-11-25 22:33:32,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-11-25 22:33:32,507 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:32,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 32 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:33:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-25 22:33:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-25 22:33:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (22), 9 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-25 22:33:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2022-11-25 22:33:32,516 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 66 [2022-11-25 22:33:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:32,516 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2022-11-25 22:33:32,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 22:33:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2022-11-25 22:33:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-25 22:33:32,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:32,519 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:32,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:32,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:32,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1360547340, now seen corresponding path program 5 times [2022-11-25 22:33:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:32,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435895861] [2022-11-25 22:33:32,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:32,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 55 proven. 93 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-25 22:33:32,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:32,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435895861] [2022-11-25 22:33:32,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435895861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:32,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814695497] [2022-11-25 22:33:32,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:33:32,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:32,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:32,926 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:32,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 22:33:33,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-25 22:33:33,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:33:33,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:33:33,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 134 proven. 17 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-25 22:33:33,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 134 proven. 18 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-25 22:33:33,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814695497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:33,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1243838452] [2022-11-25 22:33:33,642 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 22:33:33,642 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:33:33,643 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 22:33:33,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:33,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2022-11-25 22:33:33,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687052649] [2022-11-25 22:33:33,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:33,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 22:33:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:33,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 22:33:33,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-25 22:33:33,645 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 8 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-25 22:33:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:33,972 INFO L93 Difference]: Finished difference Result 79 states and 127 transitions. [2022-11-25 22:33:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 22:33:33,972 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 8 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Word has length 79 [2022-11-25 22:33:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:33,974 INFO L225 Difference]: With dead ends: 79 [2022-11-25 22:33:33,974 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 22:33:33,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2022-11-25 22:33:33,976 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:33,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 88 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:33:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 22:33:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-25 22:33:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-25 22:33:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-11-25 22:33:33,984 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 79 [2022-11-25 22:33:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:33,985 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-25 22:33:33,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 8 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-25 22:33:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-11-25 22:33:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-25 22:33:33,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:33,987 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:33,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 22:33:34,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 22:33:34,193 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:34,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2071546414, now seen corresponding path program 6 times [2022-11-25 22:33:34,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:34,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392805828] [2022-11-25 22:33:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:34,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 101 proven. 213 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-11-25 22:33:34,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:34,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392805828] [2022-11-25 22:33:34,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392805828] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:34,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668605073] [2022-11-25 22:33:34,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 22:33:34,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:34,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:34,517 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:34,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 22:33:34,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 22:33:34,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:33:34,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 22:33:34,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 116 proven. 229 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-11-25 22:33:34,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 116 proven. 241 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-11-25 22:33:35,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668605073] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:35,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2070400157] [2022-11-25 22:33:35,717 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 22:33:35,717 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:33:35,717 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 22:33:35,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:35,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2022-11-25 22:33:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145045761] [2022-11-25 22:33:35,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:35,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 22:33:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 22:33:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-11-25 22:33:35,722 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) [2022-11-25 22:33:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:36,146 INFO L93 Difference]: Finished difference Result 100 states and 142 transitions. [2022-11-25 22:33:36,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 22:33:36,147 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) Word has length 106 [2022-11-25 22:33:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:36,148 INFO L225 Difference]: With dead ends: 100 [2022-11-25 22:33:36,148 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 22:33:36,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2022-11-25 22:33:36,150 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 79 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:36,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 83 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:33:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 22:33:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2022-11-25 22:33:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (18), 10 states have call predecessors, (18), 8 states have call successors, (18) [2022-11-25 22:33:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-11-25 22:33:36,161 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 106 [2022-11-25 22:33:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:36,161 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-11-25 22:33:36,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) [2022-11-25 22:33:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-11-25 22:33:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-25 22:33:36,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:36,164 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:36,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:36,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:36,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:36,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1101187310, now seen corresponding path program 7 times [2022-11-25 22:33:36,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:36,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109731010] [2022-11-25 22:33:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 181 proven. 305 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-11-25 22:33:36,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:36,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109731010] [2022-11-25 22:33:36,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109731010] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:36,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051580697] [2022-11-25 22:33:36,818 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 22:33:36,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:36,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:36,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:36,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 22:33:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:36,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 22:33:36,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 356 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-11-25 22:33:37,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 383 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-11-25 22:33:38,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051580697] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:38,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [81560804] [2022-11-25 22:33:38,688 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 22:33:38,688 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:33:38,688 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 22:33:38,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:38,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 24 [2022-11-25 22:33:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256328415] [2022-11-25 22:33:38,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 22:33:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 22:33:38,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2022-11-25 22:33:38,693 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (27), 11 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-25 22:33:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:39,259 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2022-11-25 22:33:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 22:33:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (27), 11 states have call predecessors, (27), 17 states have call successors, (27) Word has length 133 [2022-11-25 22:33:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:39,261 INFO L225 Difference]: With dead ends: 121 [2022-11-25 22:33:39,261 INFO L226 Difference]: Without dead ends: 75 [2022-11-25 22:33:39,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 250 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 22:33:39,263 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 98 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:39,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 109 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:33:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-25 22:33:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2022-11-25 22:33:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0625) internal successors, (51), 45 states have internal predecessors, (51), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (31), 14 states have call predecessors, (31), 11 states have call successors, (31) [2022-11-25 22:33:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2022-11-25 22:33:39,276 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 133 [2022-11-25 22:33:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:39,276 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2022-11-25 22:33:39,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (27), 11 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-25 22:33:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2022-11-25 22:33:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-25 22:33:39,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:39,279 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:39,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:39,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 22:33:39,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:33:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1526876107, now seen corresponding path program 8 times [2022-11-25 22:33:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:39,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311986612] [2022-11-25 22:33:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 77 proven. 845 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2022-11-25 22:33:41,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311986612] [2022-11-25 22:33:41,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311986612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731435533] [2022-11-25 22:33:41,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:33:41,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:41,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:41,277 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:41,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 22:33:41,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-11-25 22:33:41,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:33:41,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 22:33:41,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 476 proven. 283 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-11-25 22:33:42,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 381 proven. 390 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2022-11-25 22:33:50,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731435533] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:50,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1780002509] [2022-11-25 22:33:50,028 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 22:33:50,029 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:33:50,029 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 22:33:50,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:50,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 30] total 61 [2022-11-25 22:33:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644793671] [2022-11-25 22:33:50,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:50,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-25 22:33:50,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-25 22:33:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=3312, Unknown=0, NotChecked=0, Total=3660 [2022-11-25 22:33:50,036 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 61 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 38 states have internal predecessors, (80), 18 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (37), 36 states have call predecessors, (37), 18 states have call successors, (37) [2022-11-25 22:33:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:51,378 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2022-11-25 22:33:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 22:33:51,381 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 38 states have internal predecessors, (80), 18 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (37), 36 states have call predecessors, (37), 18 states have call successors, (37) Word has length 174 [2022-11-25 22:33:51,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:51,382 INFO L225 Difference]: With dead ends: 87 [2022-11-25 22:33:51,383 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 22:33:51,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 310 SyntacticMatches, 36 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4061 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=875, Invalid=6435, Unknown=0, NotChecked=0, Total=7310 [2022-11-25 22:33:51,387 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:51,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:33:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 22:33:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 22:33:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 22:33:51,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2022-11-25 22:33:51,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:51,390 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 22:33:51,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 38 states have internal predecessors, (80), 18 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (37), 36 states have call predecessors, (37), 18 states have call successors, (37) [2022-11-25 22:33:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 22:33:51,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 22:33:51,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 22:33:51,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:51,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 22:33:51,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 22:33:51,906 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2022-11-25 22:33:51,907 INFO L902 garLoopResultBuilder]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2022-11-25 22:33:51,907 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (<= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| fibonacci_~n) (not (<= |fibonacci_#in~n| 1))) [2022-11-25 22:33:51,907 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-11-25 22:33:51,907 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (and (let ((.cse3 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 2))) (.cse0 (<= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= 4 |fibonacci_#in~n|)) (.cse2 (<= |fibonacci_#in~n| fibonacci_~n))) (or (and .cse0 .cse1 (<= |fibonacci_#in~n| 4) .cse2 .cse3) (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1)) .cse1 .cse2) (and .cse0 (= |fibonacci_#t~ret4| 1) .cse2 .cse3) (and (<= 3 |fibonacci_#t~ret4|) (<= fibonacci_~n 5) .cse0 .cse1 .cse2))) (not (<= |fibonacci_#in~n| 1))) [2022-11-25 22:33:51,908 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2022-11-25 22:33:51,908 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-11-25 22:33:51,908 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2022-11-25 22:33:51,908 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2022-11-25 22:33:51,908 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-11-25 22:33:51,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 22:33:51,908 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-11-25 22:33:51,909 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-11-25 22:33:51,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 22:33:51,909 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-11-25 22:33:51,909 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 38) the Hoare annotation is: true [2022-11-25 22:33:51,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-11-25 22:33:51,909 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-11-25 22:33:51,917 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1] [2022-11-25 22:33:51,920 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 22:33:51,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 10:33:51 BoogieIcfgContainer [2022-11-25 22:33:51,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 22:33:51,931 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 22:33:51,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 22:33:51,931 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 22:33:51,932 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:33:22" (3/4) ... [2022-11-25 22:33:51,935 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 22:33:51,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2022-11-25 22:33:51,944 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-25 22:33:51,944 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 22:33:51,945 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 22:33:51,945 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 22:33:51,973 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 22:33:51,973 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 22:33:51,974 INFO L158 Benchmark]: Toolchain (without parser) took 30105.97ms. Allocated memory was 144.7MB in the beginning and 264.2MB in the end (delta: 119.5MB). Free memory was 113.8MB in the beginning and 109.9MB in the end (delta: 3.9MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2022-11-25 22:33:51,974 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 117.4MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:33:51,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.04ms. Allocated memory is still 144.7MB. Free memory was 113.8MB in the beginning and 103.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 22:33:51,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.30ms. Allocated memory is still 144.7MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:33:51,975 INFO L158 Benchmark]: Boogie Preprocessor took 46.73ms. Allocated memory is still 144.7MB. Free memory was 102.0MB in the beginning and 101.3MB in the end (delta: 737.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:33:51,976 INFO L158 Benchmark]: RCFGBuilder took 368.17ms. Allocated memory is still 144.7MB. Free memory was 101.3MB in the beginning and 90.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 22:33:51,976 INFO L158 Benchmark]: TraceAbstraction took 29303.66ms. Allocated memory was 144.7MB in the beginning and 264.2MB in the end (delta: 119.5MB). Free memory was 90.1MB in the beginning and 112.0MB in the end (delta: -21.9MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2022-11-25 22:33:51,976 INFO L158 Benchmark]: Witness Printer took 42.38ms. Allocated memory is still 264.2MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:33:51,978 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.65ms. Allocated memory is still 117.4MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.04ms. Allocated memory is still 144.7MB. Free memory was 113.8MB in the beginning and 103.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.30ms. Allocated memory is still 144.7MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.73ms. Allocated memory is still 144.7MB. Free memory was 102.0MB in the beginning and 101.3MB in the end (delta: 737.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.17ms. Allocated memory is still 144.7MB. Free memory was 101.3MB in the beginning and 90.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29303.66ms. Allocated memory was 144.7MB in the beginning and 264.2MB in the end (delta: 119.5MB). Free memory was 90.1MB in the beginning and 112.0MB in the end (delta: -21.9MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. * Witness Printer took 42.38ms. Allocated memory is still 264.2MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.2s, OverallIterations: 11, TraceHistogramMax: 25, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 970 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 813 mSDsCounter, 539 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2722 IncrementalHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 539 mSolverCounterUnsat, 157 mSDtfsCounter, 2722 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1619 GetRequests, 1215 SyntacticMatches, 78 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5913 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=10, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 38 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 122 PreInvPairs, 174 NumberOfFragments, 84 HoareAnnotationTreeSize, 122 FomulaSimplifications, 874 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 875 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 1381 NumberOfCodeBlocks, 1336 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2032 ConstructedInterpolants, 0 QuantifiedInterpolants, 5057 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1598 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 7625/11313 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 22:33:52,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8148728-fe54-4e6d-9dda-76be86d19045/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE