./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci03.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:00:20,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:00:20,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:00:20,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:00:20,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:00:20,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:00:20,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:00:20,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:00:20,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:00:20,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:00:20,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:00:20,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:00:20,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:00:20,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:00:20,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:00:20,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:00:20,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:00:20,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:00:20,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:00:20,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:00:20,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:00:20,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:00:20,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:00:20,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:00:20,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:00:20,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:00:20,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:00:20,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:00:20,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:00:20,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:00:20,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:00:20,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:00:20,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:00:20,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:00:20,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:00:20,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:00:20,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:00:20,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:00:20,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:00:20,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:00:20,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:00:20,833 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 17:00:20,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:00:20,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:00:20,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 17:00:20,843 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 17:00:20,843 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 17:00:20,844 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 17:00:20,844 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 17:00:20,844 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 17:00:20,844 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 17:00:20,844 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 17:00:20,844 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 17:00:20,844 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 17:00:20,844 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 17:00:20,845 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 17:00:20,845 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 17:00:20,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:00:20,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:00:20,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:00:20,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:00:20,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:00:20,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:00:20,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:00:20,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:00:20,846 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:00:20,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:00:20,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:00:20,846 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:00:20,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:00:20,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:00:20,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:00:20,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:00:20,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:00:20,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:00:20,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:00:20,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:00:20,847 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 17:00:20,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:00:20,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:00:20,848 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:00:20,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:00:20,848 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5a7391cb-43ce-4877-ab70-4c0352019119/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(__VERIFIER_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 -> 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 [2019-12-07 17:00:20,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:00:20,954 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:00:20,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:00:20,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:00:20,958 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:00:20,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci03.c [2019-12-07 17:00:20,997 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/data/a00a0d4e1/f1713f09b24047ff86554960ecb97a1c/FLAG35d2d40b1 [2019-12-07 17:00:21,312 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:00:21,313 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/sv-benchmarks/c/recursive/Fibonacci03.c [2019-12-07 17:00:21,318 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/data/a00a0d4e1/f1713f09b24047ff86554960ecb97a1c/FLAG35d2d40b1 [2019-12-07 17:00:21,329 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/data/a00a0d4e1/f1713f09b24047ff86554960ecb97a1c [2019-12-07 17:00:21,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:00:21,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:00:21,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:00:21,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:00:21,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:00:21,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21, skipping insertion in model container [2019-12-07 17:00:21,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:00:21,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:00:21,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:00:21,464 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:00:21,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:00:21,516 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:00:21,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21 WrapperNode [2019-12-07 17:00:21,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:00:21,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:00:21,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:00:21,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:00:21,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:00:21,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:00:21,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:00:21,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:00:21,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... [2019-12-07 17:00:21,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:00:21,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:00:21,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:00:21,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:00:21,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/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 [2019-12-07 17:00:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-12-07 17:00:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-12-07 17:00:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:00:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:00:21,701 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:00:21,702 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 17:00:21,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:00:21 BoogieIcfgContainer [2019-12-07 17:00:21,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:00:21,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:00:21,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:00:21,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:00:21,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:00:21" (1/3) ... [2019-12-07 17:00:21,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71722a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:00:21, skipping insertion in model container [2019-12-07 17:00:21,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:21" (2/3) ... [2019-12-07 17:00:21,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71722a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:00:21, skipping insertion in model container [2019-12-07 17:00:21,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:00:21" (3/3) ... [2019-12-07 17:00:21,708 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2019-12-07 17:00:21,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:00:21,718 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:00:21,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:00:21,740 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:00:21,740 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:00:21,740 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:00:21,740 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:00:21,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:00:21,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:00:21,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:00:21,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:00:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-12-07 17:00:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 17:00:21,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:21,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:21,755 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:21,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:21,758 INFO L82 PathProgramCache]: Analyzing trace with hash -337677157, now seen corresponding path program 1 times [2019-12-07 17:00:21,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:21,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98557840] [2019-12-07 17:00:21,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:21,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98557840] [2019-12-07 17:00:21,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:21,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:00:21,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526680568] [2019-12-07 17:00:21,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:00:21,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:21,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:00:21,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:21,897 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2019-12-07 17:00:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:21,965 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2019-12-07 17:00:21,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:00:21,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 17:00:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:21,974 INFO L225 Difference]: With dead ends: 28 [2019-12-07 17:00:21,974 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 17:00:21,976 INFO L630 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 [2019-12-07 17:00:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 17:00:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-12-07 17:00:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 17:00:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-12-07 17:00:22,010 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2019-12-07 17:00:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:22,010 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-12-07 17:00:22,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:00:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-12-07 17:00:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:00:22,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:22,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:22,011 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1185838437, now seen corresponding path program 1 times [2019-12-07 17:00:22,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:22,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613303254] [2019-12-07 17:00:22,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:22,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613303254] [2019-12-07 17:00:22,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:22,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:00:22,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565823900] [2019-12-07 17:00:22,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:00:22,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:00:22,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:22,043 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2019-12-07 17:00:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:22,085 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-12-07 17:00:22,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:00:22,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 17:00:22,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:22,086 INFO L225 Difference]: With dead ends: 24 [2019-12-07 17:00:22,086 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 17:00:22,087 INFO L630 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 [2019-12-07 17:00:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 17:00:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-12-07 17:00:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 17:00:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-12-07 17:00:22,091 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2019-12-07 17:00:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:22,092 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-12-07 17:00:22,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:00:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-12-07 17:00:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:00:22,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:22,093 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:22,093 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:22,093 INFO L82 PathProgramCache]: Analyzing trace with hash -461887010, now seen corresponding path program 1 times [2019-12-07 17:00:22,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:22,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27447162] [2019-12-07 17:00:22,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:00:22,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27447162] [2019-12-07 17:00:22,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059603904] [2019-12-07 17:00:22,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/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 [2019-12-07 17:00:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:22,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:00:22,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:00:22,214 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:22,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:00:22,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1593217378] [2019-12-07 17:00:22,355 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 17:00:22,355 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 17:00:22,361 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 17:00:22,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 17:00:22,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 12 [2019-12-07 17:00:22,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217835598] [2019-12-07 17:00:22,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:00:22,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:00:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:00:22,364 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 12 states. [2019-12-07 17:00:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:22,463 INFO L93 Difference]: Finished difference Result 55 states and 86 transitions. [2019-12-07 17:00:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:00:22,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-07 17:00:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:22,465 INFO L225 Difference]: With dead ends: 55 [2019-12-07 17:00:22,465 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 17:00:22,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:00:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 17:00:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-12-07 17:00:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 17:00:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-12-07 17:00:22,473 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 23 [2019-12-07 17:00:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:22,473 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-12-07 17:00:22,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:00:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-12-07 17:00:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:00:22,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:22,476 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:22,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:22,677 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1011298921, now seen corresponding path program 1 times [2019-12-07 17:00:22,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:22,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95979468] [2019-12-07 17:00:22,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 41 proven. 91 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 17:00:22,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95979468] [2019-12-07 17:00:22,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391623141] [2019-12-07 17:00:22,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/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 [2019-12-07 17:00:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:22,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:00:22,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 17:00:22,899 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 17:00:23,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [154588489] [2019-12-07 17:00:23,130 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 17:00:23,131 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 17:00:23,131 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 17:00:23,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 17:00:23,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 9] total 22 [2019-12-07 17:00:23,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049222423] [2019-12-07 17:00:23,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 17:00:23,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 17:00:23,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:00:23,134 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 22 states. [2019-12-07 17:00:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:23,463 INFO L93 Difference]: Finished difference Result 85 states and 154 transitions. [2019-12-07 17:00:23,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:00:23,464 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2019-12-07 17:00:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:23,466 INFO L225 Difference]: With dead ends: 85 [2019-12-07 17:00:23,467 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 17:00:23,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 119 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 17:00:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 17:00:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 17:00:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 17:00:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2019-12-07 17:00:23,478 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 65 [2019-12-07 17:00:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:23,478 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-12-07 17:00:23,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 17:00:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2019-12-07 17:00:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 17:00:23,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:23,482 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:23,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:23,683 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:23,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1005169960, now seen corresponding path program 2 times [2019-12-07 17:00:23,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:23,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747571208] [2019-12-07 17:00:23,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 406 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-12-07 17:00:23,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747571208] [2019-12-07 17:00:23,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206868582] [2019-12-07 17:00:23,918 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/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 [2019-12-07 17:00:23,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 17:00:23,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:00:23,955 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:00:23,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 244 proven. 71 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-12-07 17:00:23,997 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 248 proven. 84 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-12-07 17:00:24,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068122663] [2019-12-07 17:00:24,404 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 17:00:24,404 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 17:00:24,405 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 17:00:24,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 17:00:24,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8, 11] total 28 [2019-12-07 17:00:24,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516801112] [2019-12-07 17:00:24,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:00:24,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:24,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:00:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:00:24,407 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand 28 states. [2019-12-07 17:00:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:25,024 INFO L93 Difference]: Finished difference Result 145 states and 263 transitions. [2019-12-07 17:00:25,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 17:00:25,025 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 133 [2019-12-07 17:00:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:25,027 INFO L225 Difference]: With dead ends: 145 [2019-12-07 17:00:25,027 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 17:00:25,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 261 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=626, Invalid=2130, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 17:00:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 17:00:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2019-12-07 17:00:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 17:00:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-12-07 17:00:25,042 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 133 [2019-12-07 17:00:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:25,043 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-12-07 17:00:25,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:00:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-12-07 17:00:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-12-07 17:00:25,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:25,056 INFO L410 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:25,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:25,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:25,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1396488680, now seen corresponding path program 3 times [2019-12-07 17:00:25,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:25,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872060646] [2019-12-07 17:00:25,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 5901 proven. 4550 refuted. 0 times theorem prover too weak. 8652 trivial. 0 not checked. [2019-12-07 17:00:26,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872060646] [2019-12-07 17:00:26,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294154001] [2019-12-07 17:00:26,036 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/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 [2019-12-07 17:00:26,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:00:26,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:00:26,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 17:00:26,149 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1844 proven. 3686 refuted. 0 times theorem prover too weak. 13573 trivial. 0 not checked. [2019-12-07 17:00:26,395 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1839 proven. 3783 refuted. 0 times theorem prover too weak. 13481 trivial. 0 not checked. [2019-12-07 17:00:29,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [737007437] [2019-12-07 17:00:29,597 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 17:00:29,597 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 17:00:29,598 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 17:00:29,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 17:00:29,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19, 30] total 46 [2019-12-07 17:00:29,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565963416] [2019-12-07 17:00:29,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-07 17:00:29,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:29,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-07 17:00:29,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1758, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 17:00:29,601 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 46 states. [2019-12-07 17:00:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:30,598 INFO L93 Difference]: Finished difference Result 217 states and 423 transitions. [2019-12-07 17:00:30,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 17:00:30,598 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 569 [2019-12-07 17:00:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:30,602 INFO L225 Difference]: With dead ends: 217 [2019-12-07 17:00:30,602 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 17:00:30,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1264 GetRequests, 1162 SyntacticMatches, 28 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1228, Invalid=4472, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 17:00:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 17:00:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2019-12-07 17:00:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 17:00:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2019-12-07 17:00:30,616 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 569 [2019-12-07 17:00:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:30,617 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2019-12-07 17:00:30,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-07 17:00:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2019-12-07 17:00:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1074 [2019-12-07 17:00:30,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:30,625 INFO L410 BasicCegarLoop]: trace histogram [157, 157, 127, 78, 78, 78, 78, 78, 78, 78, 49, 30, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:30,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:30,826 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:30,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:30,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1228807153, now seen corresponding path program 4 times [2019-12-07 17:00:30,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:30,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967910835] [2019-12-07 17:00:30,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 68997 backedges. 10621 proven. 28347 refuted. 0 times theorem prover too weak. 30029 trivial. 0 not checked. [2019-12-07 17:00:34,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967910835] [2019-12-07 17:00:34,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818966982] [2019-12-07 17:00:34,673 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/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 [2019-12-07 17:00:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:34,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 2386 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 17:00:34,903 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 68997 backedges. 4107 proven. 8674 refuted. 0 times theorem prover too weak. 56216 trivial. 0 not checked. [2019-12-07 17:00:36,209 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 68997 backedges. 4101 proven. 8808 refuted. 0 times theorem prover too weak. 56088 trivial. 0 not checked. [2019-12-07 17:00:42,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [864309435] [2019-12-07 17:00:42,591 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 17:00:42,591 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 17:00:42,591 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 17:00:42,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 17:00:42,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 21, 34] total 126 [2019-12-07 17:00:42,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126241290] [2019-12-07 17:00:42,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-12-07 17:00:42,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-12-07 17:00:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=15168, Unknown=0, NotChecked=0, Total=15750 [2019-12-07 17:00:42,598 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand 126 states. [2019-12-07 17:00:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:58,878 INFO L93 Difference]: Finished difference Result 349 states and 813 transitions. [2019-12-07 17:00:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-12-07 17:00:58,878 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 1073 [2019-12-07 17:00:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:58,884 INFO L225 Difference]: With dead ends: 349 [2019-12-07 17:00:58,884 INFO L226 Difference]: Without dead ends: 240 [2019-12-07 17:00:58,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2655 GetRequests, 2361 SyntacticMatches, 44 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16414 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=9143, Invalid=54109, Unknown=0, NotChecked=0, Total=63252 [2019-12-07 17:00:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-12-07 17:00:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 185. [2019-12-07 17:00:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-07 17:00:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 420 transitions. [2019-12-07 17:00:58,922 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 420 transitions. Word has length 1073 [2019-12-07 17:00:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:58,923 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 420 transitions. [2019-12-07 17:00:58,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-12-07 17:00:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 420 transitions. [2019-12-07 17:00:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2019-12-07 17:00:58,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:58,928 INFO L410 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:59,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:59,128 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:00:59,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1222363509, now seen corresponding path program 5 times [2019-12-07 17:00:59,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:59,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773009086] [2019-12-07 17:00:59,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-12-07 17:00:59,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773009086] [2019-12-07 17:00:59,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762783918] [2019-12-07 17:00:59,930 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/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 [2019-12-07 17:01:00,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-12-07 17:01:00,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:01:00,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 220 conjunts are in the unsatisfiable core [2019-12-07 17:01:00,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-12-07 17:01:00,829 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:01,701 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:01,809 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:01,924 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:02,037 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:02,777 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:03,042 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:03,305 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:03,568 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:04,368 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:04,476 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:04,589 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:04,703 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:05,380 WARN L192 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2019-12-07 17:01:06,011 WARN L192 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2019-12-07 17:01:06,654 WARN L192 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-12-07 17:01:07,278 WARN L192 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-12-07 17:01:08,076 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:08,184 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:08,295 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:08,406 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:09,157 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:09,421 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:09,712 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:09,975 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:11,560 WARN L192 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 491 [2019-12-07 17:01:13,178 WARN L192 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 491 [2019-12-07 17:01:14,847 WARN L192 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 493 [2019-12-07 17:01:16,414 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 493 [2019-12-07 17:01:17,284 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:17,389 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:17,500 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:17,613 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:18,358 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:18,610 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:18,872 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:19,133 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:19,399 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-12-07 17:01:19,670 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2019-12-07 17:01:19,924 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2019-12-07 17:01:20,178 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2019-12-07 17:01:20,414 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 253 [2019-12-07 17:01:20,650 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2019-12-07 17:01:20,874 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 245 [2019-12-07 17:01:21,097 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 241 [2019-12-07 17:01:21,313 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 237 [2019-12-07 17:01:21,521 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 233 [2019-12-07 17:01:21,725 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 229 [2019-12-07 17:01:21,927 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 225 [2019-12-07 17:01:22,123 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 221 [2019-12-07 17:01:22,313 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2019-12-07 17:01:22,509 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 213 [2019-12-07 17:01:22,691 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 209 [2019-12-07 17:01:22,866 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2019-12-07 17:01:23,036 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2019-12-07 17:01:23,205 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2019-12-07 17:01:23,375 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-12-07 17:01:23,550 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-12-07 17:01:23,716 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:23,877 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-12-07 17:01:24,031 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-12-07 17:01:24,174 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-12-07 17:01:24,324 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-12-07 17:01:24,474 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-12-07 17:01:24,620 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-12-07 17:01:24,757 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-12-07 17:01:24,891 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-12-07 17:01:25,020 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-12-07 17:01:25,151 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-12-07 17:01:25,275 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-12-07 17:01:25,393 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-12-07 17:01:25,509 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-12-07 17:01:25,622 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-12-07 17:01:25,740 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-12-07 17:01:25,855 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-12-07 17:01:25,967 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-12-07 17:01:26,077 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-12-07 17:01:26,183 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-12-07 17:01:30,306 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:30,413 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:30,527 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:30,637 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:33,134 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:33,241 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:33,351 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:33,458 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:34,230 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:34,535 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:34,803 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:35,063 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:35,863 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:35,967 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:36,077 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:36,187 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:36,815 WARN L192 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2019-12-07 17:01:37,429 WARN L192 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2019-12-07 17:01:38,065 WARN L192 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-12-07 17:01:38,711 WARN L192 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-12-07 17:01:39,544 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:39,651 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:39,766 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:39,878 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:40,002 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-12-07 17:01:40,126 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-12-07 17:01:40,240 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2019-12-07 17:01:40,342 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-12-07 17:01:44,684 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:44,790 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:44,902 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:45,014 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:45,752 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:46,013 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-12-07 17:01:46,293 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:46,570 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-12-07 17:01:49,248 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:49,356 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 17:01:49,465 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:49,575 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:01:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-12-07 17:01:51,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [619570042] [2019-12-07 17:01:51,621 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 17:01:51,621 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 17:01:51,621 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 17:01:51,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 17:01:51,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2019-12-07 17:01:51,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513367339] [2019-12-07 17:01:51,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 17:01:51,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:01:51,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 17:01:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:01:51,624 INFO L87 Difference]: Start difference. First operand 185 states and 420 transitions. Second operand 36 states. [2019-12-07 17:01:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:51,735 INFO L93 Difference]: Finished difference Result 185 states and 420 transitions. [2019-12-07 17:01:51,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 17:01:51,735 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 746 [2019-12-07 17:01:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:51,737 INFO L225 Difference]: With dead ends: 185 [2019-12-07 17:01:51,737 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:01:51,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1712 GetRequests, 1459 SyntacticMatches, 218 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5500 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 17:01:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:01:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:01:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:01:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:01:51,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 746 [2019-12-07 17:01:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:51,740 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:01:51,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 17:01:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:01:51,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:01:51,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:01:51,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:01:52,570 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 68 [2019-12-07 17:01:52,573 INFO L246 CegarLoopResult]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2019-12-07 17:01:52,573 INFO L249 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2019-12-07 17:01:52,573 INFO L242 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse1 (* 13 |fibonacci_#in~n|))) (and (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= |fibonacci_#in~n| 4) (<= 2 |fibonacci_#t~ret0|)) (not (<= 3 |fibonacci_#in~n|)) (and (<= |fibonacci_#in~n| 8) (<= (+ (* 3 fibonacci_~n) 53) (+ (* 8 |fibonacci_#in~n|) |fibonacci_#t~ret0|)) .cse0) (and (<= |fibonacci_#in~n| 7) .cse0 (<= (+ (* 2 fibonacci_~n) 29) (+ (* 5 |fibonacci_#in~n|) |fibonacci_#t~ret0|))) (and (<= 5 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 6) .cse0) (and (<= fibonacci_~n 3) (<= (+ fibonacci_~n 4) (+ (* 2 |fibonacci_#in~n|) |fibonacci_#t~ret0|)) .cse0) (and .cse0 (<= (+ (* 5 fibonacci_~n) 87) (+ .cse1 |fibonacci_#t~ret0|)) (<= (* 13 fibonacci_~n) (+ |fibonacci_#t~ret0| 96))) (and (<= 3 |fibonacci_#t~ret0|) .cse0 (<= fibonacci_~n 5)))) (or (and (< 1 fibonacci_~n) (<= .cse1 (+ |fibonacci_#t~ret0| 25)) (<= fibonacci_~n |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 2))))) [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point L15(lines 15 21) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point L31(lines 31 35) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L249 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point L27(lines 27 29) no Hoare annotation was computed. [2019-12-07 17:01:52,574 INFO L249 CegarLoopResult]: At program point L25(lines 25 36) the Hoare annotation is: true [2019-12-07 17:01:52,574 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2019-12-07 17:01:52,575 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 17:01:52,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:01:52 BoogieIcfgContainer [2019-12-07 17:01:52,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:01:52,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:01:52,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:01:52,581 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:01:52,581 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:00:21" (3/4) ... [2019-12-07 17:01:52,583 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:01:52,587 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2019-12-07 17:01:52,590 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 17:01:52,590 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:01:52,616 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5a7391cb-43ce-4877-ab70-4c0352019119/bin/utaipan/witness.graphml [2019-12-07 17:01:52,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:01:52,617 INFO L168 Benchmark]: Toolchain (without parser) took 91284.82 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 799.0 MB). Free memory was 940.9 MB in the beginning and 876.0 MB in the end (delta: 64.9 MB). Peak memory consumption was 863.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:52,617 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:01:52,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:52,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:01:52,618 INFO L168 Benchmark]: Boogie Preprocessor took 13.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:52,618 INFO L168 Benchmark]: RCFGBuilder took 149.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:52,618 INFO L168 Benchmark]: TraceAbstraction took 90877.25 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 686.8 MB). Free memory was 1.1 GB in the beginning and 882.4 MB in the end (delta: 208.2 MB). Peak memory consumption was 895.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:52,618 INFO L168 Benchmark]: Witness Printer took 35.44 ms. Allocated memory is still 1.8 GB. Free memory was 882.4 MB in the beginning and 876.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:52,620 INFO L335 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 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 149.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 90877.25 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 686.8 MB). Free memory was 1.1 GB in the beginning and 882.4 MB in the end (delta: 208.2 MB). Peak memory consumption was 895.0 MB. Max. memory is 11.5 GB. * Witness Printer took 35.44 ms. Allocated memory is still 1.8 GB. Free memory was 882.4 MB in the beginning and 876.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Result: SAFE, OverallTime: 90.2s, OverallIterations: 8, TraceHistogramMax: 157, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 213 SDtfs, 1183 SDslu, 2292 SDs, 0 SdLazy, 14438 SolverSat, 4658 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6174 GetRequests, 5406 SyntacticMatches, 305 SemanticMatches, 463 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24337 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 91 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 245 PreInvPairs, 510 NumberOfFragments, 139 HoareAnnotationTreeSize, 245 FomulaSimplifications, 3536 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 5704 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 67.1s InterpolantComputationTime, 5239 NumberOfCodeBlocks, 5106 NumberOfCodeBlocksAsserted, 114 NumberOfCheckSat, 7828 ConstructedInterpolants, 0 QuantifiedInterpolants, 12378870 SizeOfPredicates, 47 NumberOfNonLiveVariables, 5452 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 293487/366990 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...