./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Ackermann04.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_28646692-0794-4afd-bd23-90bd4a79755e/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/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_28646692-0794-4afd-bd23-90bd4a79755e/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Ackermann04.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/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_28646692-0794-4afd-bd23-90bd4a79755e/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 5e57a3ac5bdb229178b6e3922e8ce89677cf2614 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:33:06,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:33:06,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:33:06,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:33:06,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:33:06,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:33:06,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:33:06,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:33:06,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:33:06,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:33:06,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:33:06,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:33:06,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:33:06,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:33:06,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:33:06,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:33:06,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:33:06,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:33:06,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:33:06,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:33:06,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:33:06,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:33:06,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:33:06,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:33:06,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:33:06,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:33:06,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:33:06,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:33:06,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:33:06,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:33:06,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:33:06,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:33:06,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:33:06,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:33:06,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:33:06,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:33:06,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:33:06,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:33:06,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:33:06,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:33:06,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:33:06,592 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:33:06,631 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:33:06,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:33:06,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:33:06,633 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:33:06,634 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:33:06,634 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:33:06,634 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:33:06,634 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:33:06,634 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:33:06,635 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:33:06,636 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:33:06,636 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:33:06,636 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:33:06,636 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:33:06,637 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:33:06,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:33:06,638 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:33:06,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:33:06,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:33:06,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:33:06,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:33:06,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:33:06,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:33:06,639 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:33:06,639 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:33:06,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:33:06,640 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:33:06,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:33:06,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:33:06,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:33:06,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:33:06,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:33:06,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:33:06,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:33:06,643 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:33:06,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:33:06,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:33:06,644 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:33:06,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:33:06,644 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_28646692-0794-4afd-bd23-90bd4a79755e/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_28646692-0794-4afd-bd23-90bd4a79755e/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 -> 5e57a3ac5bdb229178b6e3922e8ce89677cf2614 [2021-10-11 02:33:06,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:33:06,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:33:06,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:33:06,957 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:33:06,958 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:33:06,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/recursive/Ackermann04.c [2021-10-11 02:33:07,040 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/bin/utaipan-WLngWcDbfI/data/34a1fc900/958ec45e5a8044058e700f345103fd90/FLAG51e50f538 [2021-10-11 02:33:07,570 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:33:07,571 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/sv-benchmarks/c/recursive/Ackermann04.c [2021-10-11 02:33:07,583 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/bin/utaipan-WLngWcDbfI/data/34a1fc900/958ec45e5a8044058e700f345103fd90/FLAG51e50f538 [2021-10-11 02:33:08,050 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/bin/utaipan-WLngWcDbfI/data/34a1fc900/958ec45e5a8044058e700f345103fd90 [2021-10-11 02:33:08,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:33:08,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:33:08,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:33:08,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:33:08,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:33:08,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:33:08" (1/1) ... [2021-10-11 02:33:08,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344cdb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08, skipping insertion in model container [2021-10-11 02:33:08,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:33:08" (1/1) ... [2021-10-11 02:33:08,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:33:08,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:33:08,289 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_28646692-0794-4afd-bd23-90bd4a79755e/sv-benchmarks/c/recursive/Ackermann04.c[1166,1179] [2021-10-11 02:33:08,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:33:08,303 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:33:08,321 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_28646692-0794-4afd-bd23-90bd4a79755e/sv-benchmarks/c/recursive/Ackermann04.c[1166,1179] [2021-10-11 02:33:08,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:33:08,336 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:33:08,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08 WrapperNode [2021-10-11 02:33:08,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:33:08,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:33:08,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:33:08,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:33:08,347 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:33:08" (1/1) ... [2021-10-11 02:33:08,354 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:33:08" (1/1) ... [2021-10-11 02:33:08,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:33:08,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:33:08,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:33:08,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:33:08,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08" (1/1) ... [2021-10-11 02:33:08,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08" (1/1) ... [2021-10-11 02:33:08,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08" (1/1) ... [2021-10-11 02:33:08,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08" (1/1) ... [2021-10-11 02:33:08,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08" (1/1) ... [2021-10-11 02:33:08,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08" (1/1) ... [2021-10-11 02:33:08,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08" (1/1) ... [2021-10-11 02:33:08,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:33:08,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:33:08,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:33:08,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:33:08,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/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:33:08,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:33:08,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:33:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2021-10-11 02:33:08,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2021-10-11 02:33:08,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:33:08,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:33:08,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:33:08,712 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 02:33:08,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:33:08 BoogieIcfgContainer [2021-10-11 02:33:08,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:33:08,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:33:08,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:33:08,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:33:08,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:33:08" (1/3) ... [2021-10-11 02:33:08,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421d3c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:33:08, skipping insertion in model container [2021-10-11 02:33:08,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:33:08" (2/3) ... [2021-10-11 02:33:08,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421d3c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:33:08, skipping insertion in model container [2021-10-11 02:33:08,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:33:08" (3/3) ... [2021-10-11 02:33:08,723 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2021-10-11 02:33:08,737 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:33:08,740 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:33:08,752 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:33:08,775 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:33:08,776 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:33:08,776 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:33:08,776 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:33:08,776 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:33:08,776 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:33:08,776 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:33:08,777 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:33:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2021-10-11 02:33:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:33:08,798 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:08,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:08,799 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1538870455, now seen corresponding path program 1 times [2021-10-11 02:33:08,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:08,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110101383] [2021-10-11 02:33:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:09,157 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:33:09,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110101383] [2021-10-11 02:33:09,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:33:09,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:33:09,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4712576] [2021-10-11 02:33:09,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:33:09,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:09,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:33:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:33:09,184 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2021-10-11 02:33:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:09,328 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-10-11 02:33:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:33:09,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-10-11 02:33:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:09,343 INFO L225 Difference]: With dead ends: 34 [2021-10-11 02:33:09,344 INFO L226 Difference]: Without dead ends: 24 [2021-10-11 02:33:09,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:33:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-11 02:33:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-11 02:33:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-10-11 02:33:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2021-10-11 02:33:09,396 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 11 [2021-10-11 02:33:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:09,397 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2021-10-11 02:33:09,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:33:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2021-10-11 02:33:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 02:33:09,401 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:09,402 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:09,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:33:09,402 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -108557995, now seen corresponding path program 1 times [2021-10-11 02:33:09,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:09,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945044821] [2021-10-11 02:33:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:33:09,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945044821] [2021-10-11 02:33:09,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170613711] [2021-10-11 02:33:09,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/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:33:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:09,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 02:33:09,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:33:09,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:33:09,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1820877255] [2021-10-11 02:33:09,887 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:33:09,887 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:09,893 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:33:09,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:09,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-10-11 02:33:09,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780092043] [2021-10-11 02:33:09,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:33:09,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:09,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:33:09,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:33:09,899 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 11 states. [2021-10-11 02:33:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:10,129 INFO L93 Difference]: Finished difference Result 73 states and 132 transitions. [2021-10-11 02:33:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-11 02:33:10,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2021-10-11 02:33:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:10,139 INFO L225 Difference]: With dead ends: 73 [2021-10-11 02:33:10,140 INFO L226 Difference]: Without dead ends: 49 [2021-10-11 02:33:10,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:33:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-10-11 02:33:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-10-11 02:33:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2021-10-11 02:33:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2021-10-11 02:33:10,175 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 18 [2021-10-11 02:33:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:10,176 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2021-10-11 02:33:10,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:33:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2021-10-11 02:33:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-11 02:33:10,181 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:10,181 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:10,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-10-11 02:33:10,403 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:10,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:10,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1262121361, now seen corresponding path program 1 times [2021-10-11 02:33:10,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:10,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803615220] [2021-10-11 02:33:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-10-11 02:33:10,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803615220] [2021-10-11 02:33:10,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457797610] [2021-10-11 02:33:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/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:33:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:10,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:33:10,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-10-11 02:33:10,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-10-11 02:33:11,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [558598777] [2021-10-11 02:33:11,355 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-11 02:33:11,355 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:11,355 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:33:11,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:11,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 8 [2021-10-11 02:33:11,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161887067] [2021-10-11 02:33:11,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:33:11,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:11,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:33:11,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:33:11,358 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand 8 states. [2021-10-11 02:33:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:11,526 INFO L93 Difference]: Finished difference Result 66 states and 126 transitions. [2021-10-11 02:33:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:33:11,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2021-10-11 02:33:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:11,531 INFO L225 Difference]: With dead ends: 66 [2021-10-11 02:33:11,531 INFO L226 Difference]: Without dead ends: 62 [2021-10-11 02:33:11,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:33:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-11 02:33:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-11 02:33:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2021-10-11 02:33:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 122 transitions. [2021-10-11 02:33:11,551 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 122 transitions. Word has length 44 [2021-10-11 02:33:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:11,551 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 122 transitions. [2021-10-11 02:33:11,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:33:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 122 transitions. [2021-10-11 02:33:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-11 02:33:11,558 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:11,558 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:11,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:11,772 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:11,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1396423690, now seen corresponding path program 2 times [2021-10-11 02:33:11,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:11,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338720729] [2021-10-11 02:33:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 104 proven. 14 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-11 02:33:11,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338720729] [2021-10-11 02:33:11,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898703182] [2021-10-11 02:33:11,958 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_28646692-0794-4afd-bd23-90bd4a79755e/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:33:12,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-10-11 02:33:12,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:33:12,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-11 02:33:12,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 98 proven. 19 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-10-11 02:33:12,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 105 proven. 13 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-11 02:33:13,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [547582292] [2021-10-11 02:33:13,065 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-11 02:33:13,065 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:13,066 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:33:13,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:13,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 18 [2021-10-11 02:33:13,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881539715] [2021-10-11 02:33:13,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-10-11 02:33:13,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:13,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-11 02:33:13,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:33:13,069 INFO L87 Difference]: Start difference. First operand 62 states and 122 transitions. Second operand 18 states. [2021-10-11 02:33:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:13,988 INFO L93 Difference]: Finished difference Result 225 states and 869 transitions. [2021-10-11 02:33:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-11 02:33:13,988 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2021-10-11 02:33:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:14,008 INFO L225 Difference]: With dead ends: 225 [2021-10-11 02:33:14,009 INFO L226 Difference]: Without dead ends: 167 [2021-10-11 02:33:14,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=919, Unknown=0, NotChecked=0, Total=1190 [2021-10-11 02:33:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-11 02:33:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 105. [2021-10-11 02:33:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-10-11 02:33:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 304 transitions. [2021-10-11 02:33:14,126 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 304 transitions. Word has length 78 [2021-10-11 02:33:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:14,129 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 304 transitions. [2021-10-11 02:33:14,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-10-11 02:33:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 304 transitions. [2021-10-11 02:33:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-11 02:33:14,143 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:14,144 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 10, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:14,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:14,364 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1560304543, now seen corresponding path program 3 times [2021-10-11 02:33:14,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:14,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368604752] [2021-10-11 02:33:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 130 proven. 208 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2021-10-11 02:33:14,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368604752] [2021-10-11 02:33:14,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806310472] [2021-10-11 02:33:14,697 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_28646692-0794-4afd-bd23-90bd4a79755e/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:33:14,812 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:33:14,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:33:14,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-11 02:33:14,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 362 proven. 123 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-10-11 02:33:15,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 141 proven. 261 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2021-10-11 02:33:16,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2064118043] [2021-10-11 02:33:16,878 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-11 02:33:16,879 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:16,879 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:33:16,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:16,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 15] total 30 [2021-10-11 02:33:16,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411064070] [2021-10-11 02:33:16,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-10-11 02:33:16,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:16,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-11 02:33:16,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2021-10-11 02:33:16,882 INFO L87 Difference]: Start difference. First operand 105 states and 304 transitions. Second operand 30 states. [2021-10-11 02:33:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:21,304 INFO L93 Difference]: Finished difference Result 234 states and 848 transitions. [2021-10-11 02:33:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-10-11 02:33:21,304 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 117 [2021-10-11 02:33:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:21,307 INFO L225 Difference]: With dead ends: 234 [2021-10-11 02:33:21,307 INFO L226 Difference]: Without dead ends: 101 [2021-10-11 02:33:21,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2488 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1739, Invalid=7381, Unknown=0, NotChecked=0, Total=9120 [2021-10-11 02:33:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-10-11 02:33:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 84. [2021-10-11 02:33:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-10-11 02:33:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2021-10-11 02:33:21,327 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 117 [2021-10-11 02:33:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:21,328 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2021-10-11 02:33:21,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-10-11 02:33:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2021-10-11 02:33:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-10-11 02:33:21,344 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:21,344 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:21,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:21,557 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1090473022, now seen corresponding path program 4 times [2021-10-11 02:33:21,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:21,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985289561] [2021-10-11 02:33:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 149 proven. 293 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2021-10-11 02:33:21,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985289561] [2021-10-11 02:33:21,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108810913] [2021-10-11 02:33:21,828 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/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:33:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:21,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 21 conjunts are in the unsatisfiable core [2021-10-11 02:33:21,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-10-11 02:33:22,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 155 proven. 295 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2021-10-11 02:33:24,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1629520746] [2021-10-11 02:33:24,213 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-11 02:33:24,213 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:24,213 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:33:24,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:24,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 21 [2021-10-11 02:33:24,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747376179] [2021-10-11 02:33:24,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-10-11 02:33:24,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-11 02:33:24,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:33:24,216 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand 21 states. [2021-10-11 02:33:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:24,990 INFO L93 Difference]: Finished difference Result 193 states and 340 transitions. [2021-10-11 02:33:24,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-11 02:33:24,992 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 130 [2021-10-11 02:33:24,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:24,996 INFO L225 Difference]: With dead ends: 193 [2021-10-11 02:33:24,996 INFO L226 Difference]: Without dead ends: 108 [2021-10-11 02:33:24,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 255 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=462, Invalid=1608, Unknown=0, NotChecked=0, Total=2070 [2021-10-11 02:33:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-10-11 02:33:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2021-10-11 02:33:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-10-11 02:33:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2021-10-11 02:33:25,011 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 130 [2021-10-11 02:33:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:25,011 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2021-10-11 02:33:25,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-10-11 02:33:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2021-10-11 02:33:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-10-11 02:33:25,013 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:25,013 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:25,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-11 02:33:25,228 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash -511219076, now seen corresponding path program 5 times [2021-10-11 02:33:25,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:25,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243193392] [2021-10-11 02:33:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 439 proven. 281 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2021-10-11 02:33:25,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243193392] [2021-10-11 02:33:25,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753459820] [2021-10-11 02:33:25,635 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_28646692-0794-4afd-bd23-90bd4a79755e/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:33:25,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2021-10-11 02:33:25,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:33:25,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 35 conjunts are in the unsatisfiable core [2021-10-11 02:33:25,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2021-10-11 02:33:26,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2021-10-11 02:33:30,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1235360961] [2021-10-11 02:33:30,789 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-11 02:33:30,789 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:30,790 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:33:30,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:30,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 27] total 35 [2021-10-11 02:33:30,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440741198] [2021-10-11 02:33:30,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-10-11 02:33:30,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:30,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-10-11 02:33:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2021-10-11 02:33:30,794 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand 35 states. [2021-10-11 02:33:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:32,197 INFO L93 Difference]: Finished difference Result 223 states and 398 transitions. [2021-10-11 02:33:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-11 02:33:32,198 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 156 [2021-10-11 02:33:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:32,202 INFO L225 Difference]: With dead ends: 223 [2021-10-11 02:33:32,203 INFO L226 Difference]: Without dead ends: 132 [2021-10-11 02:33:32,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=860, Invalid=3696, Unknown=0, NotChecked=0, Total=4556 [2021-10-11 02:33:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-10-11 02:33:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2021-10-11 02:33:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2021-10-11 02:33:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 184 transitions. [2021-10-11 02:33:32,220 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 184 transitions. Word has length 156 [2021-10-11 02:33:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:32,220 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 184 transitions. [2021-10-11 02:33:32,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2021-10-11 02:33:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 184 transitions. [2021-10-11 02:33:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-10-11 02:33:32,222 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:32,223 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:32,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:32,436 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1922447937, now seen corresponding path program 6 times [2021-10-11 02:33:32,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:32,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634603751] [2021-10-11 02:33:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 495 proven. 368 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2021-10-11 02:33:32,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634603751] [2021-10-11 02:33:32,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652484024] [2021-10-11 02:33:32,884 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_28646692-0794-4afd-bd23-90bd4a79755e/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:33:33,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:33:33,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:33:33,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 37 conjunts are in the unsatisfiable core [2021-10-11 02:33:33,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2021-10-11 02:33:33,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:34,370 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-10-11 02:33:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2021-10-11 02:33:38,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1619742952] [2021-10-11 02:33:38,284 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-11 02:33:38,284 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:38,285 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:33:38,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:38,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 32 [2021-10-11 02:33:38,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938219638] [2021-10-11 02:33:38,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-10-11 02:33:38,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:38,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-11 02:33:38,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2021-10-11 02:33:38,289 INFO L87 Difference]: Start difference. First operand 114 states and 184 transitions. Second operand 32 states. [2021-10-11 02:33:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:39,832 INFO L93 Difference]: Finished difference Result 262 states and 496 transitions. [2021-10-11 02:33:39,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-10-11 02:33:39,833 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 169 [2021-10-11 02:33:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:39,836 INFO L225 Difference]: With dead ends: 262 [2021-10-11 02:33:39,837 INFO L226 Difference]: Without dead ends: 156 [2021-10-11 02:33:39,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 334 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=973, Invalid=3857, Unknown=0, NotChecked=0, Total=4830 [2021-10-11 02:33:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-11 02:33:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2021-10-11 02:33:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2021-10-11 02:33:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 217 transitions. [2021-10-11 02:33:39,860 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 217 transitions. Word has length 169 [2021-10-11 02:33:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:39,862 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 217 transitions. [2021-10-11 02:33:39,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-10-11 02:33:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 217 transitions. [2021-10-11 02:33:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-10-11 02:33:39,866 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:39,866 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:40,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:40,080 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2140695240, now seen corresponding path program 7 times [2021-10-11 02:33:40,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:40,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734344456] [2021-10-11 02:33:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 681 proven. 75 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2021-10-11 02:33:40,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734344456] [2021-10-11 02:33:40,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855808658] [2021-10-11 02:33:40,585 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/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:33:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:40,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 40 conjunts are in the unsatisfiable core [2021-10-11 02:33:40,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2021-10-11 02:33:41,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:42,325 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-10-11 02:33:42,446 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-10-11 02:33:42,570 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-10-11 02:33:42,695 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-10-11 02:33:42,818 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-10-11 02:33:42,936 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-10-11 02:33:43,061 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-10-11 02:33:43,184 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-10-11 02:33:44,358 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-10-11 02:33:44,465 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-10-11 02:33:44,580 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-10-11 02:33:44,694 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-10-11 02:33:45,821 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-10-11 02:33:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2021-10-11 02:33:47,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [894487695] [2021-10-11 02:33:47,965 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-10-11 02:33:47,965 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:47,965 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:33:47,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:47,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 37 [2021-10-11 02:33:47,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572084039] [2021-10-11 02:33:47,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-10-11 02:33:47,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:47,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-10-11 02:33:47,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2021-10-11 02:33:47,975 INFO L87 Difference]: Start difference. First operand 129 states and 217 transitions. Second operand 37 states. [2021-10-11 02:33:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:50,144 INFO L93 Difference]: Finished difference Result 176 states and 297 transitions. [2021-10-11 02:33:50,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-10-11 02:33:50,153 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 182 [2021-10-11 02:33:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:50,154 INFO L225 Difference]: With dead ends: 176 [2021-10-11 02:33:50,154 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:33:50,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=991, Invalid=4559, Unknown=0, NotChecked=0, Total=5550 [2021-10-11 02:33:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:33:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:33:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:33:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:33:50,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2021-10-11 02:33:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:50,159 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:33:50,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2021-10-11 02:33:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:33:50,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:33:50,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-11 02:33:50,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:33:51,074 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 61 [2021-10-11 02:33:51,221 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 55 [2021-10-11 02:33:51,357 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 55 [2021-10-11 02:33:51,917 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 84 [2021-10-11 02:33:52,130 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 84 [2021-10-11 02:33:52,250 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 84 [2021-10-11 02:33:52,469 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 84 [2021-10-11 02:33:52,587 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 84 [2021-10-11 02:33:52,726 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 84 [2021-10-11 02:33:52,842 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 84 [2021-10-11 02:33:53,318 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 19 [2021-10-11 02:33:54,511 WARN L197 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 174 DAG size of output: 41 [2021-10-11 02:33:54,711 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 11 [2021-10-11 02:33:54,794 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:33:54,794 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:33:54,794 INFO L262 CegarLoopResult]: For program point L29(lines 29 33) no Hoare annotation was computed. [2021-10-11 02:33:54,794 INFO L265 CegarLoopResult]: At program point L27(lines 27 47) the Hoare annotation is: true [2021-10-11 02:33:54,794 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2021-10-11 02:33:54,795 INFO L262 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2021-10-11 02:33:54,795 INFO L262 CegarLoopResult]: For program point L42(lines 42 46) no Hoare annotation was computed. [2021-10-11 02:33:54,795 INFO L265 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2021-10-11 02:33:54,795 INFO L262 CegarLoopResult]: For program point L41-1(line 41) no Hoare annotation was computed. [2021-10-11 02:33:54,795 INFO L262 CegarLoopResult]: For program point L35(lines 35 40) no Hoare annotation was computed. [2021-10-11 02:33:54,795 INFO L262 CegarLoopResult]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2021-10-11 02:33:54,795 INFO L258 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (or (not (<= |ackermann_#in~n| 0)) (<= 1 |ackermann_#in~m|)) (or (not (<= |ackermann_#in~m| 0)) (not (<= 0 |ackermann_#in~m|))) (= ackermann_~n |ackermann_#in~n|) (<= |ackermann_#in~m| ackermann_~m) (<= ackermann_~m |ackermann_#in~m|)) [2021-10-11 02:33:54,796 INFO L262 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2021-10-11 02:33:54,796 INFO L265 CegarLoopResult]: At program point ackermannENTRY(lines 16 24) the Hoare annotation is: true [2021-10-11 02:33:54,796 INFO L258 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (<= |ackermann_#in~m| ackermann_~m) (<= ackermann_~m |ackermann_#in~m|)) [2021-10-11 02:33:54,796 INFO L258 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse6 (<= 3 |ackermann_#t~ret8|)) (.cse5 (<= 5 |ackermann_#t~ret8|)) (.cse0 (<= 6 |ackermann_#t~ret8|)) (.cse7 (<= |ackermann_#in~m| 1))) (and (let ((.cse4 (<= 2 |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (<= |ackermann_#in~m| ackermann_~m)) (.cse3 (<= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= |ackermann_#in~m| 2) .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4 (< |ackermann_#in~n| 2)) (and .cse7 (<= 2 |ackermann_#t~ret8|) .cse1 (<= 1 |ackermann_#in~m|) .cse2 .cse3))) (not (<= |ackermann_#in~n| 0)) (or (= |ackermann_#in~n| 1) (and (<= |ackermann_#in~n| 2) .cse6) (and .cse7 .cse5 (<= |ackermann_#in~n| 4)) .cse0 (and .cse7 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|))))) [2021-10-11 02:33:54,797 INFO L262 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2021-10-11 02:33:54,797 INFO L262 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2021-10-11 02:33:54,797 INFO L262 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2021-10-11 02:33:54,797 INFO L262 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2021-10-11 02:33:54,797 INFO L262 CegarLoopResult]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2021-10-11 02:33:54,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:33:54 BoogieIcfgContainer [2021-10-11 02:33:54,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:33:54,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:33:54,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:33:54,805 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:33:54,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:33:08" (3/4) ... [2021-10-11 02:33:54,808 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:33:54,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2021-10-11 02:33:54,818 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-10-11 02:33:54,818 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-11 02:33:54,819 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:33:54,819 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:33:54,855 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28646692-0794-4afd-bd23-90bd4a79755e/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:33:54,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:33:54,856 INFO L168 Benchmark]: Toolchain (without parser) took 46801.14 ms. Allocated memory was 88.1 MB in the beginning and 721.4 MB in the end (delta: 633.3 MB). Free memory was 51.0 MB in the beginning and 658.6 MB in the end (delta: -607.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:54,857 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 88.1 MB. Free memory is still 67.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:33:54,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.34 ms. Allocated memory is still 88.1 MB. Free memory was 50.8 MB in the beginning and 65.5 MB in the end (delta: -14.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:54,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.68 ms. Allocated memory is still 88.1 MB. Free memory was 65.5 MB in the beginning and 64.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:54,858 INFO L168 Benchmark]: Boogie Preprocessor took 19.12 ms. Allocated memory is still 88.1 MB. Free memory was 64.1 MB in the beginning and 63.2 MB in the end (delta: 982.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:33:54,859 INFO L168 Benchmark]: RCFGBuilder took 323.83 ms. Allocated memory is still 88.1 MB. Free memory was 63.2 MB in the beginning and 48.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:54,859 INFO L168 Benchmark]: TraceAbstraction took 46088.30 ms. Allocated memory was 88.1 MB in the beginning and 721.4 MB in the end (delta: 633.3 MB). Free memory was 48.0 MB in the beginning and 661.7 MB in the end (delta: -613.7 MB). Peak memory consumption was 343.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:54,860 INFO L168 Benchmark]: Witness Printer took 50.79 ms. Allocated memory is still 721.4 MB. Free memory was 661.7 MB in the beginning and 658.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:54,863 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.21 ms. Allocated memory is still 88.1 MB. Free memory is still 67.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 281.34 ms. Allocated memory is still 88.1 MB. Free memory was 50.8 MB in the beginning and 65.5 MB in the end (delta: -14.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.68 ms. Allocated memory is still 88.1 MB. Free memory was 65.5 MB in the beginning and 64.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.12 ms. Allocated memory is still 88.1 MB. Free memory was 64.1 MB in the beginning and 63.2 MB in the end (delta: 982.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 323.83 ms. Allocated memory is still 88.1 MB. Free memory was 63.2 MB in the beginning and 48.4 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 46088.30 ms. Allocated memory was 88.1 MB in the beginning and 721.4 MB in the end (delta: 633.3 MB). Free memory was 48.0 MB in the beginning and 661.7 MB in the end (delta: -613.7 MB). Peak memory consumption was 343.7 MB. Max. memory is 16.1 GB. * Witness Printer took 50.79 ms. Allocated memory is still 721.4 MB. Free memory was 661.7 MB in the beginning and 658.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: 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: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 41.6s, OverallIterations: 9, TraceHistogramMax: 27, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 231 SDtfs, 683 SDslu, 1084 SDs, 0 SdLazy, 4509 SolverSat, 2256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2172 GetRequests, 1752 SyntacticMatches, 18 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6664 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 133 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 534 PreInvPairs, 1192 NumberOfFragments, 156 HoareAnnotationTreeSize, 534 FomulaSimplifications, 313969 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 6 FomulaSimplificationsInter, 6075 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 1799 NumberOfCodeBlocks, 1763 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2668 ConstructedInterpolants, 0 QuantifiedInterpolants, 730758 SizeOfPredicates, 62 NumberOfNonLiveVariables, 2732 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 15277/18906 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...