./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18ab16c8226f43cf595901df83a1f895912e466b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 01:24:44,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:24:44,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:24:44,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:24:44,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:24:44,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:24:44,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:24:44,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:24:44,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:24:44,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:24:44,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:24:44,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:24:44,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:24:44,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:24:44,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:24:44,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:24:44,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:24:44,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:24:44,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:24:44,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:24:44,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:24:44,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:24:44,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:24:44,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:24:44,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:24:44,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:24:44,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:24:44,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:24:44,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:24:44,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:24:44,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:24:44,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:24:44,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:24:44,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:24:44,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:24:44,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:24:44,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:24:44,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:24:44,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:24:44,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:24:44,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:24:44,441 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 01:24:44,465 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:24:44,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:24:44,466 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:24:44,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:24:44,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:24:44,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:24:44,468 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:24:44,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:24:44,468 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:24:44,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:24:44,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:24:44,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:24:44,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:24:44,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:24:44,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:24:44,470 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:24:44,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:24:44,470 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:24:44,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:24:44,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:24:44,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:24:44,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:24:44,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:24:44,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:24:44,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:24:44,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:24:44,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:24:44,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:24:44,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:24:44,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:24:44,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/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_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt 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 -> Automizer 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 -> 18ab16c8226f43cf595901df83a1f895912e466b [2021-10-13 01:24:44,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:24:44,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:24:44,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:24:44,752 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:24:44,753 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:24:44,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/recursive/Fibonacci05.c [2021-10-13 01:24:44,824 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/data/e4722f0ec/deff0a2d1370454e8207577abf7cd19f/FLAG7c15b75f5 [2021-10-13 01:24:45,212 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:24:45,213 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/sv-benchmarks/c/recursive/Fibonacci05.c [2021-10-13 01:24:45,219 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/data/e4722f0ec/deff0a2d1370454e8207577abf7cd19f/FLAG7c15b75f5 [2021-10-13 01:24:45,619 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/data/e4722f0ec/deff0a2d1370454e8207577abf7cd19f [2021-10-13 01:24:45,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:24:45,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:24:45,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:24:45,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:24:45,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:24:45,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a01f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45, skipping insertion in model container [2021-10-13 01:24:45,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:24:45,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:24:45,825 WARN L228 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_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-10-13 01:24:45,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:24:45,839 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:24:45,868 WARN L228 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_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-10-13 01:24:45,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:24:45,879 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:24:45,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45 WrapperNode [2021-10-13 01:24:45,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:24:45,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:24:45,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:24:45,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:24:45,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:24:45,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:24:45,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:24:45,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:24:45,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:24:45,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:24:45,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:24:45,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:24:45,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (1/1) ... [2021-10-13 01:24:45,975 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:24:45,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:46,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:24:46,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:24:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-10-13 01:24:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-10-13 01:24:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:24:46,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:24:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:24:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:24:46,329 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:24:46,329 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-13 01:24:46,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:24:46 BoogieIcfgContainer [2021-10-13 01:24:46,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:24:46,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:24:46,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:24:46,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:24:46,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:24:45" (1/3) ... [2021-10-13 01:24:46,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d563f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:24:46, skipping insertion in model container [2021-10-13 01:24:46,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:24:45" (2/3) ... [2021-10-13 01:24:46,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d563f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:24:46, skipping insertion in model container [2021-10-13 01:24:46,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:24:46" (3/3) ... [2021-10-13 01:24:46,345 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-10-13 01:24:46,356 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:24:46,356 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 01:24:46,397 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:24:46,403 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, mConcurrency=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-10-13 01:24:46,403 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 01:24:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-13 01:24:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 01:24:46,428 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:46,429 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:46,429 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:46,443 INFO L82 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-10-13 01:24:46,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:46,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807542315] [2021-10-13 01:24:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:46,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:24:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:24:46,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:46,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807542315] [2021-10-13 01:24:46,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807542315] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:46,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:46,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:24:46,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161608453] [2021-10-13 01:24:46,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:24:46,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:46,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:24:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:46,679 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:24:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:46,791 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-10-13 01:24:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:24:46,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-10-13 01:24:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:46,802 INFO L225 Difference]: With dead ends: 31 [2021-10-13 01:24:46,803 INFO L226 Difference]: Without dead ends: 18 [2021-10-13 01:24:46,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:24:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-10-13 01:24:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-10-13 01:24:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-13 01:24:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-13 01:24:46,856 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-10-13 01:24:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:46,857 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-13 01:24:46,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:24:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-13 01:24:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 01:24:46,859 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:46,860 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:46,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:24:46,860 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:46,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-10-13 01:24:46,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:46,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759768856] [2021-10-13 01:24:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:46,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:24:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:24:46,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:46,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759768856] [2021-10-13 01:24:46,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759768856] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:24:46,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:24:46,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:24:46,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835990590] [2021-10-13 01:24:46,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:24:46,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:46,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:24:46,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:24:46,941 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:24:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:47,024 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-10-13 01:24:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:24:47,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-10-13 01:24:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:47,026 INFO L225 Difference]: With dead ends: 24 [2021-10-13 01:24:47,026 INFO L226 Difference]: Without dead ends: 20 [2021-10-13 01:24:47,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:24:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-13 01:24:47,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-10-13 01:24:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-13 01:24:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-13 01:24:47,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-10-13 01:24:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:47,034 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-13 01:24:47,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-13 01:24:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-13 01:24:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 01:24:47,035 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:47,036 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:47,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:24:47,036 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:47,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:47,037 INFO L82 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-10-13 01:24:47,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:47,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572013406] [2021-10-13 01:24:47,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:47,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:24:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 01:24:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 01:24:47,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:47,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572013406] [2021-10-13 01:24:47,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572013406] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:47,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789108756] [2021-10-13 01:24:47,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:47,187 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:47,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:47,193 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:47,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 01:24:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 01:24:47,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 01:24:47,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789108756] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:47,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:47,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-10-13 01:24:47,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616369989] [2021-10-13 01:24:47,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:24:47,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:47,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:24:47,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:24:47,461 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-10-13 01:24:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:47,554 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-10-13 01:24:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:24:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 23 [2021-10-13 01:24:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:47,556 INFO L225 Difference]: With dead ends: 35 [2021-10-13 01:24:47,556 INFO L226 Difference]: Without dead ends: 20 [2021-10-13 01:24:47,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 70.3ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:24:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-13 01:24:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-13 01:24:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-10-13 01:24:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-10-13 01:24:47,565 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-10-13 01:24:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:47,565 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-10-13 01:24:47,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-10-13 01:24:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-10-13 01:24:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 01:24:47,567 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:47,568 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:47,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:47,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:47,769 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:47,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash 187716987, now seen corresponding path program 1 times [2021-10-13 01:24:47,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:47,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53738694] [2021-10-13 01:24:47,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:47,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:24:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 01:24:47,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:47,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53738694] [2021-10-13 01:24:47,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53738694] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:47,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609319941] [2021-10-13 01:24:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:47,926 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:47,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:47,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 01:24:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:47,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 01:24:47,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 01:24:48,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609319941] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:48,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:48,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-10-13 01:24:48,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509575978] [2021-10-13 01:24:48,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 01:24:48,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:48,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 01:24:48,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:24:48,144 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-13 01:24:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:48,245 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-10-13 01:24:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:24:48,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2021-10-13 01:24:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:48,253 INFO L225 Difference]: With dead ends: 38 [2021-10-13 01:24:48,253 INFO L226 Difference]: Without dead ends: 34 [2021-10-13 01:24:48,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 41.6ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:24:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-10-13 01:24:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-10-13 01:24:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-10-13 01:24:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-10-13 01:24:48,279 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-10-13 01:24:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:48,280 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-10-13 01:24:48,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-13 01:24:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-10-13 01:24:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 01:24:48,286 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:48,286 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:48,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:48,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:48,505 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1151618030, now seen corresponding path program 2 times [2021-10-13 01:24:48,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:48,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193095866] [2021-10-13 01:24:48,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:48,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:48,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:24:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:48,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:48,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 01:24:48,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:48,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193095866] [2021-10-13 01:24:48,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193095866] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:48,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212327838] [2021-10-13 01:24:48,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 01:24:48,655 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:48,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:48,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:48,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 01:24:48,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 01:24:48,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 01:24:48,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 01:24:48,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-13 01:24:48,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212327838] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:48,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:48,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-10-13 01:24:48,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987823424] [2021-10-13 01:24:48,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 01:24:48,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 01:24:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:24:48,957 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-10-13 01:24:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:49,216 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2021-10-13 01:24:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 01:24:49,217 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Word has length 37 [2021-10-13 01:24:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:49,220 INFO L225 Difference]: With dead ends: 68 [2021-10-13 01:24:49,220 INFO L226 Difference]: Without dead ends: 35 [2021-10-13 01:24:49,227 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 137.2ms TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:24:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-13 01:24:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-10-13 01:24:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-10-13 01:24:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-10-13 01:24:49,243 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2021-10-13 01:24:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:49,244 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-10-13 01:24:49,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-10-13 01:24:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-10-13 01:24:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-13 01:24:49,251 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:49,252 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:49,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:49,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:49,452 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1916996739, now seen corresponding path program 3 times [2021-10-13 01:24:49,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:49,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870538461] [2021-10-13 01:24:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:49,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:24:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-13 01:24:49,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:49,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870538461] [2021-10-13 01:24:49,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870538461] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:49,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928849790] [2021-10-13 01:24:49,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 01:24:49,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:49,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:49,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:49,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 01:24:49,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-13 01:24:49,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 01:24:49,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 01:24:49,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-10-13 01:24:50,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928849790] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:50,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:50,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2021-10-13 01:24:50,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223465843] [2021-10-13 01:24:50,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-13 01:24:50,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:50,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-13 01:24:50,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:24:50,154 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2021-10-13 01:24:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:50,326 INFO L93 Difference]: Finished difference Result 93 states and 139 transitions. [2021-10-13 01:24:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:24:50,326 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) Word has length 79 [2021-10-13 01:24:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:50,337 INFO L225 Difference]: With dead ends: 93 [2021-10-13 01:24:50,337 INFO L226 Difference]: Without dead ends: 87 [2021-10-13 01:24:50,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 78.5ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-10-13 01:24:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-10-13 01:24:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2021-10-13 01:24:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (43), 21 states have call predecessors, (43), 16 states have call successors, (43) [2021-10-13 01:24:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2021-10-13 01:24:50,380 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 79 [2021-10-13 01:24:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:50,382 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2021-10-13 01:24:50,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2021-10-13 01:24:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2021-10-13 01:24:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-13 01:24:50,390 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:50,390 INFO L512 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:50,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:50,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:50,592 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1766942948, now seen corresponding path program 4 times [2021-10-13 01:24:50,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:50,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481626696] [2021-10-13 01:24:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:50,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:24:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 01:24:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 01:24:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-13 01:24:51,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:51,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481626696] [2021-10-13 01:24:51,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481626696] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:51,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958136968] [2021-10-13 01:24:51,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 01:24:51,049 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:51,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:51,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:51,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 01:24:51,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 01:24:51,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 01:24:51,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 01:24:51,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-13 01:24:51,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958136968] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:51,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:51,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2021-10-13 01:24:51,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846203616] [2021-10-13 01:24:51,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-13 01:24:51,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-13 01:24:51,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-10-13 01:24:51,648 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2021-10-13 01:24:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:51,866 INFO L93 Difference]: Finished difference Result 205 states and 344 transitions. [2021-10-13 01:24:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 01:24:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) Word has length 174 [2021-10-13 01:24:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:51,876 INFO L225 Difference]: With dead ends: 205 [2021-10-13 01:24:51,876 INFO L226 Difference]: Without dead ends: 201 [2021-10-13 01:24:51,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-10-13 01:24:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-13 01:24:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189. [2021-10-13 01:24:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 42 states have call successors, (42), 13 states have call predecessors, (42), 25 states have return successors, (137), 54 states have call predecessors, (137), 42 states have call successors, (137) [2021-10-13 01:24:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 323 transitions. [2021-10-13 01:24:51,917 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 323 transitions. Word has length 174 [2021-10-13 01:24:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:51,918 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 323 transitions. [2021-10-13 01:24:51,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2021-10-13 01:24:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 323 transitions. [2021-10-13 01:24:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-10-13 01:24:51,925 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:51,925 INFO L512 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:51,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:52,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:52,152 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:52,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash -778425254, now seen corresponding path program 5 times [2021-10-13 01:24:52,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:52,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996926629] [2021-10-13 01:24:52,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:52,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:24:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 01:24:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 01:24:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 01:24:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 01:24:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2021-10-13 01:24:52,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:52,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996926629] [2021-10-13 01:24:52,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996926629] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:52,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727622573] [2021-10-13 01:24:52,861 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-13 01:24:52,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:52,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:52,864 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:52,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-13 01:24:53,153 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2021-10-13 01:24:53,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 01:24:53,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 01:24:53,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 801 proven. 327 refuted. 0 times theorem prover too weak. 3440 trivial. 0 not checked. [2021-10-13 01:24:53,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727622573] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:53,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:53,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 19 [2021-10-13 01:24:53,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626859835] [2021-10-13 01:24:53,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 01:24:53,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 01:24:53,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:24:53,886 INFO L87 Difference]: Start difference. First operand 189 states and 323 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) [2021-10-13 01:24:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:54,158 INFO L93 Difference]: Finished difference Result 297 states and 574 transitions. [2021-10-13 01:24:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-13 01:24:54,159 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) Word has length 283 [2021-10-13 01:24:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:54,163 INFO L225 Difference]: With dead ends: 297 [2021-10-13 01:24:54,163 INFO L226 Difference]: Without dead ends: 100 [2021-10-13 01:24:54,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 135.2ms TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2021-10-13 01:24:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-10-13 01:24:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 71. [2021-10-13 01:24:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (43), 15 states have call predecessors, (43), 13 states have call successors, (43) [2021-10-13 01:24:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 115 transitions. [2021-10-13 01:24:54,186 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 115 transitions. Word has length 283 [2021-10-13 01:24:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:54,190 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 115 transitions. [2021-10-13 01:24:54,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) [2021-10-13 01:24:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 115 transitions. [2021-10-13 01:24:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-10-13 01:24:54,203 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:54,204 INFO L512 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:54,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:54,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:54,420 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:54,420 INFO L82 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 6 times [2021-10-13 01:24:54,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:54,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339126778] [2021-10-13 01:24:54,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:54,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:54,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:24:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 01:24:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 01:24:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 01:24:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 01:24:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-10-13 01:24:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 01:24:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 01:24:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 01:24:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 01:24:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 01:24:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:24:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 01:24:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:24:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-10-13 01:24:55,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:24:55,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339126778] [2021-10-13 01:24:55,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339126778] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:55,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576026351] [2021-10-13 01:24:55,996 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-13 01:24:55,996 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:55,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:24:56,000 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:24:56,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 01:24:56,658 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2021-10-13 01:24:56,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 01:24:56,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 01:24:56,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:24:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2668 proven. 293 refuted. 0 times theorem prover too weak. 13446 trivial. 0 not checked. [2021-10-13 01:24:57,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576026351] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:24:57,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:24:57,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12] total 30 [2021-10-13 01:24:57,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795905352] [2021-10-13 01:24:57,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-13 01:24:57,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:24:57,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-13 01:24:57,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2021-10-13 01:24:57,984 INFO L87 Difference]: Start difference. First operand 71 states and 115 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) [2021-10-13 01:24:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:24:58,817 INFO L93 Difference]: Finished difference Result 189 states and 398 transitions. [2021-10-13 01:24:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-13 01:24:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) Word has length 528 [2021-10-13 01:24:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:24:58,821 INFO L225 Difference]: With dead ends: 189 [2021-10-13 01:24:58,821 INFO L226 Difference]: Without dead ends: 121 [2021-10-13 01:24:58,824 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 686 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 518.9ms TimeCoverageRelationStatistics Valid=649, Invalid=2543, Unknown=0, NotChecked=0, Total=3192 [2021-10-13 01:24:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-13 01:24:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2021-10-13 01:24:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.075) internal successors, (86), 75 states have internal predecessors, (86), 21 states have call successors, (21), 18 states have call predecessors, (21), 9 states have return successors, (46), 17 states have call predecessors, (46), 21 states have call successors, (46) [2021-10-13 01:24:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 153 transitions. [2021-10-13 01:24:58,853 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 153 transitions. Word has length 528 [2021-10-13 01:24:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:24:58,855 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 153 transitions. [2021-10-13 01:24:58,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) [2021-10-13 01:24:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 153 transitions. [2021-10-13 01:24:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-10-13 01:24:58,865 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:24:58,866 INFO L512 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:24:58,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 01:24:59,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:24:59,080 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:24:59,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:24:59,080 INFO L82 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 7 times [2021-10-13 01:24:59,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:24:59,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633858356] [2021-10-13 01:24:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:24:59,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:24:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:24:59,183 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:24:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:24:59,451 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:24:59,451 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 01:24:59,452 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:24:59,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:24:59,463 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:24:59,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:24:59 BoogieIcfgContainer [2021-10-13 01:24:59,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:24:59,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:24:59,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:24:59,679 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:24:59,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:24:46" (3/4) ... [2021-10-13 01:24:59,681 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 01:24:59,847 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:24:59,847 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:24:59,849 INFO L168 Benchmark]: Toolchain (without parser) took 14224.56 ms. Allocated memory was 102.8 MB in the beginning and 218.1 MB in the end (delta: 115.3 MB). Free memory was 61.5 MB in the beginning and 122.1 MB in the end (delta: -60.6 MB). Peak memory consumption was 53.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:24:59,849 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 102.8 MB. Free memory is still 77.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:24:59,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.83 ms. Allocated memory is still 102.8 MB. Free memory was 61.3 MB in the beginning and 77.8 MB in the end (delta: -16.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:24:59,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.39 ms. Allocated memory is still 102.8 MB. Free memory was 77.8 MB in the beginning and 76.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:24:59,851 INFO L168 Benchmark]: Boogie Preprocessor took 34.05 ms. Allocated memory is still 102.8 MB. Free memory was 76.4 MB in the beginning and 75.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:24:59,852 INFO L168 Benchmark]: RCFGBuilder took 374.02 ms. Allocated memory is still 102.8 MB. Free memory was 75.3 MB in the beginning and 65.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:24:59,852 INFO L168 Benchmark]: TraceAbstraction took 13345.09 ms. Allocated memory was 102.8 MB in the beginning and 218.1 MB in the end (delta: 115.3 MB). Free memory was 65.4 MB in the beginning and 142.0 MB in the end (delta: -76.6 MB). Peak memory consumption was 100.7 MB. Max. memory is 16.1 GB. [2021-10-13 01:24:59,853 INFO L168 Benchmark]: Witness Printer took 167.89 ms. Allocated memory is still 218.1 MB. Free memory was 142.0 MB in the beginning and 122.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-13 01:24:59,855 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.24 ms. Allocated memory is still 102.8 MB. Free memory is still 77.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 255.83 ms. Allocated memory is still 102.8 MB. Free memory was 61.3 MB in the beginning and 77.8 MB in the end (delta: -16.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.39 ms. Allocated memory is still 102.8 MB. Free memory was 77.8 MB in the beginning and 76.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.05 ms. Allocated memory is still 102.8 MB. Free memory was 76.4 MB in the beginning and 75.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 374.02 ms. Allocated memory is still 102.8 MB. Free memory was 75.3 MB in the beginning and 65.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13345.09 ms. Allocated memory was 102.8 MB in the beginning and 218.1 MB in the end (delta: 115.3 MB). Free memory was 65.4 MB in the beginning and 142.0 MB in the end (delta: -76.6 MB). Peak memory consumption was 100.7 MB. Max. memory is 16.1 GB. * Witness Printer took 167.89 ms. Allocated memory is still 218.1 MB. Free memory was 142.0 MB in the beginning and 122.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13062.6ms, OverallIterations: 10, TraceHistogramMax: 77, EmptinessCheckTime: 66.4ms, AutomataDifference: 2244.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 155 SDtfs, 571 SDslu, 509 SDs, 0 SdLazy, 1292 SolverSat, 733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1064.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1629 GetRequests, 1480 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1109.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=7, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 218.3ms AutomataMinimizationTime, 9 MinimizatonAttempts, 59 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 178.1ms SsaConstructionTime, 1014.7ms SatisfiabilityAnalysisTime, 6616.1ms InterpolantComputationTime, 2777 NumberOfCodeBlocks, 2691 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 2301 ConstructedInterpolants, 0 QuantifiedInterpolants, 3541 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2577 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 40160/45994 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-13 01:24:59,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac6f56b1-c75a-4c75-8eaa-540e420d60e8/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...