./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/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 7e40a98558d0111ea95f3ee60a44cc14c7768182 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:04:39,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:04:39,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:04:39,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:04:39,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:04:39,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:04:39,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:04:39,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:04:39,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:04:39,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:04:39,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:04:39,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:04:39,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:04:39,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:04:39,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:04:39,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:04:39,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:04:39,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:04:39,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:04:39,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:04:39,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:04:39,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:04:39,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:04:39,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:04:39,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:04:39,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:04:39,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:04:39,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:04:39,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:04:39,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:04:39,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:04:39,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:04:39,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:04:39,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:04:39,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:04:39,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:04:39,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:04:39,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:04:39,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:04:39,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:04:39,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:04:39,062 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:04:39,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:04:39,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:04:39,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:04:39,073 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:04:39,073 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:04:39,073 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:04:39,073 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:04:39,073 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:04:39,073 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:04:39,073 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:04:39,074 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:04:39,074 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:04:39,074 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:04:39,074 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:04:39,074 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:04:39,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:04:39,075 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:04:39,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:04:39,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:04:39,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:04:39,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:04:39,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:04:39,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:04:39,076 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:04:39,076 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:04:39,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:04:39,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:04:39,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:04:39,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:04:39,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:04:39,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:04:39,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:04:39,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:04:39,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:04:39,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:04:39,077 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:04:39,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:04:39,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:04:39,077 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:04:39,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:04:39,077 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_00ddcc27-a4bc-433b-9997-79a74d80bef5/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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2019-12-07 21:04:39,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:04:39,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:04:39,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:04:39,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:04:39,187 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:04:39,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci02.c [2019-12-07 21:04:39,226 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/data/9ccd8fda4/088e9f44ac324425b1941b32120cf5b4/FLAG36b61c929 [2019-12-07 21:04:39,534 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:04:39,534 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/sv-benchmarks/c/recursive/Fibonacci02.c [2019-12-07 21:04:39,538 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/data/9ccd8fda4/088e9f44ac324425b1941b32120cf5b4/FLAG36b61c929 [2019-12-07 21:04:39,547 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/data/9ccd8fda4/088e9f44ac324425b1941b32120cf5b4 [2019-12-07 21:04:39,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:04:39,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:04:39,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:04:39,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:04:39,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:04:39,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b1d85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39, skipping insertion in model container [2019-12-07 21:04:39,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:04:39,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:04:39,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:04:39,676 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:04:39,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:04:39,725 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:04:39,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39 WrapperNode [2019-12-07 21:04:39,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:04:39,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:04:39,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:04:39,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:04:39,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:04:39,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:04:39,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:04:39,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:04:39,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... [2019-12-07 21:04:39,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:04:39,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:04:39,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:04:39,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:04:39,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/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 21:04:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-12-07 21:04:39,795 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-12-07 21:04:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:04:39,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:04:39,892 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:04:39,892 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 21:04:39,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:04:39 BoogieIcfgContainer [2019-12-07 21:04:39,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:04:39,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:04:39,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:04:39,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:04:39,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:04:39" (1/3) ... [2019-12-07 21:04:39,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e247cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:04:39, skipping insertion in model container [2019-12-07 21:04:39,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:04:39" (2/3) ... [2019-12-07 21:04:39,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e247cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:04:39, skipping insertion in model container [2019-12-07 21:04:39,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:04:39" (3/3) ... [2019-12-07 21:04:39,898 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2019-12-07 21:04:39,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:04:39,909 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:04:39,917 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:04:39,931 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:04:39,932 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:04:39,932 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:04:39,932 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:04:39,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:04:39,932 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:04:39,932 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:04:39,932 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:04:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-12-07 21:04:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:04:39,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:39,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:39,947 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-12-07 21:04:39,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:39,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524231333] [2019-12-07 21:04:39,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:40,059 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 21:04:40,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524231333] [2019-12-07 21:04:40,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:40,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:04:40,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975005322] [2019-12-07 21:04:40,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:04:40,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:40,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:04:40,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:04:40,074 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2019-12-07 21:04:40,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:40,128 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-12-07 21:04:40,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:04:40,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 21:04:40,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:40,136 INFO L225 Difference]: With dead ends: 25 [2019-12-07 21:04:40,136 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 21:04:40,138 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 21:04:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 21:04:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 21:04:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 21:04:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 21:04:40,165 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-12-07 21:04:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:40,165 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 21:04:40,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:04:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 21:04:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:04:40,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:40,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:40,166 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:40,166 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-12-07 21:04:40,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:40,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173269324] [2019-12-07 21:04:40,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:40,189 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 21:04:40,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173269324] [2019-12-07 21:04:40,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:04:40,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:04:40,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420842225] [2019-12-07 21:04:40,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:04:40,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:40,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:04:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:04:40,192 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-12-07 21:04:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:40,226 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-12-07 21:04:40,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:04:40,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 21:04:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:40,228 INFO L225 Difference]: With dead ends: 23 [2019-12-07 21:04:40,228 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 21:04:40,229 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 21:04:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 21:04:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-12-07 21:04:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 21:04:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 21:04:40,235 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-12-07 21:04:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:40,235 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 21:04:40,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:04:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 21:04:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:04:40,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:40,236 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:40,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-12-07 21:04:40,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:40,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994108116] [2019-12-07 21:04:40,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:40,281 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 21:04:40,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994108116] [2019-12-07 21:04:40,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852508700] [2019-12-07 21:04:40,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/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 21:04:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:40,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:04:40,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:40,341 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 21:04:40,341 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:40,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:04:40,482 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 21:04:40,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [608983148] [2019-12-07 21:04:40,499 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:40,500 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:40,504 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 21:04:40,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:40,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-12-07 21:04:40,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984359120] [2019-12-07 21:04:40,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:04:40,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:40,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:04:40,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:04:40,506 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2019-12-07 21:04:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:40,564 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2019-12-07 21:04:40,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:04:40,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 21:04:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:40,566 INFO L225 Difference]: With dead ends: 28 [2019-12-07 21:04:40,566 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 21:04:40,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:04:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 21:04:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-12-07 21:04:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 21:04:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-12-07 21:04:40,574 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 22 [2019-12-07 21:04:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:40,574 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-12-07 21:04:40,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:04:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2019-12-07 21:04:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:04:40,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:40,576 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 21:04:40,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:40,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1834230885, now seen corresponding path program 1 times [2019-12-07 21:04:40,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:40,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529618715] [2019-12-07 21:04:40,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 21:04:40,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529618715] [2019-12-07 21:04:40,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139295772] [2019-12-07 21:04:40,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/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 21:04:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:40,838 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:04:40,839 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 21:04:40,845 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 21:04:40,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [828084878] [2019-12-07 21:04:40,938 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:40,938 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:40,938 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 21:04:40,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:40,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-12-07 21:04:40,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935256636] [2019-12-07 21:04:40,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:04:40,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:40,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:04:40,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:04:40,940 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 9 states. [2019-12-07 21:04:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:40,991 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2019-12-07 21:04:40,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:04:40,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-07 21:04:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:40,993 INFO L225 Difference]: With dead ends: 33 [2019-12-07 21:04:40,993 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 21:04:40,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:04:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 21:04:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-07 21:04:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 21:04:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-12-07 21:04:41,001 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 23 [2019-12-07 21:04:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:41,001 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-12-07 21:04:41,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:04:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2019-12-07 21:04:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 21:04:41,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:41,003 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:41,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:41,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1177823382, now seen corresponding path program 2 times [2019-12-07 21:04:41,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:41,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703124306] [2019-12-07 21:04:41,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 21:04:41,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703124306] [2019-12-07 21:04:41,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880342937] [2019-12-07 21:04:41,300 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/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 21:04:41,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 21:04:41,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:04:41,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:04:41,321 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 21:04:41,336 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 21:04:41,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [793451264] [2019-12-07 21:04:41,451 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:41,451 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:41,452 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 21:04:41,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:41,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 13 [2019-12-07 21:04:41,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568571362] [2019-12-07 21:04:41,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 21:04:41,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:41,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 21:04:41,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:04:41,454 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 13 states. [2019-12-07 21:04:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:41,560 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2019-12-07 21:04:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:04:41,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-12-07 21:04:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:41,562 INFO L225 Difference]: With dead ends: 47 [2019-12-07 21:04:41,562 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 21:04:41,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-12-07 21:04:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 21:04:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-12-07 21:04:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 21:04:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-12-07 21:04:41,569 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 35 [2019-12-07 21:04:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:41,569 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-12-07 21:04:41,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 21:04:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-12-07 21:04:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 21:04:41,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:41,571 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:41,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:41,772 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2146852816, now seen corresponding path program 2 times [2019-12-07 21:04:41,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:41,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046393798] [2019-12-07 21:04:41,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 21:04:41,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046393798] [2019-12-07 21:04:41,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835361624] [2019-12-07 21:04:41,853 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/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 21:04:41,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 21:04:41,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:04:41,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:04:41,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 21:04:41,881 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 21:04:41,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [580041665] [2019-12-07 21:04:41,998 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:41,998 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:41,999 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 21:04:41,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:41,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 10 [2019-12-07 21:04:41,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454170373] [2019-12-07 21:04:42,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:04:42,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:42,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:04:42,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:04:42,000 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 10 states. [2019-12-07 21:04:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:42,064 INFO L93 Difference]: Finished difference Result 36 states and 55 transitions. [2019-12-07 21:04:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:04:42,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-07 21:04:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:42,065 INFO L225 Difference]: With dead ends: 36 [2019-12-07 21:04:42,066 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 21:04:42,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:04:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 21:04:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-12-07 21:04:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 21:04:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2019-12-07 21:04:42,072 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 37 [2019-12-07 21:04:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:42,072 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2019-12-07 21:04:42,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:04:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2019-12-07 21:04:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 21:04:42,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:42,074 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:42,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:42,276 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:42,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1442719670, now seen corresponding path program 3 times [2019-12-07 21:04:42,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:42,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961975459] [2019-12-07 21:04:42,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 34 proven. 53 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 21:04:42,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961975459] [2019-12-07 21:04:42,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206933556] [2019-12-07 21:04:42,357 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/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 21:04:42,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:04:42,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:04:42,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:04:42,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 84 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 21:04:42,404 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 99 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-07 21:04:42,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [381467750] [2019-12-07 21:04:42,697 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:42,697 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:42,698 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 21:04:42,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:42,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 11] total 14 [2019-12-07 21:04:42,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973200813] [2019-12-07 21:04:42,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 21:04:42,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 21:04:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:04:42,700 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 14 states. [2019-12-07 21:04:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:42,803 INFO L93 Difference]: Finished difference Result 46 states and 88 transitions. [2019-12-07 21:04:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:04:42,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-12-07 21:04:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:42,805 INFO L225 Difference]: With dead ends: 46 [2019-12-07 21:04:42,805 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 21:04:42,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-12-07 21:04:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 21:04:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-12-07 21:04:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 21:04:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2019-12-07 21:04:42,813 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 63 [2019-12-07 21:04:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:42,813 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2019-12-07 21:04:42,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 21:04:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2019-12-07 21:04:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 21:04:42,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:42,815 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:43,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:43,017 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:43,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2106103662, now seen corresponding path program 4 times [2019-12-07 21:04:43,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:43,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493192916] [2019-12-07 21:04:43,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 240 proven. 475 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-12-07 21:04:43,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493192916] [2019-12-07 21:04:43,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553955842] [2019-12-07 21:04:43,244 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/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 21:04:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:43,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 21:04:43,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-12-07 21:04:43,342 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 403 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2019-12-07 21:04:43,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648692102] [2019-12-07 21:04:43,931 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:43,931 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:43,931 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 21:04:43,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:43,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 13] total 25 [2019-12-07 21:04:43,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548549822] [2019-12-07 21:04:43,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 21:04:43,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:43,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 21:04:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2019-12-07 21:04:43,934 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand 25 states. [2019-12-07 21:04:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:44,348 INFO L93 Difference]: Finished difference Result 110 states and 256 transitions. [2019-12-07 21:04:44,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 21:04:44,349 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 146 [2019-12-07 21:04:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:44,350 INFO L225 Difference]: With dead ends: 110 [2019-12-07 21:04:44,350 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 21:04:44,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 286 SyntacticMatches, 10 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 21:04:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 21:04:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-12-07 21:04:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 21:04:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2019-12-07 21:04:44,366 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 146 [2019-12-07 21:04:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:44,366 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2019-12-07 21:04:44,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 21:04:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2019-12-07 21:04:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-12-07 21:04:44,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:44,370 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 21, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:44,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:44,571 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:44,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:44,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1195709265, now seen corresponding path program 5 times [2019-12-07 21:04:44,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:44,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993099911] [2019-12-07 21:04:44,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2490 backedges. 524 proven. 1029 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2019-12-07 21:04:44,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993099911] [2019-12-07 21:04:44,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046994756] [2019-12-07 21:04:44,860 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:44,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 21:04:44,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:04:44,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:04:44,901 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2490 backedges. 551 proven. 12 refuted. 0 times theorem prover too weak. 1927 trivial. 0 not checked. [2019-12-07 21:04:44,950 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2490 backedges. 551 proven. 14 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2019-12-07 21:04:45,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [146548948] [2019-12-07 21:04:45,399 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:45,399 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:45,400 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 21:04:45,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:45,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 9] total 27 [2019-12-07 21:04:45,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866407603] [2019-12-07 21:04:45,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 21:04:45,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 21:04:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-12-07 21:04:45,402 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand 27 states. [2019-12-07 21:04:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:45,808 INFO L93 Difference]: Finished difference Result 122 states and 182 transitions. [2019-12-07 21:04:45,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 21:04:45,808 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 210 [2019-12-07 21:04:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:45,810 INFO L225 Difference]: With dead ends: 122 [2019-12-07 21:04:45,810 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 21:04:45,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 432 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=334, Invalid=1306, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 21:04:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 21:04:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-12-07 21:04:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 21:04:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2019-12-07 21:04:45,819 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 210 [2019-12-07 21:04:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:45,819 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2019-12-07 21:04:45,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 21:04:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2019-12-07 21:04:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-12-07 21:04:45,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:45,822 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:46,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:46,023 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1078106151, now seen corresponding path program 6 times [2019-12-07 21:04:46,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:46,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830920811] [2019-12-07 21:04:46,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 686 proven. 911 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2019-12-07 21:04:46,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830920811] [2019-12-07 21:04:46,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569838181] [2019-12-07 21:04:46,284 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:46,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:04:46,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:04:46,351 INFO L264 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 21:04:46,354 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2019-12-07 21:04:46,396 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 756 refuted. 0 times theorem prover too weak. 1716 trivial. 0 not checked. [2019-12-07 21:04:47,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1936120056] [2019-12-07 21:04:47,302 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:47,302 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:47,303 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 21:04:47,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:47,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10, 15] total 30 [2019-12-07 21:04:47,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718907202] [2019-12-07 21:04:47,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 21:04:47,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:47,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 21:04:47,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2019-12-07 21:04:47,305 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 30 states. [2019-12-07 21:04:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:47,876 INFO L93 Difference]: Finished difference Result 144 states and 217 transitions. [2019-12-07 21:04:47,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 21:04:47,876 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 214 [2019-12-07 21:04:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:47,878 INFO L225 Difference]: With dead ends: 144 [2019-12-07 21:04:47,879 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 21:04:47,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 430 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=553, Invalid=1997, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 21:04:47,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 21:04:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-12-07 21:04:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 21:04:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2019-12-07 21:04:47,887 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 214 [2019-12-07 21:04:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:47,888 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2019-12-07 21:04:47,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 21:04:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2019-12-07 21:04:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-12-07 21:04:47,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:47,893 INFO L410 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:48,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:48,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:48,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash -53992125, now seen corresponding path program 7 times [2019-12-07 21:04:48,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:48,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131633887] [2019-12-07 21:04:48,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1348 proven. 1818 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2019-12-07 21:04:48,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131633887] [2019-12-07 21:04:48,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215303254] [2019-12-07 21:04:48,425 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:48,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 21:04:48,516 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1348 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2019-12-07 21:04:48,584 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1405 refuted. 0 times theorem prover too weak. 4430 trivial. 0 not checked. [2019-12-07 21:04:49,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1336618915] [2019-12-07 21:04:49,991 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:49,991 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:49,991 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 21:04:49,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:49,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2019-12-07 21:04:49,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610885811] [2019-12-07 21:04:49,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 21:04:49,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:49,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 21:04:49,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 21:04:49,994 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand 33 states. [2019-12-07 21:04:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:50,784 INFO L93 Difference]: Finished difference Result 184 states and 304 transitions. [2019-12-07 21:04:50,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 21:04:50,785 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 323 [2019-12-07 21:04:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:50,786 INFO L225 Difference]: With dead ends: 184 [2019-12-07 21:04:50,786 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 21:04:50,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 647 SyntacticMatches, 14 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=738, Invalid=2684, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 21:04:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 21:04:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2019-12-07 21:04:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 21:04:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2019-12-07 21:04:50,796 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 323 [2019-12-07 21:04:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:50,796 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2019-12-07 21:04:50,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 21:04:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2019-12-07 21:04:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-12-07 21:04:50,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:50,799 INFO L410 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:50,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:51,000 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1653353793, now seen corresponding path program 8 times [2019-12-07 21:04:51,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:51,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945201827] [2019-12-07 21:04:51,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-12-07 21:04:51,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945201827] [2019-12-07 21:04:51,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470391128] [2019-12-07 21:04:51,250 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:51,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-12-07 21:04:51,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:04:51,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 21:04:51,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 1415 proven. 256 refuted. 0 times theorem prover too weak. 10716 trivial. 0 not checked. [2019-12-07 21:04:51,450 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 1421 proven. 282 refuted. 0 times theorem prover too weak. 10684 trivial. 0 not checked. [2019-12-07 21:04:52,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648185796] [2019-12-07 21:04:52,336 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:52,336 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:52,337 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 21:04:52,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:52,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 13] total 17 [2019-12-07 21:04:52,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266120969] [2019-12-07 21:04:52,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 21:04:52,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:52,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 21:04:52,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:04:52,339 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand 17 states. [2019-12-07 21:04:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:52,462 INFO L93 Difference]: Finished difference Result 109 states and 160 transitions. [2019-12-07 21:04:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:04:52,463 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 459 [2019-12-07 21:04:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:52,464 INFO L225 Difference]: With dead ends: 109 [2019-12-07 21:04:52,465 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 21:04:52,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 909 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=213, Invalid=387, Unknown=0, NotChecked=0, Total=600 [2019-12-07 21:04:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 21:04:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-12-07 21:04:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 21:04:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2019-12-07 21:04:52,473 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 459 [2019-12-07 21:04:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:52,474 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2019-12-07 21:04:52,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 21:04:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2019-12-07 21:04:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-12-07 21:04:52,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:52,482 INFO L410 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:52,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:52,682 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash -703398773, now seen corresponding path program 9 times [2019-12-07 21:04:52,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:52,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484892014] [2019-12-07 21:04:52,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 18466 proven. 4498 refuted. 0 times theorem prover too weak. 27946 trivial. 0 not checked. [2019-12-07 21:04:53,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484892014] [2019-12-07 21:04:53,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200000484] [2019-12-07 21:04:53,620 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:53,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:04:53,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:04:53,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 21:04:53,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3596 proven. 2302 refuted. 0 times theorem prover too weak. 45012 trivial. 0 not checked. [2019-12-07 21:04:54,205 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:04:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3589 proven. 2379 refuted. 0 times theorem prover too weak. 44942 trivial. 0 not checked. [2019-12-07 21:04:57,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1365786021] [2019-12-07 21:04:57,358 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:04:57,358 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:04:57,359 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 21:04:57,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:04:57,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 20] total 32 [2019-12-07 21:04:57,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030367374] [2019-12-07 21:04:57,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 21:04:57,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:04:57,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 21:04:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2019-12-07 21:04:57,362 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand 32 states. [2019-12-07 21:04:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:04:57,618 INFO L93 Difference]: Finished difference Result 146 states and 259 transitions. [2019-12-07 21:04:57,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 21:04:57,619 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 922 [2019-12-07 21:04:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:04:57,621 INFO L225 Difference]: With dead ends: 146 [2019-12-07 21:04:57,621 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 21:04:57,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1982 GetRequests, 1927 SyntacticMatches, 18 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=431, Invalid=1051, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 21:04:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 21:04:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2019-12-07 21:04:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 21:04:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2019-12-07 21:04:57,629 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 922 [2019-12-07 21:04:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:04:57,631 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-12-07 21:04:57,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 21:04:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2019-12-07 21:04:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2019-12-07 21:04:57,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:04:57,636 INFO L410 BasicCegarLoop]: trace histogram [119, 119, 96, 59, 59, 59, 59, 59, 59, 59, 37, 23, 1, 1, 1, 1, 1, 1] [2019-12-07 21:04:57,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:57,837 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:04:57,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:04:57,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1827409363, now seen corresponding path program 10 times [2019-12-07 21:04:57,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:04:57,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804586781] [2019-12-07 21:04:57,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:04:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 4675 proven. 5578 refuted. 0 times theorem prover too weak. 29235 trivial. 0 not checked. [2019-12-07 21:04:58,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804586781] [2019-12-07 21:04:58,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540566241] [2019-12-07 21:04:58,489 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:04:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:04:58,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 1807 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 21:04:58,688 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:04:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 2281 proven. 2873 refuted. 0 times theorem prover too weak. 34334 trivial. 0 not checked. [2019-12-07 21:04:58,983 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:05:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 2276 proven. 2948 refuted. 0 times theorem prover too weak. 34264 trivial. 0 not checked. [2019-12-07 21:05:01,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [645888390] [2019-12-07 21:05:01,993 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:05:01,994 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:05:01,994 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 21:05:01,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:05:01,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 20] total 30 [2019-12-07 21:05:01,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843985113] [2019-12-07 21:05:01,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 21:05:01,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 21:05:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2019-12-07 21:05:01,996 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand 30 states. [2019-12-07 21:05:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:02,205 INFO L93 Difference]: Finished difference Result 149 states and 234 transitions. [2019-12-07 21:05:02,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 21:05:02,205 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 813 [2019-12-07 21:05:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:02,207 INFO L225 Difference]: With dead ends: 149 [2019-12-07 21:05:02,207 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 21:05:02,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1687 GetRequests, 1634 SyntacticMatches, 18 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=408, Invalid=924, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 21:05:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 21:05:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2019-12-07 21:05:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 21:05:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2019-12-07 21:05:02,217 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 813 [2019-12-07 21:05:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:02,218 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2019-12-07 21:05:02,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 21:05:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2019-12-07 21:05:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2019-12-07 21:05:02,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:02,224 INFO L410 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:02,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:05:02,425 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2028492684, now seen corresponding path program 11 times [2019-12-07 21:05:02,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:02,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859586601] [2019-12-07 21:05:02,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-12-07 21:05:03,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859586601] [2019-12-07 21:05:03,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506041007] [2019-12-07 21:05:03,535 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:05:03,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-12-07 21:05:03,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:05:03,913 INFO L264 TraceCheckSpWp]: Trace formula consists of 1656 conjuncts, 439 conjunts are in the unsatisfiable core [2019-12-07 21:05:03,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:05:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-12-07 21:05:04,814 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:05:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-12-07 21:05:10,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [694606425] [2019-12-07 21:05:10,498 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:05:10,498 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:05:10,498 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 21:05:10,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:05:10,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2019-12-07 21:05:10,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9673013] [2019-12-07 21:05:10,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 21:05:10,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 21:05:10,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 21:05:10,501 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand 36 states. [2019-12-07 21:05:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:10,891 INFO L93 Difference]: Finished difference Result 133 states and 189 transitions. [2019-12-07 21:05:10,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 21:05:10,891 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 745 [2019-12-07 21:05:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:10,893 INFO L225 Difference]: With dead ends: 133 [2019-12-07 21:05:10,893 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 21:05:10,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1709 GetRequests, 1565 SyntacticMatches, 110 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 21:05:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 21:05:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2019-12-07 21:05:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 21:05:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2019-12-07 21:05:10,901 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 745 [2019-12-07 21:05:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:10,901 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2019-12-07 21:05:10,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 21:05:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2019-12-07 21:05:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2019-12-07 21:05:10,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:05:10,906 INFO L410 BasicCegarLoop]: trace histogram [119, 119, 96, 59, 59, 59, 59, 59, 59, 59, 37, 23, 1, 1, 1, 1, 1, 1] [2019-12-07 21:05:11,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:05:11,107 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:05:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:05:11,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1544549963, now seen corresponding path program 12 times [2019-12-07 21:05:11,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:05:11,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083887583] [2019-12-07 21:05:11,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:05:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:05:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 1272 proven. 8779 refuted. 0 times theorem prover too weak. 29437 trivial. 0 not checked. [2019-12-07 21:05:11,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083887583] [2019-12-07 21:05:11,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816365522] [2019-12-07 21:05:11,787 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:05:11,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:05:11,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:05:11,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 21:05:12,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:05:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 1036 proven. 4713 refuted. 0 times theorem prover too weak. 33739 trivial. 0 not checked. [2019-12-07 21:05:12,312 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:05:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 1028 proven. 4813 refuted. 0 times theorem prover too weak. 33647 trivial. 0 not checked. [2019-12-07 21:05:16,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [119893755] [2019-12-07 21:05:16,055 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 21:05:16,055 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:05:16,055 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 21:05:16,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:05:16,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 22] total 33 [2019-12-07 21:05:16,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948332893] [2019-12-07 21:05:16,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 21:05:16,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:05:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 21:05:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 21:05:16,058 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand 33 states. [2019-12-07 21:05:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:05:16,284 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2019-12-07 21:05:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 21:05:16,284 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 813 [2019-12-07 21:05:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:05:16,285 INFO L225 Difference]: With dead ends: 147 [2019-12-07 21:05:16,285 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:05:16,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1684 GetRequests, 1625 SyntacticMatches, 20 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=498, Invalid=1142, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 21:05:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:05:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:05:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:05:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:05:16,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 813 [2019-12-07 21:05:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:05:16,288 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:05:16,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 21:05:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:05:16,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:05:16,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:05:16,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:05:16,918 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 9 [2019-12-07 21:05:17,599 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 75 [2019-12-07 21:05:17,608 INFO L246 CegarLoopResult]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2019-12-07 21:05:17,608 INFO L249 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2019-12-07 21:05:17,609 INFO L242 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (not (<= |fibonacci_#in~n| 1)) (<= fibonacci_~n |fibonacci_#in~n|)) [2019-12-07 21:05:17,609 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-12-07 21:05:17,609 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse7 (* 2 fibonacci_~n))) (let ((.cse3 (<= |fibonacci_#in~n| fibonacci_~n)) (.cse4 (<= (+ .cse7 15) (* 5 |fibonacci_#in~n|)))) (let ((.cse5 (and .cse3 .cse4 (<= 3 |fibonacci_#t~ret0|) (<= |fibonacci_#t~ret0| 3) (<= (+ |fibonacci_#in~n| .cse7) 15))) (.cse6 (and .cse3 (<= |fibonacci_#t~ret0| 2) (<= |fibonacci_#in~n| 4) (<= 2 |fibonacci_#t~ret0|) (<= (+ fibonacci_~n 4) (* 2 |fibonacci_#in~n|))))) (and (let ((.cse0 (<= |fibonacci_#t~ret0| 1)) (.cse1 (<= 1 |fibonacci_#t~ret0|)) (.cse2 (<= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (< 1 fibonacci_~n) .cse1 (<= |fibonacci_#in~n| 2) .cse2) (and (<= 7 |fibonacci_#in~n|) .cse3 (<= |fibonacci_#t~ret0| 8) (<= 8 |fibonacci_#t~ret0|) (<= (+ |fibonacci_#in~n| (* 5 fibonacci_~n)) 42)) (and .cse3 (<= 5 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 6) .cse4 (<= |fibonacci_#t~ret0| 5) .cse2) (and (<= 13 |fibonacci_#t~ret0|) .cse3 (<= |fibonacci_#in~n| 8) (<= 8 |fibonacci_#in~n|) (<= |fibonacci_#t~ret0| 13) .cse2) (and .cse3 (<= 10 |fibonacci_#in~n|) .cse2) .cse5 (and (<= |fibonacci_#t~ret0| 21) (<= 9 |fibonacci_#in~n|) (<= 21 |fibonacci_#t~ret0|) .cse3 .cse2) (and .cse0 .cse1 (<= (* 3 |fibonacci_#in~n|) (+ fibonacci_~n 6)) (<= 3 |fibonacci_#in~n|) .cse2) .cse6)) (or .cse5 (not (<= 4 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 5)) .cse6))))) [2019-12-07 21:05:17,610 INFO L246 CegarLoopResult]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2019-12-07 21:05:17,610 INFO L246 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-12-07 21:05:17,610 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-12-07 21:05:17,610 INFO L246 CegarLoopResult]: For program point L15(lines 15 21) no Hoare annotation was computed. [2019-12-07 21:05:17,610 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:05:17,611 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 21:05:17,611 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:05:17,611 INFO L246 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2019-12-07 21:05:17,611 INFO L242 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) [2019-12-07 21:05:17,611 INFO L246 CegarLoopResult]: For program point L27-1(line 27) no Hoare annotation was computed. [2019-12-07 21:05:17,611 INFO L242 CegarLoopResult]: At program point L25(lines 25 33) the Hoare annotation is: (<= 9 ULTIMATE.start_main_~x~0) [2019-12-07 21:05:17,612 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-12-07 21:05:17,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:05:17 BoogieIcfgContainer [2019-12-07 21:05:17,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:05:17,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:05:17,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:05:17,634 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:05:17,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:04:39" (3/4) ... [2019-12-07 21:05:17,637 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:05:17,643 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2019-12-07 21:05:17,647 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 21:05:17,647 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 21:05:17,678 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00ddcc27-a4bc-433b-9997-79a74d80bef5/bin/utaipan/witness.graphml [2019-12-07 21:05:17,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:05:17,680 INFO L168 Benchmark]: Toolchain (without parser) took 38130.00 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 946.2 MB in the beginning and 835.8 MB in the end (delta: 110.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 21:05:17,680 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:05:17,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:17,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.26 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 21:05:17,681 INFO L168 Benchmark]: Boogie Preprocessor took 10.22 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 21:05:17,681 INFO L168 Benchmark]: RCFGBuilder took 137.79 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: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:17,681 INFO L168 Benchmark]: TraceAbstraction took 37738.92 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 844.6 MB in the end (delta: 241.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 21:05:17,682 INFO L168 Benchmark]: Witness Printer took 45.19 ms. Allocated memory is still 2.2 GB. Free memory was 844.6 MB in the beginning and 835.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:05:17,684 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 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.26 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 10.22 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. * RCFGBuilder took 137.79 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: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37738.92 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 844.6 MB in the end (delta: 241.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 45.19 ms. Allocated memory is still 2.2 GB. Free memory was 844.6 MB in the beginning and 835.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: 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: 9 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 36.5s, OverallIterations: 16, TraceHistogramMax: 135, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 370 SDtfs, 1545 SDslu, 2340 SDs, 0 SdLazy, 4051 SolverSat, 2068 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10453 GetRequests, 9789 SyntacticMatches, 244 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3551 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 83 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 209 PreInvPairs, 487 NumberOfFragments, 251 HoareAnnotationTreeSize, 209 FomulaSimplifications, 8468 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 6463 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 9669 NumberOfCodeBlocks, 8916 NumberOfCodeBlocksAsserted, 151 NumberOfCheckSat, 14450 ConstructedInterpolants, 0 QuantifiedInterpolants, 18501577 SizeOfPredicates, 78 NumberOfNonLiveVariables, 8838 ConjunctsInSsa, 594 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 479809/563811 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...