./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V --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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:41:58,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:41:58,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:41:58,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:41:58,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:41:58,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:41:58,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:41:58,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:41:58,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:41:58,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:41:58,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:41:58,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:41:58,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:41:58,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:41:58,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:41:58,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:41:58,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:41:58,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:41:58,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:41:58,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:41:58,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:41:58,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:41:58,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:41:58,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:41:58,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:41:58,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:41:58,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:41:58,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:41:58,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:41:58,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:41:58,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:41:58,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:41:58,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:41:58,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:41:58,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:41:58,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:41:58,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:41:58,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:41:58,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:41:58,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:41:58,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:41:58,277 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 02:41:58,303 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:41:58,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:41:58,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:41:58,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:41:58,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:41:58,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:41:58,305 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:41:58,305 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:41:58,305 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:41:58,306 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:41:58,306 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:41:58,306 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:41:58,307 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:41:58,307 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:41:58,307 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:41:58,307 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:41:58,308 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:41:58,308 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:41:58,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:41:58,309 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:41:58,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:41:58,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:41:58,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:41:58,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 02:41:58,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:41:58,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 02:41:58,310 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:41:58,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 02:41:58,311 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:41:58,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 02:41:58,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:41:58,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:41:58,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:41:58,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:41:58,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:41:58,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 02:41:58,312 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:41:58,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:41:58,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 02:41:58,313 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:41:58,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:41:58,313 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/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_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2021-11-23 02:41:58,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:41:58,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:41:58,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:41:58,614 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:41:58,619 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:41:58,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-11-23 02:41:58,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/data/19e98c087/e57b808fc2de483eb73d77904f6bebe5/FLAG8d30a6fee [2021-11-23 02:41:59,182 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:41:59,182 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-11-23 02:41:59,192 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/data/19e98c087/e57b808fc2de483eb73d77904f6bebe5/FLAG8d30a6fee [2021-11-23 02:41:59,574 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/data/19e98c087/e57b808fc2de483eb73d77904f6bebe5 [2021-11-23 02:41:59,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:41:59,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:41:59,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:41:59,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:41:59,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:41:59,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3914fcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59, skipping insertion in model container [2021-11-23 02:41:59,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:41:59,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:41:59,792 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_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-11-23 02:41:59,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:41:59,804 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:41:59,820 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_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-11-23 02:41:59,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:41:59,834 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:41:59,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59 WrapperNode [2021-11-23 02:41:59,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:41:59,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:41:59,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:41:59,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:41:59,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,870 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2021-11-23 02:41:59,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:41:59,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:41:59,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:41:59,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:41:59,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:41:59,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:41:59,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:41:59,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:41:59,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (1/1) ... [2021-11-23 02:41:59,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:41:59,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:41:59,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:41:59,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:41:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:41:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:41:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-11-23 02:41:59,965 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-11-23 02:41:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-11-23 02:41:59,965 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-11-23 02:41:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:41:59,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:42:00,014 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:42:00,016 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:42:00,122 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:42:00,135 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:42:00,135 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-23 02:42:00,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:00 BoogieIcfgContainer [2021-11-23 02:42:00,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:42:00,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:42:00,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:42:00,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:42:00,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:41:59" (1/3) ... [2021-11-23 02:42:00,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d37c28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:42:00, skipping insertion in model container [2021-11-23 02:42:00,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:59" (2/3) ... [2021-11-23 02:42:00,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d37c28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:42:00, skipping insertion in model container [2021-11-23 02:42:00,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:00" (3/3) ... [2021-11-23 02:42:00,147 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2021-11-23 02:42:00,152 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:42:00,152 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 02:42:00,202 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:42:00,209 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:42:00,210 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 02:42:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-23 02:42:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 02:42:00,261 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:00,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:00,271 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2097990987, now seen corresponding path program 1 times [2021-11-23 02:42:00,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:00,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116235480] [2021-11-23 02:42:00,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:00,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:42:00,591 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116235480] [2021-11-23 02:42:00,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116235480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:42:00,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:42:00,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:42:00,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156361629] [2021-11-23 02:42:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:42:00,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:42:00,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:00,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:42:00,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:42:00,645 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-11-23 02:42:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:00,704 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2021-11-23 02:42:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:42:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2021-11-23 02:42:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:00,714 INFO L225 Difference]: With dead ends: 36 [2021-11-23 02:42:00,714 INFO L226 Difference]: Without dead ends: 26 [2021-11-23 02:42:00,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:42:00,721 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:00,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:42:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-23 02:42:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-23 02:42:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-23 02:42:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-11-23 02:42:00,802 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2021-11-23 02:42:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:00,803 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-11-23 02:42:00,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-11-23 02:42:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-11-23 02:42:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:42:00,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:00,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:00,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:42:00,806 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:00,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1328370967, now seen corresponding path program 1 times [2021-11-23 02:42:00,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:00,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334012627] [2021-11-23 02:42:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:00,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:42:00,869 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:00,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334012627] [2021-11-23 02:42:00,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334012627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:42:00,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:42:00,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:42:00,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954412329] [2021-11-23 02:42:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:42:00,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:42:00,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:42:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:42:00,872 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2021-11-23 02:42:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:00,892 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2021-11-23 02:42:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:42:00,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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 [2021-11-23 02:42:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:00,895 INFO L225 Difference]: With dead ends: 32 [2021-11-23 02:42:00,895 INFO L226 Difference]: Without dead ends: 28 [2021-11-23 02:42:00,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:42:00,897 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:00,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:42:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-11-23 02:42:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-11-23 02:42:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-23 02:42:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-11-23 02:42:00,908 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2021-11-23 02:42:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:00,908 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-11-23 02:42:00,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2021-11-23 02:42:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-11-23 02:42:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:42:00,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:00,911 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:00,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:42:00,911 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1296553538, now seen corresponding path program 1 times [2021-11-23 02:42:00,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:00,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403062639] [2021-11-23 02:42:00,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:00,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:42:00,998 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:00,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403062639] [2021-11-23 02:42:00,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403062639] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:00,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395186715] [2021-11-23 02:42:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:01,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:01,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:01,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:01,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:42:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:01,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 02:42:01,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:42:01,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:42:01,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395186715] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:01,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1657871623] [2021-11-23 02:42:01,560 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-11-23 02:42:01,561 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:01,565 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:42:01,577 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:42:01,577 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:42:01,749 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 39 for LOIs [2021-11-23 02:42:01,835 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 39 for LOIs [2021-11-23 02:42:01,847 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:42:02,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1657871623] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:42:02,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:02,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7, 7] total 17 [2021-11-23 02:42:02,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399840918] [2021-11-23 02:42:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:42:02,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:42:02,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:02,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:42:02,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:42:02,148 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:42:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:02,283 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2021-11-23 02:42:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 02:42:02,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2021-11-23 02:42:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:02,285 INFO L225 Difference]: With dead ends: 68 [2021-11-23 02:42:02,286 INFO L226 Difference]: Without dead ends: 44 [2021-11-23 02:42:02,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:42:02,288 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:02,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 110 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:42:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-23 02:42:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2021-11-23 02:42:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-23 02:42:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2021-11-23 02:42:02,300 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2021-11-23 02:42:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:02,300 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2021-11-23 02:42:02,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 02:42:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2021-11-23 02:42:02,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 02:42:02,307 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:02,308 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:02,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:02,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:02,523 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:02,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash -28918515, now seen corresponding path program 1 times [2021-11-23 02:42:02,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:02,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673090696] [2021-11-23 02:42:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:02,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:42:02,589 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673090696] [2021-11-23 02:42:02,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673090696] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481627222] [2021-11-23 02:42:02,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:02,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:02,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:02,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:02,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:42:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:02,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:42:02,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:42:02,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:42:03,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481627222] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [764197012] [2021-11-23 02:42:03,203 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:03,203 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:03,205 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:03,212 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:03,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2021-11-23 02:42:03,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63868658] [2021-11-23 02:42:03,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:03,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-23 02:42:03,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 02:42:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-23 02:42:03,218 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-23 02:42:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:03,417 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2021-11-23 02:42:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 02:42:03,418 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2021-11-23 02:42:03,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:03,425 INFO L225 Difference]: With dead ends: 85 [2021-11-23 02:42:03,426 INFO L226 Difference]: Without dead ends: 53 [2021-11-23 02:42:03,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-11-23 02:42:03,432 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:03,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 119 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:42:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-23 02:42:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2021-11-23 02:42:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2021-11-23 02:42:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-11-23 02:42:03,457 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2021-11-23 02:42:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:03,458 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-11-23 02:42:03,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-23 02:42:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-11-23 02:42:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 02:42:03,467 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:03,468 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:03,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:03,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:03,687 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -243412115, now seen corresponding path program 1 times [2021-11-23 02:42:03,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:03,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893877507] [2021-11-23 02:42:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:03,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:42:03,815 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:03,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893877507] [2021-11-23 02:42:03,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893877507] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:03,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152015517] [2021-11-23 02:42:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:03,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:03,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:03,819 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:03,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 02:42:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:03,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:42:03,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:42:04,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:42:04,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152015517] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:04,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1721877269] [2021-11-23 02:42:04,329 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:04,329 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:04,330 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:04,331 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:04,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2021-11-23 02:42:04,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709421569] [2021-11-23 02:42:04,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:04,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-23 02:42:04,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-23 02:42:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:42:04,333 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-23 02:42:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:04,815 INFO L93 Difference]: Finished difference Result 121 states and 203 transitions. [2021-11-23 02:42:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-23 02:42:04,816 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2021-11-23 02:42:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:04,819 INFO L225 Difference]: With dead ends: 121 [2021-11-23 02:42:04,819 INFO L226 Difference]: Without dead ends: 77 [2021-11-23 02:42:04,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2021-11-23 02:42:04,822 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 72 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:04,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 250 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:42:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-23 02:42:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-11-23 02:42:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2021-11-23 02:42:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2021-11-23 02:42:04,843 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 36 [2021-11-23 02:42:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:04,843 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2021-11-23 02:42:04,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-23 02:42:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2021-11-23 02:42:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-23 02:42:04,846 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:04,846 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:04,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:05,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:05,059 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 403750738, now seen corresponding path program 1 times [2021-11-23 02:42:05,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:05,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336695259] [2021-11-23 02:42:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:05,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:42:05,179 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:05,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336695259] [2021-11-23 02:42:05,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336695259] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:05,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560179977] [2021-11-23 02:42:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:05,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:05,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:05,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:05,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 02:42:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:05,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:42:05,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 02:42:05,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:42:05,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560179977] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:05,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [988118981] [2021-11-23 02:42:05,908 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:05,908 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:05,909 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:05,909 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:05,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2021-11-23 02:42:05,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211962581] [2021-11-23 02:42:05,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:05,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-23 02:42:05,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:05,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-23 02:42:05,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:42:05,911 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2021-11-23 02:42:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:06,140 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2021-11-23 02:42:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:42:06,141 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 50 [2021-11-23 02:42:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:06,143 INFO L225 Difference]: With dead ends: 119 [2021-11-23 02:42:06,143 INFO L226 Difference]: Without dead ends: 97 [2021-11-23 02:42:06,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:42:06,145 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:06,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 117 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:42:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-23 02:42:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2021-11-23 02:42:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 11 states have return successors, (39), 17 states have call predecessors, (39), 14 states have call successors, (39) [2021-11-23 02:42:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2021-11-23 02:42:06,165 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 50 [2021-11-23 02:42:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:06,165 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2021-11-23 02:42:06,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2021-11-23 02:42:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2021-11-23 02:42:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-23 02:42:06,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:06,169 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:06,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:06,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-23 02:42:06,395 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1766289300, now seen corresponding path program 1 times [2021-11-23 02:42:06,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:06,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880916132] [2021-11-23 02:42:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:06,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-23 02:42:06,529 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880916132] [2021-11-23 02:42:06,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880916132] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546987767] [2021-11-23 02:42:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:06,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:06,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:06,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:06,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 02:42:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:06,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 02:42:06,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-11-23 02:42:06,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-23 02:42:07,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546987767] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:07,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [182899889] [2021-11-23 02:42:07,708 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:07,708 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:07,708 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:07,709 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:07,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2021-11-23 02:42:07,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202963346] [2021-11-23 02:42:07,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:07,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-23 02:42:07,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-23 02:42:07,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-11-23 02:42:07,711 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2021-11-23 02:42:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:08,436 INFO L93 Difference]: Finished difference Result 204 states and 411 transitions. [2021-11-23 02:42:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-23 02:42:08,437 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) Word has length 79 [2021-11-23 02:42:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:08,440 INFO L225 Difference]: With dead ends: 204 [2021-11-23 02:42:08,440 INFO L226 Difference]: Without dead ends: 115 [2021-11-23 02:42:08,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2021-11-23 02:42:08,443 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 138 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:08,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 355 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:42:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-23 02:42:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2021-11-23 02:42:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.171875) internal successors, (75), 66 states have internal predecessors, (75), 19 states have call successors, (19), 8 states have call predecessors, (19), 14 states have return successors, (50), 23 states have call predecessors, (50), 19 states have call successors, (50) [2021-11-23 02:42:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2021-11-23 02:42:08,482 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 79 [2021-11-23 02:42:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:08,485 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2021-11-23 02:42:08,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2021-11-23 02:42:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2021-11-23 02:42:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-23 02:42:08,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:08,493 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:08,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:08,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-23 02:42:08,710 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:08,711 INFO L85 PathProgramCache]: Analyzing trace with hash -346616466, now seen corresponding path program 1 times [2021-11-23 02:42:08,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:08,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635436351] [2021-11-23 02:42:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:08,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 39 proven. 92 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2021-11-23 02:42:08,835 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:08,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635436351] [2021-11-23 02:42:08,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635436351] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:08,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030687654] [2021-11-23 02:42:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:08,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:08,837 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:08,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 02:42:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:08,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:42:08,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 172 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-23 02:42:09,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 186 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-23 02:42:10,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030687654] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:10,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102090408] [2021-11-23 02:42:10,518 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:10,519 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:10,520 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:10,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:10,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 20 [2021-11-23 02:42:10,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180675399] [2021-11-23 02:42:10,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:10,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-23 02:42:10,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:10,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-23 02:42:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-11-23 02:42:10,523 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2021-11-23 02:42:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:10,811 INFO L93 Difference]: Finished difference Result 191 states and 315 transitions. [2021-11-23 02:42:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 02:42:10,812 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) Word has length 130 [2021-11-23 02:42:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:10,817 INFO L225 Difference]: With dead ends: 191 [2021-11-23 02:42:10,817 INFO L226 Difference]: Without dead ends: 103 [2021-11-23 02:42:10,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 240 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-11-23 02:42:10,820 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 86 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:10,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 183 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:42:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-23 02:42:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2021-11-23 02:42:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 19 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (48), 23 states have call predecessors, (48), 19 states have call successors, (48) [2021-11-23 02:42:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2021-11-23 02:42:10,854 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 130 [2021-11-23 02:42:10,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:10,855 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2021-11-23 02:42:10,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2021-11-23 02:42:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2021-11-23 02:42:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-23 02:42:10,861 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:10,862 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:10,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:11,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:11,079 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2089532945, now seen corresponding path program 2 times [2021-11-23 02:42:11,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:11,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840492522] [2021-11-23 02:42:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:11,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 37 proven. 111 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-23 02:42:11,197 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:11,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840492522] [2021-11-23 02:42:11,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840492522] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:11,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270796104] [2021-11-23 02:42:11,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:42:11,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:11,203 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:11,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 02:42:11,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-23 02:42:11,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:42:11,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:42:11,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 20 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-11-23 02:42:11,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 22 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-11-23 02:42:12,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270796104] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:12,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2050388222] [2021-11-23 02:42:12,040 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:12,041 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:12,041 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:12,042 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:12,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 16 [2021-11-23 02:42:12,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925427594] [2021-11-23 02:42:12,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:12,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-23 02:42:12,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:12,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-23 02:42:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-23 02:42:12,045 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2021-11-23 02:42:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:12,260 INFO L93 Difference]: Finished difference Result 132 states and 213 transitions. [2021-11-23 02:42:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:42:12,260 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) Word has length 118 [2021-11-23 02:42:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:12,262 INFO L225 Difference]: With dead ends: 132 [2021-11-23 02:42:12,263 INFO L226 Difference]: Without dead ends: 118 [2021-11-23 02:42:12,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-11-23 02:42:12,264 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:12,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 165 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:42:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-23 02:42:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2021-11-23 02:42:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 73 states have internal predecessors, (81), 20 states have call successors, (20), 8 states have call predecessors, (20), 17 states have return successors, (59), 26 states have call predecessors, (59), 20 states have call successors, (59) [2021-11-23 02:42:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2021-11-23 02:42:12,278 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 118 [2021-11-23 02:42:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:12,279 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2021-11-23 02:42:12,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2021-11-23 02:42:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2021-11-23 02:42:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-23 02:42:12,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:12,282 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:12,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:12,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:12,495 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1687293718, now seen corresponding path program 3 times [2021-11-23 02:42:12,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:12,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475099606] [2021-11-23 02:42:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:12,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 76 proven. 209 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2021-11-23 02:42:12,656 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:12,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475099606] [2021-11-23 02:42:12,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475099606] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:12,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119981953] [2021-11-23 02:42:12,656 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:42:12,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:12,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:12,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:12,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 02:42:12,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:42:12,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:42:12,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:42:12,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 423 proven. 19 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2021-11-23 02:42:13,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 74 proven. 251 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2021-11-23 02:42:13,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119981953] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:13,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [159661294] [2021-11-23 02:42:13,983 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:13,983 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:13,984 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:13,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:13,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 17 [2021-11-23 02:42:13,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572830346] [2021-11-23 02:42:13,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:13,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-23 02:42:13,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:13,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-23 02:42:13,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:42:13,988 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2021-11-23 02:42:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:14,218 INFO L93 Difference]: Finished difference Result 213 states and 337 transitions. [2021-11-23 02:42:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:42:14,219 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) Word has length 187 [2021-11-23 02:42:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:14,221 INFO L225 Difference]: With dead ends: 213 [2021-11-23 02:42:14,221 INFO L226 Difference]: Without dead ends: 113 [2021-11-23 02:42:14,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 366 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:42:14,223 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:14,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 181 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:42:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-23 02:42:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-11-23 02:42:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 20 states have call successors, (20), 9 states have call predecessors, (20), 18 states have return successors, (59), 27 states have call predecessors, (59), 20 states have call successors, (59) [2021-11-23 02:42:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2021-11-23 02:42:14,234 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 187 [2021-11-23 02:42:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:14,235 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2021-11-23 02:42:14,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2021-11-23 02:42:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2021-11-23 02:42:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 02:42:14,238 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:14,239 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:14,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:14,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-23 02:42:14,463 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 317371732, now seen corresponding path program 1 times [2021-11-23 02:42:14,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:14,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193511477] [2021-11-23 02:42:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:14,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2021-11-23 02:42:14,606 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:14,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193511477] [2021-11-23 02:42:14,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193511477] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:14,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377243612] [2021-11-23 02:42:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:14,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:14,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:14,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:14,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 02:42:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:14,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:42:14,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2021-11-23 02:42:15,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 315 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2021-11-23 02:42:16,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377243612] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:16,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1890242841] [2021-11-23 02:42:16,393 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:16,393 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:16,394 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:16,396 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:16,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 18 [2021-11-23 02:42:16,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193194235] [2021-11-23 02:42:16,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:16,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-23 02:42:16,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:16,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-23 02:42:16,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:42:16,402 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2021-11-23 02:42:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:16,633 INFO L93 Difference]: Finished difference Result 142 states and 227 transitions. [2021-11-23 02:42:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 02:42:16,634 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) Word has length 188 [2021-11-23 02:42:16,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:16,638 INFO L225 Difference]: With dead ends: 142 [2021-11-23 02:42:16,638 INFO L226 Difference]: Without dead ends: 128 [2021-11-23 02:42:16,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:42:16,640 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:16,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 135 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:42:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-23 02:42:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2021-11-23 02:42:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 72 states have internal predecessors, (79), 20 states have call successors, (20), 9 states have call predecessors, (20), 16 states have return successors, (49), 25 states have call predecessors, (49), 20 states have call successors, (49) [2021-11-23 02:42:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2021-11-23 02:42:16,658 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 188 [2021-11-23 02:42:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:16,659 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2021-11-23 02:42:16,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2021-11-23 02:42:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2021-11-23 02:42:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-11-23 02:42:16,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:16,665 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 14, 12, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:16,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:16,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-23 02:42:16,878 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash 384777542, now seen corresponding path program 4 times [2021-11-23 02:42:16,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:16,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503598641] [2021-11-23 02:42:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:16,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 279 proven. 371 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2021-11-23 02:42:17,128 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:17,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503598641] [2021-11-23 02:42:17,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503598641] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:17,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314265785] [2021-11-23 02:42:17,128 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:42:17,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:17,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:17,130 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:17,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:42:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:17,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:42:17,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 439 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2021-11-23 02:42:17,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 463 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2021-11-23 02:42:19,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314265785] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:19,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [992161173] [2021-11-23 02:42:19,518 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:19,519 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:19,519 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:19,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:19,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 31 [2021-11-23 02:42:19,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256883457] [2021-11-23 02:42:19,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:19,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-23 02:42:19,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:19,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-23 02:42:19,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2021-11-23 02:42:19,524 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 16 states have call predecessors, (38), 24 states have call successors, (38) [2021-11-23 02:42:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:20,791 INFO L93 Difference]: Finished difference Result 300 states and 568 transitions. [2021-11-23 02:42:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-23 02:42:20,792 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 16 states have call predecessors, (38), 24 states have call successors, (38) Word has length 239 [2021-11-23 02:42:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:20,795 INFO L225 Difference]: With dead ends: 300 [2021-11-23 02:42:20,795 INFO L226 Difference]: Without dead ends: 182 [2021-11-23 02:42:20,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 466 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=587, Invalid=3445, Unknown=0, NotChecked=0, Total=4032 [2021-11-23 02:42:20,799 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 194 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:20,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 487 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-23 02:42:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-23 02:42:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2021-11-23 02:42:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.099009900990099) internal successors, (111), 100 states have internal predecessors, (111), 28 states have call successors, (28), 17 states have call predecessors, (28), 18 states have return successors, (68), 30 states have call predecessors, (68), 28 states have call successors, (68) [2021-11-23 02:42:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2021-11-23 02:42:20,815 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 239 [2021-11-23 02:42:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:20,816 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2021-11-23 02:42:20,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 31 states have internal predecessors, (98), 24 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (38), 16 states have call predecessors, (38), 24 states have call successors, (38) [2021-11-23 02:42:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2021-11-23 02:42:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2021-11-23 02:42:20,841 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:20,842 INFO L514 BasicCegarLoop]: trace histogram [66, 66, 54, 53, 53, 45, 33, 33, 33, 33, 33, 33, 33, 28, 26, 26, 26, 26, 26, 26, 26, 12, 12, 8, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:20,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:21,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:21,067 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1043357236, now seen corresponding path program 5 times [2021-11-23 02:42:21,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:21,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422101056] [2021-11-23 02:42:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:21,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 19925 backedges. 279 proven. 1827 refuted. 0 times theorem prover too weak. 17819 trivial. 0 not checked. [2021-11-23 02:42:21,511 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:21,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422101056] [2021-11-23 02:42:21,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422101056] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:21,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859686721] [2021-11-23 02:42:21,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:42:21,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:21,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:21,513 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:21,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 02:42:21,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:42:21,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:42:21,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 02:42:21,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 19925 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18683 trivial. 0 not checked. [2021-11-23 02:42:22,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 19925 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18683 trivial. 0 not checked. [2021-11-23 02:42:25,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859686721] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:25,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [331847252] [2021-11-23 02:42:25,316 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:25,316 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:25,317 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:25,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:25,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2021-11-23 02:42:25,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012875568] [2021-11-23 02:42:25,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:25,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-23 02:42:25,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-23 02:42:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:42:25,322 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2021-11-23 02:42:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:25,668 INFO L93 Difference]: Finished difference Result 351 states and 610 transitions. [2021-11-23 02:42:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-23 02:42:25,668 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 816 [2021-11-23 02:42:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:25,672 INFO L225 Difference]: With dead ends: 351 [2021-11-23 02:42:25,672 INFO L226 Difference]: Without dead ends: 202 [2021-11-23 02:42:25,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1659 GetRequests, 1629 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2021-11-23 02:42:25,675 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 119 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:25,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 141 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:42:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-23 02:42:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2021-11-23 02:42:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 121 states have internal predecessors, (135), 36 states have call successors, (36), 20 states have call predecessors, (36), 22 states have return successors, (123), 40 states have call predecessors, (123), 36 states have call successors, (123) [2021-11-23 02:42:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 294 transitions. [2021-11-23 02:42:25,695 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 294 transitions. Word has length 816 [2021-11-23 02:42:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:25,696 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 294 transitions. [2021-11-23 02:42:25,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2021-11-23 02:42:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 294 transitions. [2021-11-23 02:42:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2021-11-23 02:42:25,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:25,708 INFO L514 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 28, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 8, 5, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:25,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:25,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 02:42:25,931 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:25,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:25,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1333422328, now seen corresponding path program 6 times [2021-11-23 02:42:25,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:25,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041915286] [2021-11-23 02:42:25,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:25,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 294 proven. 759 refuted. 0 times theorem prover too weak. 5030 trivial. 0 not checked. [2021-11-23 02:42:26,223 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:26,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041915286] [2021-11-23 02:42:26,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041915286] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:26,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334383737] [2021-11-23 02:42:26,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:42:26,224 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:26,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:26,227 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:26,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 02:42:26,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:42:26,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:42:26,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:42:26,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 2733 proven. 170 refuted. 0 times theorem prover too weak. 3180 trivial. 0 not checked. [2021-11-23 02:42:27,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 319 proven. 1329 refuted. 0 times theorem prover too weak. 4435 trivial. 0 not checked. [2021-11-23 02:42:29,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334383737] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:29,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496664896] [2021-11-23 02:42:29,840 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:29,840 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:29,840 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:29,842 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:29,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 19] total 32 [2021-11-23 02:42:29,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892044572] [2021-11-23 02:42:29,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:29,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:42:29,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:29,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:42:29,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:42:29,846 INFO L87 Difference]: Start difference. First operand 182 states and 294 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 17 states have call predecessors, (46), 24 states have call successors, (46) [2021-11-23 02:42:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:30,904 INFO L93 Difference]: Finished difference Result 467 states and 957 transitions. [2021-11-23 02:42:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-23 02:42:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 17 states have call predecessors, (46), 24 states have call successors, (46) Word has length 459 [2021-11-23 02:42:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:30,909 INFO L225 Difference]: With dead ends: 467 [2021-11-23 02:42:30,909 INFO L226 Difference]: Without dead ends: 200 [2021-11-23 02:42:30,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 901 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=2607, Unknown=0, NotChecked=0, Total=3080 [2021-11-23 02:42:30,915 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 175 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:30,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 588 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-23 02:42:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-23 02:42:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2021-11-23 02:42:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 123 states have (on average 1.1056910569105691) internal successors, (136), 120 states have internal predecessors, (136), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (90), 35 states have call predecessors, (90), 33 states have call successors, (90) [2021-11-23 02:42:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2021-11-23 02:42:30,934 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 459 [2021-11-23 02:42:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:30,934 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2021-11-23 02:42:30,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (46), 17 states have call predecessors, (46), 24 states have call successors, (46) [2021-11-23 02:42:30,935 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2021-11-23 02:42:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2021-11-23 02:42:30,938 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:30,938 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 23, 22, 22, 18, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 6, 4, 2, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:30,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:31,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:31,151 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:31,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1703076480, now seen corresponding path program 7 times [2021-11-23 02:42:31,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:31,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383815086] [2021-11-23 02:42:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:31,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 242 proven. 432 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2021-11-23 02:42:31,302 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383815086] [2021-11-23 02:42:31,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383815086] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:31,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061729454] [2021-11-23 02:42:31,303 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:42:31,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:31,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:31,305 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:31,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 02:42:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:31,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:42:31,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 196 proven. 591 refuted. 0 times theorem prover too weak. 2227 trivial. 0 not checked. [2021-11-23 02:42:32,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 204 proven. 604 refuted. 0 times theorem prover too weak. 2206 trivial. 0 not checked. [2021-11-23 02:42:34,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061729454] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:34,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1289405937] [2021-11-23 02:42:34,051 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:34,051 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:34,052 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:34,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:34,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 17] total 28 [2021-11-23 02:42:34,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022248884] [2021-11-23 02:42:34,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:34,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-23 02:42:34,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:34,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-23 02:42:34,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2021-11-23 02:42:34,057 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 28 states have internal predecessors, (93), 21 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (36), 18 states have call predecessors, (36), 21 states have call successors, (36) [2021-11-23 02:42:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:35,068 INFO L93 Difference]: Finished difference Result 540 states and 1014 transitions. [2021-11-23 02:42:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-23 02:42:35,068 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 28 states have internal predecessors, (93), 21 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (36), 18 states have call predecessors, (36), 21 states have call successors, (36) Word has length 326 [2021-11-23 02:42:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:35,073 INFO L225 Difference]: With dead ends: 540 [2021-11-23 02:42:35,074 INFO L226 Difference]: Without dead ends: 295 [2021-11-23 02:42:35,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 637 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=2553, Unknown=0, NotChecked=0, Total=2970 [2021-11-23 02:42:35,085 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 179 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:35,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 493 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 02:42:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-23 02:42:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 240. [2021-11-23 02:42:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 166 states have (on average 1.0783132530120483) internal successors, (179), 159 states have internal predecessors, (179), 46 states have call successors, (46), 31 states have call predecessors, (46), 27 states have return successors, (137), 49 states have call predecessors, (137), 46 states have call successors, (137) [2021-11-23 02:42:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 362 transitions. [2021-11-23 02:42:35,116 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 362 transitions. Word has length 326 [2021-11-23 02:42:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:35,116 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 362 transitions. [2021-11-23 02:42:35,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 28 states have internal predecessors, (93), 21 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (36), 18 states have call predecessors, (36), 21 states have call successors, (36) [2021-11-23 02:42:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 362 transitions. [2021-11-23 02:42:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2021-11-23 02:42:35,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:35,121 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 26, 26, 24, 22, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 11, 7, 7, 4, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:35,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:35,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:35,343 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:35,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1157185935, now seen corresponding path program 8 times [2021-11-23 02:42:35,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:35,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912816507] [2021-11-23 02:42:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:35,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 363 proven. 514 refuted. 0 times theorem prover too weak. 3522 trivial. 0 not checked. [2021-11-23 02:42:35,558 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:35,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912816507] [2021-11-23 02:42:35,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912816507] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:35,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017705520] [2021-11-23 02:42:35,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:42:35,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:35,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:35,560 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:35,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 02:42:35,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-23 02:42:35,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:42:35,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 02:42:35,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 590 proven. 94 refuted. 0 times theorem prover too weak. 3715 trivial. 0 not checked. [2021-11-23 02:42:36,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 592 proven. 102 refuted. 0 times theorem prover too weak. 3705 trivial. 0 not checked. [2021-11-23 02:42:37,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017705520] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:37,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [33142130] [2021-11-23 02:42:37,785 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:37,786 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:37,786 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:37,787 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:37,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 13] total 27 [2021-11-23 02:42:37,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269444500] [2021-11-23 02:42:37,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:37,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-23 02:42:37,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:37,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-23 02:42:37,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2021-11-23 02:42:37,790 INFO L87 Difference]: Start difference. First operand 240 states and 362 transitions. Second operand has 27 states, 25 states have (on average 3.32) internal successors, (83), 27 states have internal predecessors, (83), 16 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2021-11-23 02:42:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:38,650 INFO L93 Difference]: Finished difference Result 534 states and 887 transitions. [2021-11-23 02:42:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-23 02:42:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.32) internal successors, (83), 27 states have internal predecessors, (83), 16 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) Word has length 391 [2021-11-23 02:42:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:38,660 INFO L225 Difference]: With dead ends: 534 [2021-11-23 02:42:38,660 INFO L226 Difference]: Without dead ends: 259 [2021-11-23 02:42:38,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=2097, Unknown=0, NotChecked=0, Total=2450 [2021-11-23 02:42:38,666 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 158 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:38,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 470 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:42:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-23 02:42:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 226. [2021-11-23 02:42:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 158 states have (on average 1.0822784810126582) internal successors, (171), 151 states have internal predecessors, (171), 42 states have call successors, (42), 31 states have call predecessors, (42), 25 states have return successors, (101), 43 states have call predecessors, (101), 42 states have call successors, (101) [2021-11-23 02:42:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2021-11-23 02:42:38,688 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 391 [2021-11-23 02:42:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:38,689 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2021-11-23 02:42:38,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.32) internal successors, (83), 27 states have internal predecessors, (83), 16 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2021-11-23 02:42:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2021-11-23 02:42:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2021-11-23 02:42:38,694 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:38,695 INFO L514 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 36, 35, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 15, 13, 9, 7, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:38,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:38,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 02:42:38,915 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1741329042, now seen corresponding path program 9 times [2021-11-23 02:42:38,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:38,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602347216] [2021-11-23 02:42:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:38,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10393 backedges. 375 proven. 732 refuted. 0 times theorem prover too weak. 9286 trivial. 0 not checked. [2021-11-23 02:42:39,141 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:39,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602347216] [2021-11-23 02:42:39,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602347216] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:39,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867862966] [2021-11-23 02:42:39,142 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:42:39,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:39,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:39,143 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:39,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 02:42:39,416 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:42:39,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:42:39,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 02:42:39,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10393 backedges. 5434 proven. 432 refuted. 0 times theorem prover too weak. 4527 trivial. 0 not checked. [2021-11-23 02:42:40,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10393 backedges. 459 proven. 1930 refuted. 0 times theorem prover too weak. 8004 trivial. 0 not checked. [2021-11-23 02:42:43,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867862966] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:43,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1874658094] [2021-11-23 02:42:43,679 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:43,680 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:43,680 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:43,681 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:43,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 23] total 31 [2021-11-23 02:42:43,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777426027] [2021-11-23 02:42:43,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:43,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-23 02:42:43,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:43,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-23 02:42:43,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2021-11-23 02:42:43,685 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand has 31 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 31 states have internal predecessors, (116), 25 states have call successors, (34), 2 states have call predecessors, (34), 15 states have return successors, (43), 14 states have call predecessors, (43), 25 states have call successors, (43) [2021-11-23 02:42:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:44,701 INFO L93 Difference]: Finished difference Result 412 states and 573 transitions. [2021-11-23 02:42:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-23 02:42:44,701 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 31 states have internal predecessors, (116), 25 states have call successors, (34), 2 states have call predecessors, (34), 15 states have return successors, (43), 14 states have call predecessors, (43), 25 states have call successors, (43) Word has length 596 [2021-11-23 02:42:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:44,704 INFO L225 Difference]: With dead ends: 412 [2021-11-23 02:42:44,704 INFO L226 Difference]: Without dead ends: 218 [2021-11-23 02:42:44,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1236 GetRequests, 1172 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=587, Invalid=3445, Unknown=0, NotChecked=0, Total=4032 [2021-11-23 02:42:44,708 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 219 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:44,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 452 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:42:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-23 02:42:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 181. [2021-11-23 02:42:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 124 states have internal predecessors, (136), 36 states have call successors, (36), 27 states have call predecessors, (36), 17 states have return successors, (50), 29 states have call predecessors, (50), 36 states have call successors, (50) [2021-11-23 02:42:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 222 transitions. [2021-11-23 02:42:44,723 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 222 transitions. Word has length 596 [2021-11-23 02:42:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:44,724 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 222 transitions. [2021-11-23 02:42:44,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 31 states have internal predecessors, (116), 25 states have call successors, (34), 2 states have call predecessors, (34), 15 states have return successors, (43), 14 states have call predecessors, (43), 25 states have call successors, (43) [2021-11-23 02:42:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 222 transitions. [2021-11-23 02:42:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2021-11-23 02:42:44,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:44,730 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 38, 36, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 13, 11, 8, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:44,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:44,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 02:42:44,955 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:44,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1557347247, now seen corresponding path program 10 times [2021-11-23 02:42:44,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:44,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283847610] [2021-11-23 02:42:44,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:44,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11821 backedges. 872 proven. 629 refuted. 0 times theorem prover too weak. 10320 trivial. 0 not checked. [2021-11-23 02:42:45,267 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:45,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283847610] [2021-11-23 02:42:45,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283847610] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:45,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486231852] [2021-11-23 02:42:45,268 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:42:45,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:45,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:45,269 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:45,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 02:42:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:45,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 02:42:45,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11821 backedges. 430 proven. 718 refuted. 0 times theorem prover too weak. 10673 trivial. 0 not checked. [2021-11-23 02:42:46,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11821 backedges. 430 proven. 728 refuted. 0 times theorem prover too weak. 10663 trivial. 0 not checked. [2021-11-23 02:42:48,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486231852] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:48,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1868235730] [2021-11-23 02:42:48,631 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-23 02:42:48,631 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:48,632 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:42:48,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:48,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 13] total 27 [2021-11-23 02:42:48,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853700363] [2021-11-23 02:42:48,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:48,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-23 02:42:48,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-23 02:42:48,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2021-11-23 02:42:48,638 INFO L87 Difference]: Start difference. First operand 181 states and 222 transitions. Second operand has 27 states, 25 states have (on average 3.32) internal successors, (83), 27 states have internal predecessors, (83), 16 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2021-11-23 02:42:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:49,395 INFO L93 Difference]: Finished difference Result 381 states and 474 transitions. [2021-11-23 02:42:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-23 02:42:49,396 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.32) internal successors, (83), 27 states have internal predecessors, (83), 16 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) Word has length 635 [2021-11-23 02:42:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:49,399 INFO L225 Difference]: With dead ends: 381 [2021-11-23 02:42:49,399 INFO L226 Difference]: Without dead ends: 222 [2021-11-23 02:42:49,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1309 GetRequests, 1260 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=368, Invalid=2182, Unknown=0, NotChecked=0, Total=2550 [2021-11-23 02:42:49,401 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 175 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:49,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 380 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:42:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-23 02:42:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 200. [2021-11-23 02:42:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 136 states have internal predecessors, (149), 41 states have call successors, (41), 30 states have call predecessors, (41), 18 states have return successors, (51), 33 states have call predecessors, (51), 41 states have call successors, (51) [2021-11-23 02:42:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 241 transitions. [2021-11-23 02:42:49,419 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 241 transitions. Word has length 635 [2021-11-23 02:42:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:49,420 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 241 transitions. [2021-11-23 02:42:49,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.32) internal successors, (83), 27 states have internal predecessors, (83), 16 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2021-11-23 02:42:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 241 transitions. [2021-11-23 02:42:49,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2021-11-23 02:42:49,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:49,424 INFO L514 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:49,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:49,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:49,639 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:42:49,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1780384136, now seen corresponding path program 11 times [2021-11-23 02:42:49,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:49,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582579668] [2021-11-23 02:42:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:49,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:42:49,743 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 02:42:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:42:49,933 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-23 02:42:49,934 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 02:42:49,935 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 02:42:49,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 02:42:49,940 INFO L732 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:42:49,946 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 02:42:50,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:42:50 BoogieIcfgContainer [2021-11-23 02:42:50,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 02:42:50,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 02:42:50,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 02:42:50,082 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 02:42:50,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:00" (3/4) ... [2021-11-23 02:42:50,085 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 02:42:50,242 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 02:42:50,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 02:42:50,243 INFO L158 Benchmark]: Toolchain (without parser) took 50665.12ms. Allocated memory was 88.1MB in the beginning and 283.1MB in the end (delta: 195.0MB). Free memory was 48.0MB in the beginning and 200.8MB in the end (delta: -152.9MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2021-11-23 02:42:50,243 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 64.0MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:42:50,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.03ms. Allocated memory is still 88.1MB. Free memory was 47.8MB in the beginning and 64.6MB in the end (delta: -16.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 02:42:50,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.05ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 63.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:42:50,245 INFO L158 Benchmark]: Boogie Preprocessor took 18.72ms. Allocated memory is still 88.1MB. Free memory was 63.2MB in the beginning and 62.2MB in the end (delta: 932.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:42:50,245 INFO L158 Benchmark]: RCFGBuilder took 247.06ms. Allocated memory is still 88.1MB. Free memory was 62.2MB in the beginning and 53.0MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 02:42:50,248 INFO L158 Benchmark]: TraceAbstraction took 49941.89ms. Allocated memory was 88.1MB in the beginning and 283.1MB in the end (delta: 195.0MB). Free memory was 52.4MB in the beginning and 212.4MB in the end (delta: -160.0MB). Peak memory consumption was 161.7MB. Max. memory is 16.1GB. [2021-11-23 02:42:50,249 INFO L158 Benchmark]: Witness Printer took 160.04ms. Allocated memory is still 283.1MB. Free memory was 212.4MB in the beginning and 200.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-23 02:42:50,251 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.23ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 64.0MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.03ms. Allocated memory is still 88.1MB. Free memory was 47.8MB in the beginning and 64.6MB in the end (delta: -16.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.05ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 63.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.72ms. Allocated memory is still 88.1MB. Free memory was 63.2MB in the beginning and 62.2MB in the end (delta: 932.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 247.06ms. Allocated memory is still 88.1MB. Free memory was 62.2MB in the beginning and 53.0MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 49941.89ms. Allocated memory was 88.1MB in the beginning and 283.1MB in the end (delta: 195.0MB). Free memory was 52.4MB in the beginning and 212.4MB in the end (delta: -160.0MB). Peak memory consumption was 161.7MB. Max. memory is 16.1GB. * Witness Printer took 160.04ms. Allocated memory is still 283.1MB. Free memory was 212.4MB in the beginning and 200.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.7s, OverallIterations: 19, TraceHistogramMax: 66, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1836 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1772 mSDsluCounter, 4853 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4511 mSDsCounter, 2109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8475 IncrementalHoareTripleChecker+Invalid, 10584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2109 mSolverCounterUnsat, 519 mSDtfsCounter, 8475 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9087 GetRequests, 8485 SyntacticMatches, 28 SemanticMatches, 574 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4995 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=15, InterpolantAutomatonStates: 390, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 326 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 31.7s InterpolantComputationTime, 9092 NumberOfCodeBlocks, 7806 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 12890 ConstructedInterpolants, 0 QuantifiedInterpolants, 17326 SizeOfPredicates, 80 NumberOfNonLiveVariables, 6911 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 50 InterpolantComputations, 2 PerfectInterpolantSequences, 165060/180240 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: OVERALL_TIME: 0.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 13, TOOLS_POST_TIME: 0.0s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME: 0.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-23 02:42:50,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01dd1ed6-c4ae-4c4e-956e-aaf762bef417/bin/utaipan-EQgc7hIp5V/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE