./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci03.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI --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 be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 --- 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-5e519f3 [2022-11-03 03:44:44,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:44:44,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:44:44,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:44:44,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:44:44,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:44:44,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:44:44,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:44:44,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:44:44,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:44:44,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:44:44,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:44:44,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:44:44,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:44:44,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:44:44,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:44:44,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:44:44,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:44:44,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:44:44,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:44:44,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:44:44,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:44:44,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:44:44,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:44:44,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:44:44,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:44:44,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:44:44,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:44:44,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:44:44,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:44:44,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:44:44,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:44:44,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:44:44,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:44:44,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:44:44,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:44:44,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:44:44,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:44:44,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:44:44,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:44:44,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:44:44,636 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:44:44,681 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:44:44,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:44:44,682 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:44:44,682 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:44:44,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:44:44,684 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:44:44,684 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:44:44,684 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:44:44,685 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:44:44,685 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:44:44,686 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:44:44,686 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:44:44,687 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:44:44,687 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:44:44,687 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:44:44,688 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:44:44,688 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:44:44,688 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:44:44,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:44:44,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:44:44,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:44:44,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:44:44,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:44:44,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:44:44,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:44:44,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:44:44,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:44:44,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:44:44,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:44:44,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:44:44,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:44:44,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:44:44,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:44:44,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:44:44,700 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:44:44,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:44:44,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:44:44,700 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:44:44,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:44:44,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:44:44,701 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:44:44,701 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_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/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_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI 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 -> be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 [2022-11-03 03:44:45,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:44:45,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:44:45,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:44:45,043 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:44:45,043 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:44:45,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/recursive/Fibonacci03.c [2022-11-03 03:44:45,110 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/data/d9dcdd338/51e205831bc14d6282aac54beac0bf09/FLAG5dbcedb1f [2022-11-03 03:44:45,552 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:44:45,552 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/sv-benchmarks/c/recursive/Fibonacci03.c [2022-11-03 03:44:45,558 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/data/d9dcdd338/51e205831bc14d6282aac54beac0bf09/FLAG5dbcedb1f [2022-11-03 03:44:45,928 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/data/d9dcdd338/51e205831bc14d6282aac54beac0bf09 [2022-11-03 03:44:45,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:44:45,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:44:45,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:44:45,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:44:45,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:44:45,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:44:45" (1/1) ... [2022-11-03 03:44:45,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ab2e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:45, skipping insertion in model container [2022-11-03 03:44:45,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:44:45" (1/1) ... [2022-11-03 03:44:45,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:44:45,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:44:46,129 WARN L230 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_e980ad6f-5f19-4bed-906f-967138ca0a67/sv-benchmarks/c/recursive/Fibonacci03.c[788,801] [2022-11-03 03:44:46,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:44:46,140 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:44:46,154 WARN L230 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_e980ad6f-5f19-4bed-906f-967138ca0a67/sv-benchmarks/c/recursive/Fibonacci03.c[788,801] [2022-11-03 03:44:46,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:44:46,167 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:44:46,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46 WrapperNode [2022-11-03 03:44:46,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:44:46,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:44:46,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:44:46,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:44:46,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,200 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-11-03 03:44:46,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:44:46,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:44:46,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:44:46,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:44:46,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,226 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:44:46,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:44:46,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:44:46,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:44:46,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (1/1) ... [2022-11-03 03:44:46,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:44:46,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:46,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:44:46,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:44:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-11-03 03:44:46,326 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-11-03 03:44:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:44:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:44:46,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:44:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:44:46,387 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:44:46,389 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:44:46,483 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:44:46,497 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:44:46,498 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:44:46,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:44:46 BoogieIcfgContainer [2022-11-03 03:44:46,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:44:46,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:44:46,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:44:46,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:44:46,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:44:45" (1/3) ... [2022-11-03 03:44:46,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7b289e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:44:46, skipping insertion in model container [2022-11-03 03:44:46,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:44:46" (2/3) ... [2022-11-03 03:44:46,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7b289e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:44:46, skipping insertion in model container [2022-11-03 03:44:46,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:44:46" (3/3) ... [2022-11-03 03:44:46,510 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2022-11-03 03:44:46,527 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:44:46,528 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:44:46,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:44:46,584 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;@452eefb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:44:46,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:44:46,589 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-03 03:44:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:44:46,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:46,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:46,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:44:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:46,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1216674335, now seen corresponding path program 1 times [2022-11-03 03:44:46,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:46,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875904457] [2022-11-03 03:44:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:46,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:46,980 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-03 03:44:46,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:46,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875904457] [2022-11-03 03:44:46,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875904457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:44:46,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:44:46,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:44:46,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62368413] [2022-11-03 03:44:46,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:44:46,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:44:46,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:47,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:44:47,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:44:47,048 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 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:44:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:47,209 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-03 03:44:47,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:44:47,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-03 03:44:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:47,220 INFO L225 Difference]: With dead ends: 28 [2022-11-03 03:44:47,220 INFO L226 Difference]: Without dead ends: 18 [2022-11-03 03:44:47,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:44:47,229 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:47,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:44:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-03 03:44:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-03 03:44:47,271 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-03 03:44:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-03 03:44:47,276 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-11-03 03:44:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:47,277 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-03 03:44:47,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:44:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-03 03:44:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:44:47,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:47,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:47,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:44:47,282 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:44:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:47,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1629096597, now seen corresponding path program 1 times [2022-11-03 03:44:47,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:47,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094009496] [2022-11-03 03:44:47,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:47,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:47,415 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-03 03:44:47,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:47,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094009496] [2022-11-03 03:44:47,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094009496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:44:47,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:44:47,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:44:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744307627] [2022-11-03 03:44:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:44:47,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:44:47,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:47,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:44:47,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:44:47,419 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) 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-03 03:44:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:47,477 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-03 03:44:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:44:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) 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-03 03:44:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:47,479 INFO L225 Difference]: With dead ends: 24 [2022-11-03 03:44:47,479 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 03:44:47,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:44:47,481 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:47,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:44:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 03:44:47,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-03 03:44:47,487 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-03 03:44:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-03 03:44:47,488 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-11-03 03:44:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:47,489 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-03 03:44:47,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) 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-03 03:44:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-03 03:44:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:44:47,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:47,491 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-03 03:44:47,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:44:47,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:44:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash 161002844, now seen corresponding path program 1 times [2022-11-03 03:44:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:47,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540991390] [2022-11-03 03:44:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:47,629 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-03 03:44:47,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:47,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540991390] [2022-11-03 03:44:47,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540991390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:47,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568712044] [2022-11-03 03:44:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:47,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:47,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:47,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:47,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:44:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:47,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:44:47,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:47,801 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-03 03:44:47,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:44:48,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568712044] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:48,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [664161425] [2022-11-03 03:44:48,096 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:44:48,096 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:44:48,101 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:336) 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-03 03:44:48,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:44:48,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-11-03 03:44:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002765192] [2022-11-03 03:44:48,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:44:48,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 03:44:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:48,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 03:44:48,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:44:48,113 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-03 03:44:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:48,294 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-11-03 03:44:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:44:48,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2022-11-03 03:44:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:48,299 INFO L225 Difference]: With dead ends: 42 [2022-11-03 03:44:48,299 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 03:44:48,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:44:48,304 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:48,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:44:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 03:44:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-03 03:44:48,323 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-03 03:44:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-11-03 03:44:48,329 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 23 [2022-11-03 03:44:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:48,329 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-11-03 03:44:48,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-03 03:44:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-11-03 03:44:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-03 03:44:48,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:48,335 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:48,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:44:48,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:48,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:44:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash -801544853, now seen corresponding path program 1 times [2022-11-03 03:44:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:48,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871695177] [2022-11-03 03:44:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-03 03:44:48,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:48,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871695177] [2022-11-03 03:44:48,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871695177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:48,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382113400] [2022-11-03 03:44:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:48,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:48,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:48,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:48,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:44:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:48,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:44:48,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-03 03:44:48,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-03 03:44:49,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382113400] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:49,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [680089373] [2022-11-03 03:44:49,281 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:44:49,281 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:44:49,282 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:336) 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-03 03:44:49,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:44:49,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2022-11-03 03:44:49,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278153409] [2022-11-03 03:44:49,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:44:49,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 03:44:49,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:49,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 03:44:49,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:44:49,284 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-03 03:44:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:49,458 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. [2022-11-03 03:44:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:44:49,459 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 64 [2022-11-03 03:44:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:49,461 INFO L225 Difference]: With dead ends: 44 [2022-11-03 03:44:49,461 INFO L226 Difference]: Without dead ends: 38 [2022-11-03 03:44:49,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:44:49,463 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:49,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 59 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:44:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-03 03:44:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-11-03 03:44:49,471 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, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2022-11-03 03:44:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2022-11-03 03:44:49,472 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 60 transitions. Word has length 64 [2022-11-03 03:44:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:49,473 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 60 transitions. [2022-11-03 03:44:49,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-03 03:44:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 60 transitions. [2022-11-03 03:44:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-11-03 03:44:49,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:49,488 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 17, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:49,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:44:49,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:49,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:44:49,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash 494319388, now seen corresponding path program 2 times [2022-11-03 03:44:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:49,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375953983] [2022-11-03 03:44:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 86 proven. 486 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2022-11-03 03:44:50,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:50,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375953983] [2022-11-03 03:44:50,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375953983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:50,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298639024] [2022-11-03 03:44:50,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:44:50,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:50,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:50,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:50,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:44:50,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-03 03:44:50,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:44:50,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:44:50,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 603 proven. 12 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2022-11-03 03:44:50,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 513 proven. 25 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2022-11-03 03:44:51,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298639024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:51,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1631721328] [2022-11-03 03:44:51,297 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:44:51,297 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:44:51,298 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:336) 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-03 03:44:51,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:44:51,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-11-03 03:44:51,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973569676] [2022-11-03 03:44:51,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:44:51,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:44:51,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:51,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:44:51,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:44:51,301 INFO L87 Difference]: Start difference. First operand 35 states and 60 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 11 states have call successors, (14), 2 states have call predecessors, (14), 10 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) [2022-11-03 03:44:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:51,774 INFO L93 Difference]: Finished difference Result 87 states and 174 transitions. [2022-11-03 03:44:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 03:44:51,775 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 11 states have call successors, (14), 2 states have call predecessors, (14), 10 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) Word has length 183 [2022-11-03 03:44:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:51,777 INFO L225 Difference]: With dead ends: 87 [2022-11-03 03:44:51,777 INFO L226 Difference]: Without dead ends: 55 [2022-11-03 03:44:51,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 358 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 03:44:51,780 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 79 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:51,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 91 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:44:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-03 03:44:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-03 03:44:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-03 03:44:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-11-03 03:44:51,791 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 183 [2022-11-03 03:44:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:51,792 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-11-03 03:44:51,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 11 states have call successors, (14), 2 states have call predecessors, (14), 10 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) [2022-11-03 03:44:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-11-03 03:44:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-11-03 03:44:51,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:51,794 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:51,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:44:52,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:52,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:44:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1752708135, now seen corresponding path program 3 times [2022-11-03 03:44:52,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:52,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025623281] [2022-11-03 03:44:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2022-11-03 03:44:52,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:52,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025623281] [2022-11-03 03:44:52,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025623281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62547635] [2022-11-03 03:44:52,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:44:52,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:52,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:52,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:44:52,514 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:44:52,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:44:52,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 03:44:52,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 453 proven. 734 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2022-11-03 03:44:52,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 453 proven. 782 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2022-11-03 03:44:55,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62547635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:55,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [403920375] [2022-11-03 03:44:55,313 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:44:55,313 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:44:55,314 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:336) 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-03 03:44:55,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:44:55,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 23] total 27 [2022-11-03 03:44:55,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997582120] [2022-11-03 03:44:55,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:44:55,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:44:55,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:55,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:44:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-11-03 03:44:55,318 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 21 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) [2022-11-03 03:44:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:56,225 INFO L93 Difference]: Finished difference Result 134 states and 225 transitions. [2022-11-03 03:44:56,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 03:44:56,226 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 21 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) Word has length 201 [2022-11-03 03:44:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:56,229 INFO L225 Difference]: With dead ends: 134 [2022-11-03 03:44:56,229 INFO L226 Difference]: Without dead ends: 82 [2022-11-03 03:44:56,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 379 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=564, Invalid=1692, Unknown=0, NotChecked=0, Total=2256 [2022-11-03 03:44:56,232 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 341 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:56,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 141 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:44:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-03 03:44:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-11-03 03:44:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 53 states have internal predecessors, (59), 13 states have call successors, (13), 11 states have call predecessors, (13), 8 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) [2022-11-03 03:44:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2022-11-03 03:44:56,246 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 201 [2022-11-03 03:44:56,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:56,247 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2022-11-03 03:44:56,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 21 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (32), 13 states have call predecessors, (32), 21 states have call successors, (32) [2022-11-03 03:44:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2022-11-03 03:44:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-11-03 03:44:56,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:56,252 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:56,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:44:56,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 03:44:56,466 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:44:56,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 953177853, now seen corresponding path program 4 times [2022-11-03 03:44:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:56,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987406039] [2022-11-03 03:44:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:56,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-11-03 03:44:57,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:57,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987406039] [2022-11-03 03:44:57,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987406039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:57,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914427322] [2022-11-03 03:44:57,027 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:44:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:57,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:57,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:57,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:44:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:57,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 03:44:57,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-11-03 03:44:57,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2022-11-03 03:44:59,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914427322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:59,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1000254329] [2022-11-03 03:44:59,594 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:44:59,594 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:44:59,595 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:336) 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-03 03:44:59,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:44:59,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2022-11-03 03:44:59,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932849903] [2022-11-03 03:44:59,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:44:59,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:44:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:44:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:44:59,603 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 15 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (23), 10 states have call predecessors, (23), 15 states have call successors, (23) [2022-11-03 03:44:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:59,896 INFO L93 Difference]: Finished difference Result 94 states and 138 transitions. [2022-11-03 03:44:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 03:44:59,896 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), 15 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (23), 10 states have call predecessors, (23), 15 states have call successors, (23) Word has length 283 [2022-11-03 03:44:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:59,920 INFO L225 Difference]: With dead ends: 94 [2022-11-03 03:44:59,920 INFO L226 Difference]: Without dead ends: 88 [2022-11-03 03:44:59,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 557 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=510, Unknown=0, NotChecked=0, Total=756 [2022-11-03 03:44:59,922 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 132 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:59,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 83 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:44:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-03 03:44:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-03 03:44:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 59 states have internal predecessors, (65), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (51), 17 states have call predecessors, (51), 15 states have call successors, (51) [2022-11-03 03:44:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2022-11-03 03:44:59,962 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 283 [2022-11-03 03:44:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:59,964 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2022-11-03 03:44:59,964 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), 15 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (23), 10 states have call predecessors, (23), 15 states have call successors, (23) [2022-11-03 03:44:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2022-11-03 03:45:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2022-11-03 03:45:00,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:45:00,024 INFO L195 NwaCegarLoop]: trace histogram [171, 171, 138, 85, 85, 85, 85, 85, 85, 85, 53, 33, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:45:00,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:45:00,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:45:00,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:45:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:45:00,238 INFO L85 PathProgramCache]: Analyzing trace with hash 826976910, now seen corresponding path program 5 times [2022-11-03 03:45:00,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:45:00,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195384868] [2022-11-03 03:45:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:45:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:45:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:45:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 81873 backedges. 1699 proven. 9031 refuted. 0 times theorem prover too weak. 71143 trivial. 0 not checked. [2022-11-03 03:45:03,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:45:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195384868] [2022-11-03 03:45:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195384868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:45:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149424798] [2022-11-03 03:45:03,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:45:03,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:45:03,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:45:03,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:45:03,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:45:04,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2022-11-03 03:45:04,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:45:04,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 03:45:04,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:45:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 81873 backedges. 19848 proven. 685 refuted. 0 times theorem prover too weak. 61340 trivial. 0 not checked. [2022-11-03 03:45:04,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:45:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 81873 backedges. 6991 proven. 1397 refuted. 0 times theorem prover too weak. 73485 trivial. 0 not checked. [2022-11-03 03:45:09,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149424798] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:45:09,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [389993392] [2022-11-03 03:45:09,135 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:45:09,136 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:45:09,136 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java: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:336) 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-03 03:45:09,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:45:09,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 19] total 28 [2022-11-03 03:45:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784350727] [2022-11-03 03:45:09,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:45:09,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 03:45:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:45:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 03:45:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2022-11-03 03:45:09,142 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 20 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) [2022-11-03 03:45:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:45:09,986 INFO L93 Difference]: Finished difference Result 199 states and 344 transitions. [2022-11-03 03:45:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-03 03:45:09,986 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 20 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) Word has length 1168 [2022-11-03 03:45:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:45:09,988 INFO L225 Difference]: With dead ends: 199 [2022-11-03 03:45:09,989 INFO L226 Difference]: Without dead ends: 116 [2022-11-03 03:45:09,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2386 GetRequests, 2324 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=717, Invalid=2253, Unknown=0, NotChecked=0, Total=2970 [2022-11-03 03:45:09,991 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 219 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:45:09,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 132 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:45:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-03 03:45:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2022-11-03 03:45:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.056338028169014) internal successors, (75), 68 states have internal predecessors, (75), 18 states have call successors, (18), 14 states have call predecessors, (18), 10 states have return successors, (46), 17 states have call predecessors, (46), 18 states have call successors, (46) [2022-11-03 03:45:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2022-11-03 03:45:10,005 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 1168 [2022-11-03 03:45:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:45:10,006 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2022-11-03 03:45:10,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 20 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) [2022-11-03 03:45:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2022-11-03 03:45:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2022-11-03 03:45:10,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:45:10,033 INFO L195 NwaCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:45:10,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:45:10,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:45:10,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:45:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:45:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1965175321, now seen corresponding path program 6 times [2022-11-03 03:45:10,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:45:10,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388389573] [2022-11-03 03:45:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:45:10,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:45:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:45:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 3187 proven. 6174 refuted. 0 times theorem prover too weak. 34253 trivial. 0 not checked. [2022-11-03 03:45:12,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:45:12,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388389573] [2022-11-03 03:45:12,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388389573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:45:12,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939788346] [2022-11-03 03:45:12,778 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:45:12,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:45:12,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:45:12,780 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:45:12,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:45:13,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:45:13,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:45:13,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 03:45:13,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:45:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 3735 proven. 6599 refuted. 0 times theorem prover too weak. 33280 trivial. 0 not checked. [2022-11-03 03:45:13,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:45:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 3735 proven. 6746 refuted. 0 times theorem prover too weak. 33133 trivial. 0 not checked. [2022-11-03 03:45:21,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939788346] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:45:21,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [452080921] [2022-11-03 03:45:21,027 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:45:21,027 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:45:21,027 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:336) 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-03 03:45:21,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:45:21,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 35] total 40 [2022-11-03 03:45:21,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102373280] [2022-11-03 03:45:21,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:45:21,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 03:45:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:45:21,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 03:45:21,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 03:45:21,036 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 40 states, 40 states have (on average 3.025) internal successors, (121), 40 states have internal predecessors, (121), 33 states have call successors, (37), 1 states have call predecessors, (37), 18 states have return successors, (51), 19 states have call predecessors, (51), 33 states have call successors, (51) [2022-11-03 03:45:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:45:22,418 INFO L93 Difference]: Finished difference Result 258 states and 499 transitions. [2022-11-03 03:45:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-03 03:45:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.025) internal successors, (121), 40 states have internal predecessors, (121), 33 states have call successors, (37), 1 states have call predecessors, (37), 18 states have return successors, (51), 19 states have call predecessors, (51), 33 states have call successors, (51) Word has length 855 [2022-11-03 03:45:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:45:22,422 INFO L225 Difference]: With dead ends: 258 [2022-11-03 03:45:22,422 INFO L226 Difference]: Without dead ends: 163 [2022-11-03 03:45:22,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1777 GetRequests, 1686 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1360, Invalid=4340, Unknown=0, NotChecked=0, Total=5700 [2022-11-03 03:45:22,426 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 392 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:45:22,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 209 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 03:45:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-03 03:45:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2022-11-03 03:45:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 87 states have internal predecessors, (93), 25 states have call successors, (25), 20 states have call predecessors, (25), 10 states have return successors, (64), 18 states have call predecessors, (64), 25 states have call successors, (64) [2022-11-03 03:45:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2022-11-03 03:45:22,442 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 855 [2022-11-03 03:45:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:45:22,443 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2022-11-03 03:45:22,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.025) internal successors, (121), 40 states have internal predecessors, (121), 33 states have call successors, (37), 1 states have call predecessors, (37), 18 states have return successors, (51), 19 states have call predecessors, (51), 33 states have call successors, (51) [2022-11-03 03:45:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2022-11-03 03:45:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2022-11-03 03:45:22,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:45:22,449 INFO L195 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:45:22,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:45:22,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:45:22,674 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:45:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:45:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash -600231419, now seen corresponding path program 7 times [2022-11-03 03:45:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:45:22,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853647568] [2022-11-03 03:45:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:45:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:45:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:45:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 2756 proven. 10117 refuted. 0 times theorem prover too weak. 20223 trivial. 0 not checked. [2022-11-03 03:45:36,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:45:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853647568] [2022-11-03 03:45:36,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853647568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:45:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442224064] [2022-11-03 03:45:36,395 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:45:36,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:45:36,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:45:36,403 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:45:36,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:45:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:45:36,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 220 conjunts are in the unsatisfiable core [2022-11-03 03:45:36,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:45:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2022-11-03 03:45:37,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:47:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2022-11-03 03:47:04,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442224064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:47:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [460203028] [2022-11-03 03:47:04,074 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:47:04,074 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:47:04,075 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:336) 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-03 03:47:04,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:47:04,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 41 [2022-11-03 03:47:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739258830] [2022-11-03 03:47:04,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:47:04,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 03:47:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 03:47:04,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1370, Unknown=0, NotChecked=0, Total=1640 [2022-11-03 03:47:04,079 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 22 states have internal predecessors, (49), 9 states have call successors, (10), 1 states have call predecessors, (10), 11 states have return successors, (27), 27 states have call predecessors, (27), 9 states have call successors, (27) [2022-11-03 03:47:04,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:04,354 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2022-11-03 03:47:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 03:47:04,354 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 22 states have internal predecessors, (49), 9 states have call successors, (10), 1 states have call predecessors, (10), 11 states have return successors, (27), 27 states have call predecessors, (27), 9 states have call successors, (27) Word has length 746 [2022-11-03 03:47:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:04,358 INFO L225 Difference]: With dead ends: 127 [2022-11-03 03:47:04,358 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 03:47:04,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1714 GetRequests, 1488 SyntacticMatches, 184 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5437 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=314, Invalid=1578, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 03:47:04,360 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:04,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 324 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:47:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 03:47:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 03:47:04,361 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-03 03:47:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 03:47:04,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 746 [2022-11-03 03:47:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:04,362 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 03:47:04,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 22 states have internal predecessors, (49), 9 states have call successors, (10), 1 states have call predecessors, (10), 11 states have return successors, (27), 27 states have call predecessors, (27), 9 states have call successors, (27) [2022-11-03 03:47:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 03:47:04,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 03:47:04,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 03:47:04,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:47:04,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:47:04,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 03:47:05,214 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2022-11-03 03:47:05,214 INFO L902 garLoopResultBuilder]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2022-11-03 03:47:05,215 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (<= 2 |fibonacci_#in~n|) (<= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| fibonacci_~n)) [2022-11-03 03:47:05,215 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-11-03 03:47:05,218 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse1 (= |fibonacci_#t~ret4| 1)) (.cse0 (<= fibonacci_~n |fibonacci_#in~n|))) (and (or (not (<= |fibonacci_#in~n| 2)) (and .cse0 (< 1 fibonacci_~n) .cse1)) (let ((.cse2 (<= 8 |fibonacci_#in~n|)) (.cse3 (<= |fibonacci_#in~n| fibonacci_~n))) (or (and (<= 3 fibonacci_~n) .cse0 .cse1 (<= |fibonacci_#in~n| 3)) (and .cse2 .cse0 (<= |fibonacci_#in~n| 8) (<= 13 |fibonacci_#t~ret4|) .cse3) (and (<= 5 |fibonacci_#in~n|) (<= 3 |fibonacci_#t~ret4|) .cse0 .cse3 (<= |fibonacci_#in~n| 5)) (not (<= 3 |fibonacci_#in~n|)) (and (<= 2 |fibonacci_#t~ret4|) .cse0 (<= 4 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 4) .cse3) (and .cse2 (<= 21 |fibonacci_#t~ret4|) .cse0 .cse3) (and (<= 5 |fibonacci_#t~ret4|) (<= fibonacci_~n 6) (<= 6 |fibonacci_#in~n|) .cse3) (and (<= 8 |fibonacci_#t~ret4|) (<= fibonacci_~n 7) (<= 7 |fibonacci_#in~n|) .cse3))))) [2022-11-03 03:47:05,218 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2022-11-03 03:47:05,218 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-11-03 03:47:05,218 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2022-11-03 03:47:05,218 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2022-11-03 03:47:05,218 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-11-03 03:47:05,219 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 03:47:05,219 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-11-03 03:47:05,219 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-11-03 03:47:05,219 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 03:47:05,219 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-11-03 03:47:05,219 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 38) the Hoare annotation is: true [2022-11-03 03:47:05,219 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-11-03 03:47:05,220 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-11-03 03:47:05,223 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2022-11-03 03:47:05,225 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:47:05,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:47:05 BoogieIcfgContainer [2022-11-03 03:47:05,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:47:05,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:47:05,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:47:05,233 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:47:05,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:44:46" (3/4) ... [2022-11-03 03:47:05,236 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 03:47:05,242 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2022-11-03 03:47:05,246 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-03 03:47:05,246 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 03:47:05,246 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-03 03:47:05,246 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 03:47:05,275 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:47:05,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:47:05,276 INFO L158 Benchmark]: Toolchain (without parser) took 139344.31ms. Allocated memory was 90.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 67.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2022-11-03 03:47:05,276 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 90.2MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:47:05,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.42ms. Allocated memory is still 90.2MB. Free memory was 67.6MB in the beginning and 66.4MB in the end (delta: 1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:47:05,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.64ms. Allocated memory is still 90.2MB. Free memory was 66.2MB in the beginning and 64.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:47:05,277 INFO L158 Benchmark]: Boogie Preprocessor took 29.46ms. Allocated memory is still 90.2MB. Free memory was 64.9MB in the beginning and 63.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:47:05,277 INFO L158 Benchmark]: RCFGBuilder took 264.55ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 54.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 03:47:05,278 INFO L158 Benchmark]: TraceAbstraction took 138729.35ms. Allocated memory was 90.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 53.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 741.6MB. Max. memory is 16.1GB. [2022-11-03 03:47:05,278 INFO L158 Benchmark]: Witness Printer took 42.66ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:47:05,279 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.24ms. Allocated memory is still 90.2MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.42ms. Allocated memory is still 90.2MB. Free memory was 67.6MB in the beginning and 66.4MB in the end (delta: 1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.64ms. Allocated memory is still 90.2MB. Free memory was 66.2MB in the beginning and 64.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.46ms. Allocated memory is still 90.2MB. Free memory was 64.9MB in the beginning and 63.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 264.55ms. Allocated memory is still 90.2MB. Free memory was 63.8MB in the beginning and 54.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 138729.35ms. Allocated memory was 90.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 53.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 741.6MB. Max. memory is 16.1GB. * Witness Printer took 42.66ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB 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: 138.7s, OverallIterations: 10, TraceHistogramMax: 171, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1253 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1216 mSDsluCounter, 1150 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1025 mSDsCounter, 1523 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2288 IncrementalHoareTripleChecker+Invalid, 3811 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1523 mSolverCounterUnsat, 216 mSDtfsCounter, 2288 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7505 GetRequests, 6962 SyntacticMatches, 234 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8527 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=9, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 62 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 215 PreInvPairs, 315 NumberOfFragments, 134 HoareAnnotationTreeSize, 215 FomulaSimplifications, 1058 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 2830 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 127.8s InterpolantComputationTime, 7067 NumberOfCodeBlocks, 6149 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 10564 ConstructedInterpolants, 0 QuantifiedInterpolants, 16154 SizeOfPredicates, 49 NumberOfNonLiveVariables, 5815 ConjunctsInSsa, 332 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 445306/502317 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-03 03:47:05,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e980ad6f-5f19-4bed-906f-967138ca0a67/bin/utaipan-7li7fVZpFI/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