./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02.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-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan --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 675300a4b632e073b31d1e86ab5660e0c5ab887b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 05:54:29,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:54:29,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:54:29,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:54:29,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:54:29,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:54:29,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:54:29,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:54:29,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:54:29,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:54:29,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:54:29,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:54:29,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:54:29,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:54:29,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:54:29,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:54:29,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:54:29,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:54:29,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:54:29,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:54:29,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:54:29,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:54:29,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:54:29,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:54:29,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:54:29,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:54:29,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:54:29,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:54:29,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:54:29,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:54:29,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:54:29,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:54:29,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:54:29,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:54:29,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:54:29,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:54:29,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:54:29,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:54:29,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:54:29,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:54:29,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:54:29,514 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 05:54:29,531 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:54:29,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:54:29,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:54:29,532 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:54:29,532 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:54:29,532 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:54:29,532 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:54:29,533 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:54:29,533 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:54:29,533 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:54:29,533 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:54:29,533 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:54:29,533 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:54:29,533 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:54:29,533 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:54:29,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:54:29,534 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:54:29,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:54:29,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:54:29,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:54:29,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 05:54:29,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:54:29,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 05:54:29,535 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:54:29,535 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:54:29,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 05:54:29,535 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:54:29,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 05:54:29,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:54:29,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:54:29,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:54:29,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:54:29,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:54:29,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 05:54:29,536 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:54:29,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:54:29,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 05:54:29,537 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:54:29,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:54:29,537 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-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan 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 -> 675300a4b632e073b31d1e86ab5660e0c5ab887b [2020-12-09 05:54:29,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:54:29,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:54:29,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:54:29,717 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:54:29,717 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:54:29,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci02.c [2020-12-09 05:54:29,766 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/data/44ca11f75/3c760161f5ad45fd8cd6e74d92c8037f/FLAG1fec7dc67 [2020-12-09 05:54:30,109 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:54:30,109 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/sv-benchmarks/c/recursive/Fibonacci02.c [2020-12-09 05:54:30,113 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/data/44ca11f75/3c760161f5ad45fd8cd6e74d92c8037f/FLAG1fec7dc67 [2020-12-09 05:54:30,550 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/data/44ca11f75/3c760161f5ad45fd8cd6e74d92c8037f [2020-12-09 05:54:30,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:54:30,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:54:30,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:54:30,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:54:30,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:54:30,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281ff6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30, skipping insertion in model container [2020-12-09 05:54:30,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:54:30,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:54:30,673 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/sv-benchmarks/c/recursive/Fibonacci02.c[715,728] [2020-12-09 05:54:30,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:54:30,685 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:54:30,699 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/sv-benchmarks/c/recursive/Fibonacci02.c[715,728] [2020-12-09 05:54:30,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:54:30,712 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:54:30,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30 WrapperNode [2020-12-09 05:54:30,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:54:30,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:54:30,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:54:30,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:54:30,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:54:30,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:54:30,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:54:30,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:54:30,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... [2020-12-09 05:54:30,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:54:30,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:54:30,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:54:30,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:54:30,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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 [2020-12-09 05:54:30,808 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-12-09 05:54:30,808 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-12-09 05:54:30,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:54:30,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:54:30,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 05:54:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:54:30,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:54:30,944 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 05:54:30,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:54:30 BoogieIcfgContainer [2020-12-09 05:54:30,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:54:30,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:54:30,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:54:30,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:54:30,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:54:30" (1/3) ... [2020-12-09 05:54:30,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd37504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:54:30, skipping insertion in model container [2020-12-09 05:54:30,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:30" (2/3) ... [2020-12-09 05:54:30,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd37504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:54:30, skipping insertion in model container [2020-12-09 05:54:30,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:54:30" (3/3) ... [2020-12-09 05:54:30,952 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2020-12-09 05:54:30,966 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:54:30,968 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 05:54:30,977 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 05:54:30,994 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:54:30,994 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 05:54:30,994 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:54:30,994 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:54:30,995 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:54:30,995 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:54:30,995 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:54:30,995 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:54:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-12-09 05:54:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:54:31,010 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:31,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:31,010 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2020-12-09 05:54:31,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:31,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561555686] [2020-12-09 05:54:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:54:31,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561555686] [2020-12-09 05:54:31,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:54:31,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:54:31,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029368341] [2020-12-09 05:54:31,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:54:31,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:31,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:54:31,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:54:31,180 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2020-12-09 05:54:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:31,233 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-12-09 05:54:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:54:31,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 05:54:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:31,240 INFO L225 Difference]: With dead ends: 25 [2020-12-09 05:54:31,240 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 05:54:31,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:54:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 05:54:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-09 05:54:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 05:54:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-12-09 05:54:31,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2020-12-09 05:54:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:31,269 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-12-09 05:54:31,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:54:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-12-09 05:54:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 05:54:31,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:31,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:31,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:54:31,271 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:31,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:31,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2020-12-09 05:54:31,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:31,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609432432] [2020-12-09 05:54:31,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:54:31,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609432432] [2020-12-09 05:54:31,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:54:31,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:54:31,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466932198] [2020-12-09 05:54:31,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:54:31,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:31,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:54:31,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:54:31,309 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2020-12-09 05:54:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:31,341 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-12-09 05:54:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:54:31,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 05:54:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:31,342 INFO L225 Difference]: With dead ends: 23 [2020-12-09 05:54:31,342 INFO L226 Difference]: Without dead ends: 19 [2020-12-09 05:54:31,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:54:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-09 05:54:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-12-09 05:54:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 05:54:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-12-09 05:54:31,347 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2020-12-09 05:54:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:31,348 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-12-09 05:54:31,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:54:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-12-09 05:54:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 05:54:31,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:31,349 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:31,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:54:31,349 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2020-12-09 05:54:31,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:31,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277488818] [2020-12-09 05:54:31,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:54:31,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277488818] [2020-12-09 05:54:31,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611814404] [2020-12-09 05:54:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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 [2020-12-09 05:54:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:31,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:54:31,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:54:31,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 05:54:31,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [827935280] [2020-12-09 05:54:31,698 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:31,698 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:31,704 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) [2020-12-09 05:54:31,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:31,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2020-12-09 05:54:31,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645900369] [2020-12-09 05:54:31,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 05:54:31,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:31,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 05:54:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:54:31,707 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 11 states. [2020-12-09 05:54:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:31,785 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2020-12-09 05:54:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:54:31,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-12-09 05:54:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:31,787 INFO L225 Difference]: With dead ends: 34 [2020-12-09 05:54:31,787 INFO L226 Difference]: Without dead ends: 19 [2020-12-09 05:54:31,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-12-09 05:54:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-09 05:54:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-12-09 05:54:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-09 05:54:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-12-09 05:54:31,793 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2020-12-09 05:54:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:31,794 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-12-09 05:54:31,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 05:54:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-12-09 05:54:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 05:54:31,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:31,795 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:31,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-09 05:54:31,997 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:31,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:31,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2033467333, now seen corresponding path program 1 times [2020-12-09 05:54:32,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:32,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248468137] [2020-12-09 05:54:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:54:32,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248468137] [2020-12-09 05:54:32,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183360858] [2020-12-09 05:54:32,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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 [2020-12-09 05:54:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:32,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:54:32,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:54:32,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 05:54:32,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1382148591] [2020-12-09 05:54:32,352 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:32,352 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:32,352 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) [2020-12-09 05:54:32,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:32,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2020-12-09 05:54:32,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237098900] [2020-12-09 05:54:32,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 05:54:32,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:32,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 05:54:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:54:32,354 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2020-12-09 05:54:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:32,402 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2020-12-09 05:54:32,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:54:32,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-09 05:54:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:32,403 INFO L225 Difference]: With dead ends: 28 [2020-12-09 05:54:32,403 INFO L226 Difference]: Without dead ends: 24 [2020-12-09 05:54:32,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:54:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-09 05:54:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-12-09 05:54:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-09 05:54:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-12-09 05:54:32,408 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2020-12-09 05:54:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:32,409 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-12-09 05:54:32,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 05:54:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2020-12-09 05:54:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 05:54:32,410 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:32,410 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:32,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:32,611 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:32,612 INFO L82 PathProgramCache]: Analyzing trace with hash -121874130, now seen corresponding path program 2 times [2020-12-09 05:54:32,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:32,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636187497] [2020-12-09 05:54:32,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-09 05:54:32,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636187497] [2020-12-09 05:54:32,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573430950] [2020-12-09 05:54:32,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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 [2020-12-09 05:54:32,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-09 05:54:32,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:54:32,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:54:32,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-09 05:54:32,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 05:54:32,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [172308247] [2020-12-09 05:54:32,944 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:32,945 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:32,945 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) [2020-12-09 05:54:32,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:32,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2020-12-09 05:54:32,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300363162] [2020-12-09 05:54:32,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 05:54:32,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:32,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 05:54:32,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:54:32,946 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 14 states. [2020-12-09 05:54:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:33,083 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2020-12-09 05:54:33,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 05:54:33,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-12-09 05:54:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:33,084 INFO L225 Difference]: With dead ends: 55 [2020-12-09 05:54:33,084 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 05:54:33,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-12-09 05:54:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 05:54:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2020-12-09 05:54:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 05:54:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-12-09 05:54:33,090 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2020-12-09 05:54:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:33,090 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-12-09 05:54:33,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 05:54:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-12-09 05:54:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 05:54:33,091 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:33,091 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:33,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:33,293 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash -807024572, now seen corresponding path program 3 times [2020-12-09 05:54:33,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:33,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198088491] [2020-12-09 05:54:33,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 05:54:33,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198088491] [2020-12-09 05:54:33,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401337372] [2020-12-09 05:54:33,376 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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 [2020-12-09 05:54:33,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:54:33,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:54:33,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:54:33,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 05:54:33,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-09 05:54:33,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1754054477] [2020-12-09 05:54:33,646 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:33,646 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:33,646 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) [2020-12-09 05:54:33,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:33,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2020-12-09 05:54:33,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470970549] [2020-12-09 05:54:33,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 05:54:33,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 05:54:33,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:54:33,648 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 11 states. [2020-12-09 05:54:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:33,725 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-12-09 05:54:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:54:33,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-12-09 05:54:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:33,726 INFO L225 Difference]: With dead ends: 36 [2020-12-09 05:54:33,726 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 05:54:33,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:54:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 05:54:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-12-09 05:54:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 05:54:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2020-12-09 05:54:33,732 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2020-12-09 05:54:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:33,733 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-12-09 05:54:33,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 05:54:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2020-12-09 05:54:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-09 05:54:33,734 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:33,735 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:33,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:33,936 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:33,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:33,938 INFO L82 PathProgramCache]: Analyzing trace with hash -429029338, now seen corresponding path program 4 times [2020-12-09 05:54:33,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:33,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077300902] [2020-12-09 05:54:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-12-09 05:54:34,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077300902] [2020-12-09 05:54:34,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149284302] [2020-12-09 05:54:34,035 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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 [2020-12-09 05:54:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:34,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 05:54:34,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-12-09 05:54:34,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-09 05:54:34,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1461414704] [2020-12-09 05:54:34,465 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:34,465 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:34,465 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) [2020-12-09 05:54:34,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:34,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2020-12-09 05:54:34,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359951885] [2020-12-09 05:54:34,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 05:54:34,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 05:54:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-09 05:54:34,467 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 13 states. [2020-12-09 05:54:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:34,587 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2020-12-09 05:54:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:54:34,587 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2020-12-09 05:54:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:34,589 INFO L225 Difference]: With dead ends: 41 [2020-12-09 05:54:34,589 INFO L226 Difference]: Without dead ends: 37 [2020-12-09 05:54:34,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-12-09 05:54:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-09 05:54:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-12-09 05:54:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 05:54:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2020-12-09 05:54:34,598 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 64 [2020-12-09 05:54:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:34,599 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2020-12-09 05:54:34,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 05:54:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2020-12-09 05:54:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-09 05:54:34,602 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:34,602 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:34,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-09 05:54:34,805 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:34,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1393310086, now seen corresponding path program 5 times [2020-12-09 05:54:34,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:34,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119332935] [2020-12-09 05:54:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-12-09 05:54:34,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119332935] [2020-12-09 05:54:34,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448303978] [2020-12-09 05:54:34,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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 [2020-12-09 05:54:35,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2020-12-09 05:54:35,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:54:35,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:54:35,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2020-12-09 05:54:35,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 34 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2020-12-09 05:54:35,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1476955596] [2020-12-09 05:54:35,571 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:35,571 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:35,571 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) [2020-12-09 05:54:35,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:35,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2020-12-09 05:54:35,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910912723] [2020-12-09 05:54:35,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 05:54:35,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 05:54:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-12-09 05:54:35,573 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 16 states. [2020-12-09 05:54:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:35,837 INFO L93 Difference]: Finished difference Result 94 states and 191 transitions. [2020-12-09 05:54:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 05:54:35,838 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 146 [2020-12-09 05:54:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:35,839 INFO L225 Difference]: With dead ends: 94 [2020-12-09 05:54:35,840 INFO L226 Difference]: Without dead ends: 58 [2020-12-09 05:54:35,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2020-12-09 05:54:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-12-09 05:54:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-12-09 05:54:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 05:54:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2020-12-09 05:54:35,848 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 146 [2020-12-09 05:54:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:35,849 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2020-12-09 05:54:35,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 05:54:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2020-12-09 05:54:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-09 05:54:35,851 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:35,851 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:36,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:36,052 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash -454540380, now seen corresponding path program 6 times [2020-12-09 05:54:36,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:36,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578730071] [2020-12-09 05:54:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-12-09 05:54:36,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578730071] [2020-12-09 05:54:36,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610687447] [2020-12-09 05:54:36,198 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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 [2020-12-09 05:54:36,279 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:54:36,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:54:36,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 05:54:36,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-12-09 05:54:36,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2020-12-09 05:54:37,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1978706425] [2020-12-09 05:54:37,289 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:37,289 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:37,289 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) [2020-12-09 05:54:37,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:37,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2020-12-09 05:54:37,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142039216] [2020-12-09 05:54:37,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 05:54:37,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:37,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 05:54:37,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-12-09 05:54:37,291 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand 17 states. [2020-12-09 05:54:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:37,434 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2020-12-09 05:54:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 05:54:37,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 173 [2020-12-09 05:54:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:37,436 INFO L225 Difference]: With dead ends: 67 [2020-12-09 05:54:37,436 INFO L226 Difference]: Without dead ends: 63 [2020-12-09 05:54:37,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-12-09 05:54:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-09 05:54:37,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-12-09 05:54:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-09 05:54:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2020-12-09 05:54:37,444 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 173 [2020-12-09 05:54:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:37,445 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2020-12-09 05:54:37,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 05:54:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2020-12-09 05:54:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2020-12-09 05:54:37,448 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:37,448 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:37,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:37,649 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash 243124634, now seen corresponding path program 7 times [2020-12-09 05:54:37,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:37,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535557017] [2020-12-09 05:54:37,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-12-09 05:54:37,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535557017] [2020-12-09 05:54:37,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179283265] [2020-12-09 05:54:37,873 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/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 [2020-12-09 05:54:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:37,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 05:54:37,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-12-09 05:54:38,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2020-12-09 05:54:39,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954310159] [2020-12-09 05:54:39,683 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:39,683 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:39,684 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) [2020-12-09 05:54:39,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:39,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2020-12-09 05:54:39,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667753635] [2020-12-09 05:54:39,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 05:54:39,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 05:54:39,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-12-09 05:54:39,686 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 19 states. [2020-12-09 05:54:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:39,851 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-12-09 05:54:39,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 05:54:39,852 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 282 [2020-12-09 05:54:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:39,854 INFO L225 Difference]: With dead ends: 72 [2020-12-09 05:54:39,854 INFO L226 Difference]: Without dead ends: 68 [2020-12-09 05:54:39,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-12-09 05:54:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-09 05:54:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-09 05:54:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 05:54:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2020-12-09 05:54:39,862 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 282 [2020-12-09 05:54:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:39,862 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2020-12-09 05:54:39,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 05:54:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2020-12-09 05:54:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2020-12-09 05:54:39,871 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:39,871 INFO L422 BasicCegarLoop]: trace histogram [75, 75, 60, 37, 37, 37, 37, 37, 37, 37, 23, 15, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:40,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 05:54:40,073 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:40,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:40,075 INFO L82 PathProgramCache]: Analyzing trace with hash 991578449, now seen corresponding path program 8 times [2020-12-09 05:54:40,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:40,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14399419] [2020-12-09 05:54:40,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15534 backedges. 409 proven. 2574 refuted. 0 times theorem prover too weak. 12551 trivial. 0 not checked. [2020-12-09 05:54:40,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14399419] [2020-12-09 05:54:40,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516463271] [2020-12-09 05:54:40,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:40,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2020-12-09 05:54:40,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:54:40,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 05:54:40,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 15534 backedges. 2214 proven. 71 refuted. 0 times theorem prover too weak. 13249 trivial. 0 not checked. [2020-12-09 05:54:40,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15534 backedges. 2214 proven. 77 refuted. 0 times theorem prover too weak. 13243 trivial. 0 not checked. [2020-12-09 05:54:42,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1496165759] [2020-12-09 05:54:42,429 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:42,429 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:42,429 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) [2020-12-09 05:54:42,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:42,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 23 [2020-12-09 05:54:42,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659000316] [2020-12-09 05:54:42,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 05:54:42,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:42,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 05:54:42,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-12-09 05:54:42,431 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand 23 states. [2020-12-09 05:54:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:42,973 INFO L93 Difference]: Finished difference Result 169 states and 326 transitions. [2020-12-09 05:54:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-12-09 05:54:42,974 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 513 [2020-12-09 05:54:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:42,975 INFO L225 Difference]: With dead ends: 169 [2020-12-09 05:54:42,975 INFO L226 Difference]: Without dead ends: 107 [2020-12-09 05:54:42,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1074 GetRequests, 1019 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=691, Invalid=2171, Unknown=0, NotChecked=0, Total=2862 [2020-12-09 05:54:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-12-09 05:54:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2020-12-09 05:54:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-12-09 05:54:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2020-12-09 05:54:42,985 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 513 [2020-12-09 05:54:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:42,986 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2020-12-09 05:54:42,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 05:54:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2020-12-09 05:54:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2020-12-09 05:54:42,993 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:42,994 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:43,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:43,195 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash -211170596, now seen corresponding path program 9 times [2020-12-09 05:54:43,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:43,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40155780] [2020-12-09 05:54:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2020-12-09 05:54:44,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40155780] [2020-12-09 05:54:44,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277912836] [2020-12-09 05:54:44,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:44,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:54:44,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:54:44,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 439 conjunts are in the unsatisfiable core [2020-12-09 05:54:44,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2020-12-09 05:54:45,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2020-12-09 05:54:52,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [583635473] [2020-12-09 05:54:52,071 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:52,071 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:52,071 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) [2020-12-09 05:54:52,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:52,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2020-12-09 05:54:52,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306687923] [2020-12-09 05:54:52,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-12-09 05:54:52,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:52,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-12-09 05:54:52,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 05:54:52,074 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand 36 states. [2020-12-09 05:54:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:52,614 INFO L93 Difference]: Finished difference Result 136 states and 208 transitions. [2020-12-09 05:54:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 05:54:52,614 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 745 [2020-12-09 05:54:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:52,618 INFO L225 Difference]: With dead ends: 136 [2020-12-09 05:54:52,619 INFO L226 Difference]: Without dead ends: 132 [2020-12-09 05:54:52,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1709 GetRequests, 1591 SyntacticMatches, 84 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 05:54:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-09 05:54:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2020-12-09 05:54:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-12-09 05:54:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2020-12-09 05:54:52,636 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 745 [2020-12-09 05:54:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:52,638 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2020-12-09 05:54:52,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-12-09 05:54:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2020-12-09 05:54:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2020-12-09 05:54:52,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:52,646 INFO L422 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:52,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:52,849 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:52,850 INFO L82 PathProgramCache]: Analyzing trace with hash 968169119, now seen corresponding path program 10 times [2020-12-09 05:54:52,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:52,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298312876] [2020-12-09 05:54:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3212 proven. 1991 refuted. 0 times theorem prover too weak. 45707 trivial. 0 not checked. [2020-12-09 05:54:53,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298312876] [2020-12-09 05:54:53,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842026956] [2020-12-09 05:54:53,545 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:53,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 2078 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 05:54:53,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:54:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3844 proven. 2510 refuted. 0 times theorem prover too weak. 44556 trivial. 0 not checked. [2020-12-09 05:54:54,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:54:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3844 proven. 2602 refuted. 0 times theorem prover too weak. 44464 trivial. 0 not checked. [2020-12-09 05:54:58,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [456279835] [2020-12-09 05:54:58,599 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:54:58,599 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:54:58,599 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) [2020-12-09 05:54:58,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:54:58,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 21] total 25 [2020-12-09 05:54:58,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557688683] [2020-12-09 05:54:58,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 05:54:58,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:54:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 05:54:58,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2020-12-09 05:54:58,603 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand 25 states. [2020-12-09 05:54:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:54:58,844 INFO L93 Difference]: Finished difference Result 160 states and 278 transitions. [2020-12-09 05:54:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 05:54:58,844 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 922 [2020-12-09 05:54:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:54:58,847 INFO L225 Difference]: With dead ends: 160 [2020-12-09 05:54:58,847 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 05:54:58,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1869 GetRequests, 1836 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2020-12-09 05:54:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 05:54:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2020-12-09 05:54:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-12-09 05:54:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2020-12-09 05:54:58,857 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 922 [2020-12-09 05:54:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:54:58,858 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 193 transitions. [2020-12-09 05:54:58,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 05:54:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions. [2020-12-09 05:54:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2020-12-09 05:54:58,862 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:54:58,863 INFO L422 BasicCegarLoop]: trace histogram [115, 115, 93, 57, 57, 57, 57, 57, 57, 57, 36, 22, 1, 1, 1, 1, 1, 1] [2020-12-09 05:54:59,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-09 05:54:59,063 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:54:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:54:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1312437441, now seen corresponding path program 11 times [2020-12-09 05:54:59,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:54:59,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997579363] [2020-12-09 05:54:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:54:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:54:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 954 proven. 4596 refuted. 0 times theorem prover too weak. 31332 trivial. 0 not checked. [2020-12-09 05:54:59,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997579363] [2020-12-09 05:54:59,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277852929] [2020-12-09 05:54:59,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:54:59,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2020-12-09 05:54:59,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:54:59,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 05:54:59,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:55:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 970 proven. 4572 refuted. 0 times theorem prover too weak. 31340 trivial. 0 not checked. [2020-12-09 05:55:00,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:55:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 962 proven. 4672 refuted. 0 times theorem prover too weak. 31248 trivial. 0 not checked. [2020-12-09 05:55:04,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1383375117] [2020-12-09 05:55:04,559 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:55:04,559 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:55:04,559 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) [2020-12-09 05:55:04,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:55:04,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 22] total 27 [2020-12-09 05:55:04,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197211760] [2020-12-09 05:55:04,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 05:55:04,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:55:04,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 05:55:04,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2020-12-09 05:55:04,562 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. Second operand 27 states. [2020-12-09 05:55:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:55:04,741 INFO L93 Difference]: Finished difference Result 160 states and 240 transitions. [2020-12-09 05:55:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 05:55:04,741 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 786 [2020-12-09 05:55:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:55:04,743 INFO L225 Difference]: With dead ends: 160 [2020-12-09 05:55:04,743 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 05:55:04,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1601 GetRequests, 1549 SyntacticMatches, 19 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 05:55:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 05:55:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 05:55:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 05:55:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 05:55:04,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 786 [2020-12-09 05:55:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:55:04,746 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 05:55:04,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 05:55:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 05:55:04,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 05:55:04,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-09 05:55:04,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 05:55:05,442 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 60 [2020-12-09 05:55:05,515 INFO L262 CegarLoopResult]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2020-12-09 05:55:05,516 INFO L265 CegarLoopResult]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2020-12-09 05:55:05,516 INFO L258 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|) (<= 2 |fibonacci_#in~n|)) [2020-12-09 05:55:05,516 INFO L262 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-12-09 05:55:05,516 INFO L258 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse6 (<= |fibonacci_#in~n| 3)) (.cse1 (<= |fibonacci_#in~n| 2)) (.cse9 (= |fibonacci_#t~ret7| 1)) (.cse2 (<= |fibonacci_#in~n| 5)) (.cse8 (<= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse0 (and (<= |fibonacci_#t~ret7| 2) (<= 4 fibonacci_~n) (<= 2 |fibonacci_#t~ret7|) (<= |fibonacci_#in~n| 4) .cse8)) (.cse3 (and (<= |fibonacci_#t~ret7| 3) (<= 5 fibonacci_~n) (<= 3 |fibonacci_#t~ret7|) .cse2 .cse8)) (.cse5 (and .cse1 .cse9 (< 1 fibonacci_~n) .cse8)) (.cse4 (and (<= 3 fibonacci_~n) .cse6 .cse9 .cse8))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4) (or .cse5 (not .cse6) .cse4) (let ((.cse7 (<= |fibonacci_#in~n| fibonacci_~n))) (or .cse0 (and .cse7 (<= |fibonacci_#t~ret7| 8) (<= 8 |fibonacci_#t~ret7|) (<= 7 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 7) .cse8) (and (<= 10 |fibonacci_#in~n|) .cse7 .cse8) (and (<= 13 |fibonacci_#t~ret7|) .cse7 (<= |fibonacci_#t~ret7| 13) (<= |fibonacci_#in~n| 8) (<= 8 |fibonacci_#in~n|) .cse8) .cse3 .cse5 .cse4 (and (<= |fibonacci_#t~ret7| 5) .cse7 (<= 5 |fibonacci_#t~ret7|) (<= |fibonacci_#in~n| 6) .cse8) (and (<= 9 |fibonacci_#in~n|) (<= |fibonacci_#t~ret7| 21) .cse7 (<= 21 |fibonacci_#t~ret7|) .cse8)))))) [2020-12-09 05:55:05,516 INFO L262 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2020-12-09 05:55:05,516 INFO L262 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2020-12-09 05:55:05,516 INFO L262 CegarLoopResult]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2020-12-09 05:55:05,517 INFO L262 CegarLoopResult]: For program point L17(lines 17 23) no Hoare annotation was computed. [2020-12-09 05:55:05,517 INFO L262 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-12-09 05:55:05,517 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 05:55:05,517 INFO L262 CegarLoopResult]: For program point L30(lines 30 34) no Hoare annotation was computed. [2020-12-09 05:55:05,517 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 05:55:05,517 INFO L258 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) [2020-12-09 05:55:05,517 INFO L262 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-12-09 05:55:05,517 INFO L258 CegarLoopResult]: At program point L27(lines 27 35) the Hoare annotation is: (<= 9 ULTIMATE.start_main_~x~0) [2020-12-09 05:55:05,517 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 33) no Hoare annotation was computed. [2020-12-09 05:55:05,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:55:05 BoogieIcfgContainer [2020-12-09 05:55:05,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:55:05,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:55:05,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:55:05,528 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:55:05,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:54:30" (3/4) ... [2020-12-09 05:55:05,530 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 05:55:05,534 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2020-12-09 05:55:05,538 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-12-09 05:55:05,538 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 05:55:05,538 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 05:55:05,538 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 05:55:05,560 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_09574582-a9b9-4cb8-a15c-c16637146ed9/bin/utaipan/witness.graphml [2020-12-09 05:55:05,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:55:05,561 INFO L168 Benchmark]: Toolchain (without parser) took 35007.29 ms. Allocated memory was 83.9 MB in the beginning and 931.1 MB in the end (delta: 847.2 MB). Free memory was 54.8 MB in the beginning and 386.6 MB in the end (delta: -331.8 MB). Peak memory consumption was 515.3 MB. Max. memory is 16.1 GB. [2020-12-09 05:55:05,561 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 83.9 MB. Free memory was 41.9 MB in the beginning and 41.8 MB in the end (delta: 54.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:55:05,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.65 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 54.5 MB in the beginning and 77.6 MB in the end (delta: -23.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 05:55:05,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.11 ms. Allocated memory is still 100.7 MB. Free memory was 77.6 MB in the beginning and 76.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:55:05,562 INFO L168 Benchmark]: Boogie Preprocessor took 12.00 ms. Allocated memory is still 100.7 MB. Free memory was 76.5 MB in the beginning and 75.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:55:05,562 INFO L168 Benchmark]: RCFGBuilder took 197.56 ms. Allocated memory is still 100.7 MB. Free memory was 75.3 MB in the beginning and 62.6 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 05:55:05,562 INFO L168 Benchmark]: TraceAbstraction took 34580.46 ms. Allocated memory was 100.7 MB in the beginning and 931.1 MB in the end (delta: 830.5 MB). Free memory was 62.3 MB in the beginning and 388.7 MB in the end (delta: -326.4 MB). Peak memory consumption was 505.5 MB. Max. memory is 16.1 GB. [2020-12-09 05:55:05,563 INFO L168 Benchmark]: Witness Printer took 32.60 ms. Allocated memory is still 931.1 MB. Free memory was 388.7 MB in the beginning and 386.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:55:05,564 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.13 ms. Allocated memory is still 83.9 MB. Free memory was 41.9 MB in the beginning and 41.8 MB in the end (delta: 54.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 158.65 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 54.5 MB in the beginning and 77.6 MB in the end (delta: -23.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 21.11 ms. Allocated memory is still 100.7 MB. Free memory was 77.6 MB in the beginning and 76.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 12.00 ms. Allocated memory is still 100.7 MB. Free memory was 76.5 MB in the beginning and 75.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 197.56 ms. Allocated memory is still 100.7 MB. Free memory was 75.3 MB in the beginning and 62.6 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 34580.46 ms. Allocated memory was 100.7 MB in the beginning and 931.1 MB in the end (delta: 830.5 MB). Free memory was 62.3 MB in the beginning and 388.7 MB in the end (delta: -326.4 MB). Peak memory consumption was 505.5 MB. Max. memory is 16.1 GB. * Witness Printer took 32.60 ms. Allocated memory is still 931.1 MB. Free memory was 388.7 MB in the beginning and 386.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: 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: 9 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 33.9s, OverallIterations: 14, TraceHistogramMax: 135, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 289 SDtfs, 866 SDslu, 1977 SDs, 0 SdLazy, 3016 SolverSat, 1060 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7957 GetRequests, 7537 SyntacticMatches, 120 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 158 PreInvPairs, 385 NumberOfFragments, 245 HoareAnnotationTreeSize, 158 FomulaSimplifications, 2432 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 2137 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 7517 NumberOfCodeBlocks, 6539 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 11228 ConstructedInterpolants, 0 QuantifiedInterpolants, 11976053 SizeOfPredicates, 66 NumberOfNonLiveVariables, 6519 ConjunctsInSsa, 566 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 370022/432333 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...