./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61245002f662171c4f63dbacefaa0e216ea9fe3a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:20:54,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:20:54,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:20:54,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:20:54,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:20:54,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:20:54,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:20:54,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:20:54,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:20:54,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:20:54,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:20:54,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:20:54,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:20:54,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:20:54,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:20:54,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:20:54,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:20:54,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:20:54,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:20:54,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:20:54,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:20:54,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:20:54,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:20:54,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:20:54,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:20:54,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:20:54,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:20:54,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:20:54,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:20:54,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:20:54,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:20:54,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:20:54,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:20:54,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:20:54,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:20:54,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:20:54,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:20:54,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:20:54,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:20:54,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:20:54,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:20:54,413 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:20:54,437 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:20:54,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:20:54,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:20:54,439 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:20:54,439 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:20:54,439 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:20:54,439 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:20:54,439 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:20:54,440 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:20:54,440 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:20:54,440 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:20:54,440 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:20:54,441 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:20:54,441 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:20:54,441 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:20:54,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:20:54,442 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:20:54,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:20:54,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:20:54,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:20:54,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:20:54,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:20:54,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:20:54,443 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:20:54,444 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:20:54,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:20:54,444 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:20:54,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:20:54,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:20:54,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:20:54,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:20:54,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:20:54,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:20:54,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:20:54,446 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:20:54,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:20:54,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:20:54,447 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:20:54,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:20:54,447 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/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_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 61245002f662171c4f63dbacefaa0e216ea9fe3a [2021-10-11 02:20:54,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:20:54,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:20:54,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:20:54,715 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:20:54,716 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:20:54,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2021-10-11 02:20:54,795 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/data/0799a0238/cf27f310de3849e0a1f9b5be9c6dc831/FLAGd3601f9a7 [2021-10-11 02:20:55,305 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:20:55,305 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2021-10-11 02:20:55,315 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/data/0799a0238/cf27f310de3849e0a1f9b5be9c6dc831/FLAGd3601f9a7 [2021-10-11 02:20:55,689 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/data/0799a0238/cf27f310de3849e0a1f9b5be9c6dc831 [2021-10-11 02:20:55,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:20:55,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:20:55,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:20:55,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:20:55,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:20:55,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5231777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55, skipping insertion in model container [2021-10-11 02:20:55,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:20:55,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:20:55,859 WARN L226 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_eba0f84a-3fab-48e7-9e61-678cfb296d8a/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c[946,959] [2021-10-11 02:20:55,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:20:55,871 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:20:55,887 WARN L226 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_eba0f84a-3fab-48e7-9e61-678cfb296d8a/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c[946,959] [2021-10-11 02:20:55,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:20:55,901 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:20:55,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55 WrapperNode [2021-10-11 02:20:55,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:20:55,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:20:55,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:20:55,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:20:55,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:20:55,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:20:55,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:20:55,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:20:55,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... [2021-10-11 02:20:55,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:20:55,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:20:55,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:20:55,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:20:55,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:20:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:20:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-10-11 02:20:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-10-11 02:20:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:20:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-10-11 02:20:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-10-11 02:20:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:20:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:20:56,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:20:56,277 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 02:20:56,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:20:56 BoogieIcfgContainer [2021-10-11 02:20:56,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:20:56,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:20:56,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:20:56,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:20:56,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:20:55" (1/3) ... [2021-10-11 02:20:56,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4074cb6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:20:56, skipping insertion in model container [2021-10-11 02:20:56,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:55" (2/3) ... [2021-10-11 02:20:56,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4074cb6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:20:56, skipping insertion in model container [2021-10-11 02:20:56,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:20:56" (3/3) ... [2021-10-11 02:20:56,288 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2021-10-11 02:20:56,320 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:20:56,323 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:20:56,334 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:20:56,376 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:20:56,376 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:20:56,376 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:20:56,376 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:20:56,377 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:20:56,377 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:20:56,377 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:20:56,377 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:20:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2021-10-11 02:20:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:20:56,397 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:20:56,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:20:56,398 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:20:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:20:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2021-10-11 02:20:56,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:20:56,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43442672] [2021-10-11 02:20:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:20:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:20:56,747 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-11 02:20:56,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43442672] [2021-10-11 02:20:56,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:20:56,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:20:56,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547354207] [2021-10-11 02:20:56,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:20:56,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:20:56,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:20:56,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:20:56,779 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2021-10-11 02:20:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:20:56,911 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2021-10-11 02:20:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:20:56,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-10-11 02:20:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:20:56,924 INFO L225 Difference]: With dead ends: 34 [2021-10-11 02:20:56,925 INFO L226 Difference]: Without dead ends: 26 [2021-10-11 02:20:56,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:20:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-11 02:20:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-11 02:20:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-11 02:20:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-11 02:20:56,977 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2021-10-11 02:20:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:20:56,977 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-11 02:20:56,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:20:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-11 02:20:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:20:56,981 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:20:56,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:20:56,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:20:56,982 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:20:56,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:20:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2021-10-11 02:20:56,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:20:56,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072687815] [2021-10-11 02:20:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:20:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:20:57,070 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-11 02:20:57,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072687815] [2021-10-11 02:20:57,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:20:57,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:20:57,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915919325] [2021-10-11 02:20:57,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:20:57,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:20:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:20:57,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:20:57,078 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2021-10-11 02:20:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:20:57,151 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2021-10-11 02:20:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:20:57,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-10-11 02:20:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:20:57,156 INFO L225 Difference]: With dead ends: 32 [2021-10-11 02:20:57,156 INFO L226 Difference]: Without dead ends: 28 [2021-10-11 02:20:57,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:20:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-10-11 02:20:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-10-11 02:20:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-11 02:20:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-11 02:20:57,171 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2021-10-11 02:20:57,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:20:57,172 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-11 02:20:57,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:20:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-11 02:20:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:20:57,175 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:20:57,175 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:20:57,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:20:57,177 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:20:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:20:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2021-10-11 02:20:57,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:20:57,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902634342] [2021-10-11 02:20:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:20:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:20:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:20:57,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902634342] [2021-10-11 02:20:57,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768220116] [2021-10-11 02:20:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:20:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:20:57,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:20:57,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:20:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:20:57,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:20:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:20:57,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [467892646] [2021-10-11 02:20:57,862 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-11 02:20:57,863 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:20:57,869 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:20:57,879 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:20:57,880 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:20:58,073 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:20:58,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:20:58,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-10-11 02:20:58,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260053436] [2021-10-11 02:20:58,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-10-11 02:20:58,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:20:58,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 02:20:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:20:58,078 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2021-10-11 02:20:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:20:58,257 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2021-10-11 02:20:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-11 02:20:58,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2021-10-11 02:20:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:20:58,261 INFO L225 Difference]: With dead ends: 54 [2021-10-11 02:20:58,261 INFO L226 Difference]: Without dead ends: 30 [2021-10-11 02:20:58,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:20:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-10-11 02:20:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-10-11 02:20:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-10-11 02:20:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-10-11 02:20:58,277 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2021-10-11 02:20:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:20:58,277 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-10-11 02:20:58,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-10-11 02:20:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-10-11 02:20:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:20:58,281 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:20:58,281 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:20:58,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-11 02:20:58,497 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:20:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:20:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2021-10-11 02:20:58,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:20:58,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191276386] [2021-10-11 02:20:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:20:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:20:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:20:58,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191276386] [2021-10-11 02:20:58,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555729657] [2021-10-11 02:20:58,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:20:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:20:58,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:20:58,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:20:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:20:58,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:20:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:20:58,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [788040776] [2021-10-11 02:20:58,893 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2021-10-11 02:20:58,893 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:20:58,894 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:20:58,894 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:20:58,894 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:20:59,118 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:20:59,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:20:59,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-10-11 02:20:59,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061237654] [2021-10-11 02:20:59,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-10-11 02:20:59,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:20:59,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-11 02:20:59,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:20:59,124 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2021-10-11 02:20:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:20:59,263 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2021-10-11 02:20:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:20:59,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2021-10-11 02:20:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:20:59,268 INFO L225 Difference]: With dead ends: 39 [2021-10-11 02:20:59,269 INFO L226 Difference]: Without dead ends: 35 [2021-10-11 02:20:59,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:20:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-11 02:20:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2021-10-11 02:20:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-10-11 02:20:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2021-10-11 02:20:59,278 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2021-10-11 02:20:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:20:59,278 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-10-11 02:20:59,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-10-11 02:20:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2021-10-11 02:20:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-11 02:20:59,280 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:20:59,281 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:20:59,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-11 02:20:59,509 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:20:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:20:59,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2021-10-11 02:20:59,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:20:59,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761833140] [2021-10-11 02:20:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:20:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:20:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:20:59,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761833140] [2021-10-11 02:20:59,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079709955] [2021-10-11 02:20:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:20:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:20:59,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:20:59,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:20:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:20:59,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:21:00,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496200113] [2021-10-11 02:21:00,139 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:21:00,140 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:21:00,141 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:21:00,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:21:00,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2021-10-11 02:21:00,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254205171] [2021-10-11 02:21:00,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-10-11 02:21:00,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:00,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-11 02:21:00,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:21:00,147 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2021-10-11 02:21:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:00,397 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2021-10-11 02:21:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:21:00,399 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2021-10-11 02:21:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:00,404 INFO L225 Difference]: With dead ends: 66 [2021-10-11 02:21:00,406 INFO L226 Difference]: Without dead ends: 35 [2021-10-11 02:21:00,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-10-11 02:21:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-11 02:21:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-10-11 02:21:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-10-11 02:21:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2021-10-11 02:21:00,426 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2021-10-11 02:21:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:00,427 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-10-11 02:21:00,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-10-11 02:21:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2021-10-11 02:21:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:21:00,430 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:00,430 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:00,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-10-11 02:21:00,644 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2021-10-11 02:21:00,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:00,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648895528] [2021-10-11 02:21:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-11 02:21:00,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648895528] [2021-10-11 02:21:00,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289498965] [2021-10-11 02:21:00,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:00,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:21:00,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:21:00,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:21:01,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2114555488] [2021-10-11 02:21:01,322 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:21:01,322 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:21:01,322 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:21:01,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:21:01,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2021-10-11 02:21:01,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269486099] [2021-10-11 02:21:01,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-10-11 02:21:01,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:01,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-11 02:21:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:21:01,326 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 18 states. [2021-10-11 02:21:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:01,914 INFO L93 Difference]: Finished difference Result 98 states and 158 transitions. [2021-10-11 02:21:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-11 02:21:01,915 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2021-10-11 02:21:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:01,917 INFO L225 Difference]: With dead ends: 98 [2021-10-11 02:21:01,917 INFO L226 Difference]: Without dead ends: 65 [2021-10-11 02:21:01,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2021-10-11 02:21:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-11 02:21:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2021-10-11 02:21:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-10-11 02:21:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2021-10-11 02:21:01,930 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 36 [2021-10-11 02:21:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:01,931 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-10-11 02:21:01,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-10-11 02:21:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2021-10-11 02:21:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-11 02:21:01,934 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:01,934 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:02,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:02,145 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2021-10-11 02:21:02,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:02,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452371294] [2021-10-11 02:21:02,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:21:02,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452371294] [2021-10-11 02:21:02,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184933029] [2021-10-11 02:21:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:02,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:21:02,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-11 02:21:02,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-11 02:21:02,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [135312835] [2021-10-11 02:21:02,987 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:21:02,987 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:21:02,987 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:21:02,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:21:02,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 16 [2021-10-11 02:21:02,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167727418] [2021-10-11 02:21:02,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-10-11 02:21:02,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:02,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-11 02:21:02,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-10-11 02:21:02,990 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 16 states. [2021-10-11 02:21:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:03,272 INFO L93 Difference]: Finished difference Result 102 states and 193 transitions. [2021-10-11 02:21:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:21:03,273 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2021-10-11 02:21:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:03,276 INFO L225 Difference]: With dead ends: 102 [2021-10-11 02:21:03,276 INFO L226 Difference]: Without dead ends: 98 [2021-10-11 02:21:03,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:21:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-10-11 02:21:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2021-10-11 02:21:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-10-11 02:21:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2021-10-11 02:21:03,297 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 50 [2021-10-11 02:21:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:03,298 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2021-10-11 02:21:03,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-10-11 02:21:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2021-10-11 02:21:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-11 02:21:03,303 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:03,303 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:03,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-10-11 02:21:03,509 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -110138383, now seen corresponding path program 1 times [2021-10-11 02:21:03,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:03,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705181675] [2021-10-11 02:21:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 36 proven. 58 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-10-11 02:21:03,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705181675] [2021-10-11 02:21:03,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168059081] [2021-10-11 02:21:03,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:03,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:21:03,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 36 proven. 58 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-10-11 02:21:03,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-10-11 02:21:04,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2050933116] [2021-10-11 02:21:04,456 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:21:04,457 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:21:04,457 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:21:04,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:21:04,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2021-10-11 02:21:04,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70542782] [2021-10-11 02:21:04,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:21:04,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:04,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:21:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:21:04,461 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 11 states. [2021-10-11 02:21:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:04,611 INFO L93 Difference]: Finished difference Result 91 states and 167 transitions. [2021-10-11 02:21:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:21:04,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2021-10-11 02:21:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:04,615 INFO L225 Difference]: With dead ends: 91 [2021-10-11 02:21:04,615 INFO L226 Difference]: Without dead ends: 87 [2021-10-11 02:21:04,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:21:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-10-11 02:21:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2021-10-11 02:21:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-10-11 02:21:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 105 transitions. [2021-10-11 02:21:04,632 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 105 transitions. Word has length 106 [2021-10-11 02:21:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:04,633 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 105 transitions. [2021-10-11 02:21:04,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:21:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 105 transitions. [2021-10-11 02:21:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-11 02:21:04,637 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:04,637 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:04,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:04,861 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:04,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1780776373, now seen corresponding path program 1 times [2021-10-11 02:21:04,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:04,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690689480] [2021-10-11 02:21:04,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-10-11 02:21:05,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690689480] [2021-10-11 02:21:05,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310815840] [2021-10-11 02:21:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:05,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 63 conjunts are in the unsatisfiable core [2021-10-11 02:21:05,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-10-11 02:21:05,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-10-11 02:21:07,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1945878561] [2021-10-11 02:21:07,094 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:21:07,094 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:21:07,095 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:21:07,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:21:07,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 28 [2021-10-11 02:21:07,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475021346] [2021-10-11 02:21:07,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-10-11 02:21:07,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:07,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-11 02:21:07,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2021-10-11 02:21:07,098 INFO L87 Difference]: Start difference. First operand 63 states and 105 transitions. Second operand 28 states. [2021-10-11 02:21:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:07,531 INFO L93 Difference]: Finished difference Result 131 states and 288 transitions. [2021-10-11 02:21:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-11 02:21:07,532 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 105 [2021-10-11 02:21:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:07,535 INFO L225 Difference]: With dead ends: 131 [2021-10-11 02:21:07,535 INFO L226 Difference]: Without dead ends: 127 [2021-10-11 02:21:07,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 187 SyntacticMatches, 28 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2021-10-11 02:21:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-10-11 02:21:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 89. [2021-10-11 02:21:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-10-11 02:21:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 181 transitions. [2021-10-11 02:21:07,563 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 181 transitions. Word has length 105 [2021-10-11 02:21:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:07,563 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 181 transitions. [2021-10-11 02:21:07,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-10-11 02:21:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 181 transitions. [2021-10-11 02:21:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-11 02:21:07,569 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:07,569 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:07,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-10-11 02:21:07,784 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:07,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:07,785 INFO L82 PathProgramCache]: Analyzing trace with hash 189095314, now seen corresponding path program 2 times [2021-10-11 02:21:07,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:07,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446814052] [2021-10-11 02:21:07,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 69 proven. 76 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-10-11 02:21:07,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446814052] [2021-10-11 02:21:07,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413837610] [2021-10-11 02:21:07,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:08,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-10-11 02:21:08,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:21:08,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:21:08,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 227 proven. 4 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-10-11 02:21:08,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 89 proven. 54 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-10-11 02:21:08,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [574241317] [2021-10-11 02:21:08,921 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:21:08,922 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:21:08,922 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:21:08,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:21:08,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 20 [2021-10-11 02:21:08,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006965949] [2021-10-11 02:21:08,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-10-11 02:21:08,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:08,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-11 02:21:08,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-10-11 02:21:08,925 INFO L87 Difference]: Start difference. First operand 89 states and 181 transitions. Second operand 20 states. [2021-10-11 02:21:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:09,533 INFO L93 Difference]: Finished difference Result 238 states and 620 transitions. [2021-10-11 02:21:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-11 02:21:09,534 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 120 [2021-10-11 02:21:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:09,536 INFO L225 Difference]: With dead ends: 238 [2021-10-11 02:21:09,536 INFO L226 Difference]: Without dead ends: 64 [2021-10-11 02:21:09,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2021-10-11 02:21:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-11 02:21:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-11 02:21:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-10-11 02:21:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2021-10-11 02:21:09,556 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 120 [2021-10-11 02:21:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:09,557 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2021-10-11 02:21:09,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-10-11 02:21:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2021-10-11 02:21:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-10-11 02:21:09,563 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:09,563 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:09,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-10-11 02:21:09,789 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:09,789 INFO L82 PathProgramCache]: Analyzing trace with hash -187435723, now seen corresponding path program 3 times [2021-10-11 02:21:09,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:09,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488542190] [2021-10-11 02:21:09,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 103 proven. 27 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2021-10-11 02:21:09,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488542190] [2021-10-11 02:21:09,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48956484] [2021-10-11 02:21:09,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:09,976 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:21:09,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:21:09,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-11 02:21:09,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 95 proven. 170 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-10-11 02:21:10,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 95 proven. 179 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2021-10-11 02:21:11,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [216308885] [2021-10-11 02:21:11,965 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:21:11,965 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:21:11,966 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:21:11,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:21:11,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 19] total 29 [2021-10-11 02:21:11,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127274104] [2021-10-11 02:21:11,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-10-11 02:21:11,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:11,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-10-11 02:21:11,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2021-10-11 02:21:11,971 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 29 states. [2021-10-11 02:21:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:12,969 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2021-10-11 02:21:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-11 02:21:12,969 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2021-10-11 02:21:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:12,970 INFO L225 Difference]: With dead ends: 176 [2021-10-11 02:21:12,970 INFO L226 Difference]: Without dead ends: 104 [2021-10-11 02:21:12,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2021-10-11 02:21:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-11 02:21:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2021-10-11 02:21:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-10-11 02:21:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2021-10-11 02:21:12,981 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 132 [2021-10-11 02:21:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:12,982 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2021-10-11 02:21:12,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-10-11 02:21:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2021-10-11 02:21:12,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-11 02:21:12,984 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:21:12,984 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:21:13,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-10-11 02:21:13,209 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:21:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:21:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1849668921, now seen corresponding path program 4 times [2021-10-11 02:21:13,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:21:13,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383462025] [2021-10-11 02:21:13,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:21:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 96 proven. 18 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-10-11 02:21:13,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383462025] [2021-10-11 02:21:13,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005679943] [2021-10-11 02:21:13,314 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:21:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:21:13,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:21:13,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:21:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 96 proven. 18 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-10-11 02:21:13,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:21:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 96 proven. 24 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-10-11 02:21:14,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1275052956] [2021-10-11 02:21:14,244 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:21:14,245 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:21:14,246 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:21:14,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:21:14,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 13 [2021-10-11 02:21:14,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788067992] [2021-10-11 02:21:14,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-10-11 02:21:14,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:21:14,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 02:21:14,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:21:14,251 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand 13 states. [2021-10-11 02:21:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:21:14,404 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2021-10-11 02:21:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:21:14,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 106 [2021-10-11 02:21:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:21:14,405 INFO L225 Difference]: With dead ends: 101 [2021-10-11 02:21:14,405 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:21:14,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 208 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:21:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:21:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:21:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:21:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:21:14,409 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2021-10-11 02:21:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:21:14,409 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:21:14,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-10-11 02:21:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:21:14,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:21:14,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-10-11 02:21:14,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:21:15,318 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2021-10-11 02:21:15,764 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 27 [2021-10-11 02:21:15,828 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:21:15,828 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:21:15,828 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2021-10-11 02:21:15,828 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2021-10-11 02:21:15,828 INFO L262 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2021-10-11 02:21:15,829 INFO L258 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 5 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 5)) [2021-10-11 02:21:15,829 INFO L262 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2021-10-11 02:21:15,829 INFO L258 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~x~0) [2021-10-11 02:21:15,829 INFO L265 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2021-10-11 02:21:15,829 INFO L258 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= |fibo2_#in~n| fibo2_~n) (< 1 fibo2_~n) (<= fibo2_~n |fibo2_#in~n|)) [2021-10-11 02:21:15,830 INFO L262 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2021-10-11 02:21:15,830 INFO L258 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#in~n| fibo2_~n)) (.cse1 (<= fibo2_~n |fibo2_#in~n|))) (let ((.cse2 (and (<= |fibo2_#in~n| 3) .cse0 (< 1 fibo2_~n) (= |fibo2_#t~ret9| 1) .cse1))) (and (or (and .cse0 (<= 5 |fibo2_#in~n|) .cse1) (and (<= |fibo2_#t~ret9| 2) .cse0 (<= 2 |fibo2_#t~ret9|) .cse1) .cse2) (or (<= 4 |fibo2_#in~n|) .cse2)))) [2021-10-11 02:21:15,830 INFO L262 CegarLoopResult]: For program point L22(lines 22 26) no Hoare annotation was computed. [2021-10-11 02:21:15,830 INFO L262 CegarLoopResult]: For program point L25-3(line 25) no Hoare annotation was computed. [2021-10-11 02:21:15,830 INFO L262 CegarLoopResult]: For program point L20(lines 20 26) no Hoare annotation was computed. [2021-10-11 02:21:15,830 INFO L262 CegarLoopResult]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2021-10-11 02:21:15,830 INFO L262 CegarLoopResult]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2021-10-11 02:21:15,831 INFO L265 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2021-10-11 02:21:15,831 INFO L258 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (<= |fibo1_#in~n| fibo1_~n) (<= fibo1_~n |fibo1_#in~n|)) [2021-10-11 02:21:15,831 INFO L262 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2021-10-11 02:21:15,831 INFO L258 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse3 (<= 3 fibo1_~n)) (.cse0 (<= 4 fibo1_~n)) (.cse6 (<= |fibo1_#in~n| 4)) (.cse4 (<= 1 |fibo1_#t~ret7|)) (.cse5 (<= |fibo1_#t~ret7| 1)) (.cse1 (<= |fibo1_#in~n| fibo1_~n)) (.cse2 (<= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#t~ret7|) .cse0 .cse1 .cse2 (<= |fibo1_#t~ret7| 3)) (and .cse3 .cse4 .cse1 .cse5 .cse2 .cse6) (and .cse3 .cse0 .cse1 .cse2 .cse6) (and .cse4 (<= |fibo1_#in~n| 2) (< 1 fibo1_~n) .cse5 .cse2) (and .cse1 .cse2 (<= 6 |fibo1_#in~n|)))) [2021-10-11 02:21:15,831 INFO L262 CegarLoopResult]: For program point L12(lines 12 16) no Hoare annotation was computed. [2021-10-11 02:21:15,831 INFO L262 CegarLoopResult]: For program point L15-3(line 15) no Hoare annotation was computed. [2021-10-11 02:21:15,832 INFO L262 CegarLoopResult]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2021-10-11 02:21:15,832 INFO L262 CegarLoopResult]: For program point L10(lines 10 16) no Hoare annotation was computed. [2021-10-11 02:21:15,832 INFO L262 CegarLoopResult]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2021-10-11 02:21:15,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:21:15 BoogieIcfgContainer [2021-10-11 02:21:15,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:21:15,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:21:15,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:21:15,846 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:21:15,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:20:56" (3/4) ... [2021-10-11 02:21:15,849 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:21:15,855 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2021-10-11 02:21:15,855 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2021-10-11 02:21:15,860 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-10-11 02:21:15,861 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 02:21:15,861 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-11 02:21:15,861 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:21:15,906 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eba0f84a-3fab-48e7-9e61-678cfb296d8a/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:21:15,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:21:15,907 INFO L168 Benchmark]: Toolchain (without parser) took 20214.54 ms. Allocated memory was 90.2 MB in the beginning and 293.6 MB in the end (delta: 203.4 MB). Free memory was 63.3 MB in the beginning and 241.7 MB in the end (delta: -178.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:15,908 INFO L168 Benchmark]: CDTParser took 0.94 ms. Allocated memory is still 90.2 MB. Free memory is still 59.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:21:15,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.55 ms. Allocated memory is still 90.2 MB. Free memory was 63.2 MB in the beginning and 53.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:15,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.27 ms. Allocated memory is still 90.2 MB. Free memory was 53.5 MB in the beginning and 52.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:15,909 INFO L168 Benchmark]: Boogie Preprocessor took 19.93 ms. Allocated memory is still 90.2 MB. Free memory was 52.2 MB in the beginning and 51.3 MB in the end (delta: 870.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:21:15,910 INFO L168 Benchmark]: RCFGBuilder took 323.70 ms. Allocated memory is still 90.2 MB. Free memory was 51.1 MB in the beginning and 36.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:15,910 INFO L168 Benchmark]: TraceAbstraction took 19564.13 ms. Allocated memory was 90.2 MB in the beginning and 293.6 MB in the end (delta: 203.4 MB). Free memory was 36.2 MB in the beginning and 243.8 MB in the end (delta: -207.6 MB). Peak memory consumption was 148.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:15,910 INFO L168 Benchmark]: Witness Printer took 61.12 ms. Allocated memory is still 293.6 MB. Free memory was 243.8 MB in the beginning and 241.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:21:15,913 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.94 ms. Allocated memory is still 90.2 MB. Free memory is still 59.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 208.55 ms. Allocated memory is still 90.2 MB. Free memory was 63.2 MB in the beginning and 53.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.27 ms. Allocated memory is still 90.2 MB. Free memory was 53.5 MB in the beginning and 52.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.93 ms. Allocated memory is still 90.2 MB. Free memory was 52.2 MB in the beginning and 51.3 MB in the end (delta: 870.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 323.70 ms. Allocated memory is still 90.2 MB. Free memory was 51.1 MB in the beginning and 36.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19564.13 ms. Allocated memory was 90.2 MB in the beginning and 293.6 MB in the end (delta: 203.4 MB). Free memory was 36.2 MB in the beginning and 243.8 MB in the end (delta: -207.6 MB). Peak memory consumption was 148.7 MB. Max. memory is 16.1 GB. * Witness Printer took 61.12 ms. Allocated memory is still 293.6 MB. Free memory was 243.8 MB in the beginning and 241.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 5 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.2s, OverallIterations: 12, TraceHistogramMax: 10, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 325 SDtfs, 525 SDslu, 2455 SDs, 0 SdLazy, 2509 SolverSat, 506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1665 GetRequests, 1385 SyntacticMatches, 50 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 114 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 206 PreInvPairs, 511 NumberOfFragments, 172 HoareAnnotationTreeSize, 206 FomulaSimplifications, 12045 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3842 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1489 NumberOfCodeBlocks, 1441 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2192 ConstructedInterpolants, 0 QuantifiedInterpolants, 430980 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1791 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 3899/5043 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...