./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_15x0-1.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_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_15x0-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 7f140b11074e684b22c263036fee9fde5b4c087a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:06:28,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:06:28,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:06:28,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:06:28,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:06:28,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:06:28,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:06:28,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:06:28,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:06:28,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:06:28,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:06:28,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:06:28,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:06:28,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:06:28,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:06:28,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:06:28,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:06:28,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:06:28,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:06:28,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:06:28,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:06:28,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:06:28,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:06:28,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:06:28,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:06:28,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:06:28,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:06:28,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:06:28,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:06:28,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:06:28,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:06:28,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:06:28,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:06:28,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:06:28,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:06:28,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:06:28,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:06:28,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:06:28,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:06:28,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:06:28,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:06:28,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:06:28,830 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:06:28,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:06:28,831 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:06:28,831 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:06:28,831 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:06:28,832 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:06:28,832 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:06:28,832 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:06:28,832 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:06:28,832 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:06:28,832 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:06:28,832 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:06:28,833 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:06:28,833 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:06:28,833 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:06:28,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:06:28,833 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:06:28,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:06:28,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:06:28,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:06:28,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:06:28,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:06:28,834 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:06:28,834 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:06:28,834 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:06:28,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:06:28,834 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:06:28,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:06:28,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:06:28,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:06:28,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:06:28,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:06:28,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:06:28,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:06:28,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:06:28,835 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:06:28,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:06:28,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:06:28,836 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:06:28,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:06:28,836 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_68c7a556-0201-430a-a7bc-86ec1e487684/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 -> 7f140b11074e684b22c263036fee9fde5b4c087a [2019-12-07 11:06:28,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:06:28,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:06:28,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:06:28,947 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:06:28,948 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:06:28,948 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/../../sv-benchmarks/c/recursive-simple/sum_15x0-1.c [2019-12-07 11:06:28,989 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/data/ef7bcbc1d/d6a14fea15ef43d5aa3c179e1e3e3097/FLAG656d50994 [2019-12-07 11:06:29,386 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:06:29,386 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/sv-benchmarks/c/recursive-simple/sum_15x0-1.c [2019-12-07 11:06:29,390 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/data/ef7bcbc1d/d6a14fea15ef43d5aa3c179e1e3e3097/FLAG656d50994 [2019-12-07 11:06:29,399 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/data/ef7bcbc1d/d6a14fea15ef43d5aa3c179e1e3e3097 [2019-12-07 11:06:29,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:06:29,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:06:29,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:06:29,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:06:29,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:06:29,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbcd236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29, skipping insertion in model container [2019-12-07 11:06:29,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:06:29,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:06:29,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:06:29,517 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:06:29,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:06:29,567 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:06:29,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29 WrapperNode [2019-12-07 11:06:29,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:06:29,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:06:29,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:06:29,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:06:29,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:06:29,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:06:29,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:06:29,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:06:29,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... [2019-12-07 11:06:29,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:06:29,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:06:29,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:06:29,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:06:29,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:06:29,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:06:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-12-07 11:06:29,637 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-12-07 11:06:29,732 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:06:29,733 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 11:06:29,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:06:29 BoogieIcfgContainer [2019-12-07 11:06:29,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:06:29,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:06:29,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:06:29,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:06:29,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:06:29" (1/3) ... [2019-12-07 11:06:29,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7b3935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:06:29, skipping insertion in model container [2019-12-07 11:06:29,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:29" (2/3) ... [2019-12-07 11:06:29,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7b3935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:06:29, skipping insertion in model container [2019-12-07 11:06:29,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:06:29" (3/3) ... [2019-12-07 11:06:29,738 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_15x0-1.c [2019-12-07 11:06:29,744 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:06:29,748 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:06:29,756 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:06:29,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:06:29,770 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:06:29,770 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:06:29,770 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:06:29,770 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:06:29,770 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:06:29,770 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:06:29,770 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:06:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-12-07 11:06:29,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:06:29,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:29,785 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:29,785 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:29,788 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-12-07 11:06:29,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:29,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79162618] [2019-12-07 11:06:29,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:29,900 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 11:06:29,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79162618] [2019-12-07 11:06:29,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:29,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:06:29,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355071157] [2019-12-07 11:06:29,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:06:29,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:29,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:06:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:06:29,915 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 5 states. [2019-12-07 11:06:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:29,961 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-12-07 11:06:29,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:06:29,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 11:06:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:29,968 INFO L225 Difference]: With dead ends: 22 [2019-12-07 11:06:29,968 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 11:06:29,970 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 11:06:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 11:06:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 11:06:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 11:06:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-12-07 11:06:30,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-12-07 11:06:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:30,006 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-12-07 11:06:30,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:06:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-12-07 11:06:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:06:30,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:30,007 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:30,008 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-12-07 11:06:30,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:30,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429593498] [2019-12-07 11:06:30,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:06:30,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429593498] [2019-12-07 11:06:30,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417750348] [2019-12-07 11:06:30,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:30,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:06:30,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:06:30,115 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:30,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:06:30,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [659916902] [2019-12-07 11:06:30,261 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:30,262 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:30,266 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 11:06:30,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:30,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-12-07 11:06:30,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777818104] [2019-12-07 11:06:30,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:06:30,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:30,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:06:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:06:30,269 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-12-07 11:06:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:30,314 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 11:06:30,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:06:30,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 11:06:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:30,315 INFO L225 Difference]: With dead ends: 21 [2019-12-07 11:06:30,315 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 11:06:30,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 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 11:06:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 11:06:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 11:06:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 11:06:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 11:06:30,319 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-12-07 11:06:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:30,319 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 11:06:30,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:06:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 11:06:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:06:30,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:30,320 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:30,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:30,521 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:30,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:30,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-12-07 11:06:30,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:30,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819352509] [2019-12-07 11:06:30,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 11:06:30,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819352509] [2019-12-07 11:06:30,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523094859] [2019-12-07 11:06:30,681 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:30,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 11:06:30,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:06:30,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:06:30,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 11:06:30,750 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:06:30,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [850257418] [2019-12-07 11:06:30,937 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:30,938 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:30,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 11:06:30,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:30,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2019-12-07 11:06:30,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63598613] [2019-12-07 11:06:30,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:06:30,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:06:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:06:30,939 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-12-07 11:06:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:30,988 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-12-07 11:06:30,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:06:30,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-07 11:06:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:30,989 INFO L225 Difference]: With dead ends: 24 [2019-12-07 11:06:30,989 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 11:06:30,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:06:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 11:06:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 11:06:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 11:06:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 11:06:30,993 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-12-07 11:06:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:30,993 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 11:06:30,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:06:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 11:06:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:06:30,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:30,994 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:31,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:31,195 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-12-07 11:06:31,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:31,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230595687] [2019-12-07 11:06:31,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:06:31,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230595687] [2019-12-07 11:06:31,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97696341] [2019-12-07 11:06:31,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_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:31,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:06:31,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:06:31,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:06:31,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:06:31,424 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 11:06:31,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [109272381] [2019-12-07 11:06:31,822 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:31,822 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:31,822 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 11:06:31,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:31,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2019-12-07 11:06:31,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246324175] [2019-12-07 11:06:31,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:06:31,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:31,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:06:31,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:06:31,824 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2019-12-07 11:06:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:31,887 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 11:06:31,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:06:31,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-12-07 11:06:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:31,888 INFO L225 Difference]: With dead ends: 27 [2019-12-07 11:06:31,888 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 11:06:31,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:06:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 11:06:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 11:06:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:06:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 11:06:31,893 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-12-07 11:06:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:31,893 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 11:06:31,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:06:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 11:06:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:06:31,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:31,894 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:32,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:32,096 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:32,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:32,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-12-07 11:06:32,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:32,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859810613] [2019-12-07 11:06:32,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 11:06:32,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859810613] [2019-12-07 11:06:32,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005686854] [2019-12-07 11:06:32,185 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:32,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:06:32,213 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 11:06:32,223 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 11:06:32,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1474615832] [2019-12-07 11:06:32,679 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:32,679 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:32,679 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 11:06:32,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:32,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2019-12-07 11:06:32,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460679476] [2019-12-07 11:06:32,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:06:32,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:32,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:06:32,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:06:32,681 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 15 states. [2019-12-07 11:06:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:32,744 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 11:06:32,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:06:32,744 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-12-07 11:06:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:32,745 INFO L225 Difference]: With dead ends: 30 [2019-12-07 11:06:32,745 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 11:06:32,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:06:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 11:06:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 11:06:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 11:06:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-12-07 11:06:32,749 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-12-07 11:06:32,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:32,749 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-12-07 11:06:32,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:06:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-12-07 11:06:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 11:06:32,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:32,750 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:32,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:32,951 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-12-07 11:06:32,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:32,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364189539] [2019-12-07 11:06:32,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 11:06:33,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364189539] [2019-12-07 11:06:33,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213896314] [2019-12-07 11:06:33,097 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:33,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 11:06:33,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:06:33,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:06:33,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 11:06:33,160 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:06:33,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1400054421] [2019-12-07 11:06:33,957 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:33,957 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:33,957 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 11:06:33,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:33,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2019-12-07 11:06:33,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983084147] [2019-12-07 11:06:33,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:06:33,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:33,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:06:33,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:06:33,959 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 17 states. [2019-12-07 11:06:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:34,042 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-12-07 11:06:34,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:06:34,043 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-12-07 11:06:34,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:34,043 INFO L225 Difference]: With dead ends: 33 [2019-12-07 11:06:34,043 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 11:06:34,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:06:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 11:06:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 11:06:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 11:06:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 11:06:34,048 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-12-07 11:06:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:34,048 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 11:06:34,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:06:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-12-07 11:06:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:06:34,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:34,050 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:34,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:34,251 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-12-07 11:06:34,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:34,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280659458] [2019-12-07 11:06:34,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 11:06:34,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280659458] [2019-12-07 11:06:34,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149888414] [2019-12-07 11:06:34,349 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:34,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:06:34,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:06:34,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:06:34,389 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 11:06:34,397 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 11:06:35,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1369182314] [2019-12-07 11:06:35,466 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:35,466 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:35,466 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 11:06:35,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:35,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2019-12-07 11:06:35,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014527006] [2019-12-07 11:06:35,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:06:35,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:35,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:06:35,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:06:35,468 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 19 states. [2019-12-07 11:06:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:35,549 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 11:06:35,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:06:35,549 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-12-07 11:06:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:35,550 INFO L225 Difference]: With dead ends: 36 [2019-12-07 11:06:35,550 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 11:06:35,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:06:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 11:06:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 11:06:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 11:06:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 11:06:35,554 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-12-07 11:06:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:35,555 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 11:06:35,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:06:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 11:06:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 11:06:35,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:35,556 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:35,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:35,757 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:35,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-12-07 11:06:35,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:35,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310766015] [2019-12-07 11:06:35,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 11:06:35,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310766015] [2019-12-07 11:06:35,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421627995] [2019-12-07 11:06:35,854 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:35,907 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 11:06:35,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 11:06:35,918 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 11:06:37,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [867489604] [2019-12-07 11:06:37,535 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:37,536 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:37,536 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 11:06:37,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:37,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2019-12-07 11:06:37,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173083261] [2019-12-07 11:06:37,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 11:06:37,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:37,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 11:06:37,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:06:37,538 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 21 states. [2019-12-07 11:06:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:37,626 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-12-07 11:06:37,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:06:37,627 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2019-12-07 11:06:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:37,628 INFO L225 Difference]: With dead ends: 39 [2019-12-07 11:06:37,628 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 11:06:37,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 84 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-12-07 11:06:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 11:06:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 11:06:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 11:06:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-12-07 11:06:37,632 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-12-07 11:06:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:37,632 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-12-07 11:06:37,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 11:06:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-12-07 11:06:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:06:37,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:37,633 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:37,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:37,834 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-12-07 11:06:37,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:37,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048426212] [2019-12-07 11:06:37,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 11:06:37,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048426212] [2019-12-07 11:06:37,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673740964] [2019-12-07 11:06:37,952 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:38,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 11:06:38,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:06:38,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 11:06:38,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 11:06:38,035 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 11:06:40,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [14488270] [2019-12-07 11:06:40,322 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:40,322 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:40,322 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java: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 11:06:40,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:40,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2019-12-07 11:06:40,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211331740] [2019-12-07 11:06:40,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:06:40,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:40,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:06:40,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:06:40,324 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 23 states. [2019-12-07 11:06:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:40,446 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-12-07 11:06:40,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:06:40,446 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2019-12-07 11:06:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:40,447 INFO L225 Difference]: With dead ends: 42 [2019-12-07 11:06:40,448 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 11:06:40,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:06:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 11:06:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 11:06:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 11:06:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-12-07 11:06:40,453 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-12-07 11:06:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:40,454 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-12-07 11:06:40,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:06:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-12-07 11:06:40,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:06:40,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:40,455 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:40,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:40,656 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:40,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-12-07 11:06:40,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:40,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896401748] [2019-12-07 11:06:40,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 11:06:40,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896401748] [2019-12-07 11:06:40,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274035465] [2019-12-07 11:06:40,782 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:40,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:06:40,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:06:40,883 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 11:06:40,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 11:06:40,896 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 11:06:45,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247022752] [2019-12-07 11:06:45,556 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:45,556 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:45,557 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 11:06:45,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:45,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2019-12-07 11:06:45,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334291752] [2019-12-07 11:06:45,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 11:06:45,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:45,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 11:06:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:06:45,558 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 25 states. [2019-12-07 11:06:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:45,690 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-12-07 11:06:45,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:06:45,690 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2019-12-07 11:06:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:45,691 INFO L225 Difference]: With dead ends: 45 [2019-12-07 11:06:45,691 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 11:06:45,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:06:45,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 11:06:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 11:06:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 11:06:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-12-07 11:06:45,695 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-12-07 11:06:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:45,695 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-12-07 11:06:45,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 11:06:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-12-07 11:06:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 11:06:45,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:45,696 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:45,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:45,897 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-12-07 11:06:45,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:45,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152485671] [2019-12-07 11:06:45,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 11:06:46,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152485671] [2019-12-07 11:06:46,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051592455] [2019-12-07 11:06:46,005 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:46,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 11:06:46,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 11:06:46,145 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 11:06:50,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1017486595] [2019-12-07 11:06:50,237 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:50,237 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:50,238 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 11:06:50,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:50,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2019-12-07 11:06:50,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329537884] [2019-12-07 11:06:50,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:06:50,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:06:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:06:50,239 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 27 states. [2019-12-07 11:06:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:50,398 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-12-07 11:06:50,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:06:50,399 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2019-12-07 11:06:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:50,399 INFO L225 Difference]: With dead ends: 48 [2019-12-07 11:06:50,399 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 11:06:50,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 114 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 11:06:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 11:06:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 11:06:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 11:06:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-12-07 11:06:50,403 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-12-07 11:06:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:50,404 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-12-07 11:06:50,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:06:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-12-07 11:06:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 11:06:50,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:50,405 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:50,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:50,605 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:50,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-12-07 11:06:50,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:50,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439968556] [2019-12-07 11:06:50,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-07 11:06:50,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439968556] [2019-12-07 11:06:50,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658637941] [2019-12-07 11:06:50,729 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:50,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-07 11:06:50,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:06:50,907 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 11:06:50,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-07 11:06:50,919 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 11:06:57,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1558980880] [2019-12-07 11:06:57,139 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:06:57,140 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:06:57,140 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 11:06:57,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:06:57,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2019-12-07 11:06:57,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883429950] [2019-12-07 11:06:57,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 11:06:57,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:57,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 11:06:57,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-12-07 11:06:57,141 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 29 states. [2019-12-07 11:06:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:57,299 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-12-07 11:06:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:06:57,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2019-12-07 11:06:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:57,300 INFO L225 Difference]: With dead ends: 51 [2019-12-07 11:06:57,300 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 11:06:57,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:06:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 11:06:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-12-07 11:06:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 11:06:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-12-07 11:06:57,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-12-07 11:06:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:57,305 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-12-07 11:06:57,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 11:06:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-12-07 11:06:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 11:06:57,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:57,306 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:57,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:57,507 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:57,508 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-12-07 11:06:57,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:57,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170977877] [2019-12-07 11:06:57,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-12-07 11:06:57,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170977877] [2019-12-07 11:06:57,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290419842] [2019-12-07 11:06:57,630 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:06:57,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:06:57,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:06:57,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 11:06:57,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-12-07 11:06:57,872 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-07 11:07:05,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [413709962] [2019-12-07 11:07:05,310 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:07:05,310 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:07:05,310 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 11:07:05,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:07:05,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2019-12-07 11:07:05,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412271770] [2019-12-07 11:07:05,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 11:07:05,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 11:07:05,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:07:05,312 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 31 states. [2019-12-07 11:07:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:05,510 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-12-07 11:07:05,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 11:07:05,510 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2019-12-07 11:07:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:05,511 INFO L225 Difference]: With dead ends: 54 [2019-12-07 11:07:05,511 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 11:07:05,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 134 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:07:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 11:07:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 11:07:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 11:07:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-12-07 11:07:05,516 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-12-07 11:07:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:05,516 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-12-07 11:07:05,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 11:07:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-12-07 11:07:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 11:07:05,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:05,517 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:05,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:05,718 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:05,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-12-07 11:07:05,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:05,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493043498] [2019-12-07 11:07:05,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-12-07 11:07:05,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493043498] [2019-12-07 11:07:05,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439654269] [2019-12-07 11:07:05,879 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:07:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:06,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 11:07:06,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-12-07 11:07:06,167 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 11:07:15,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [850294105] [2019-12-07 11:07:15,315 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:07:15,315 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:07:15,315 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 11:07:15,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:07:15,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2019-12-07 11:07:15,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981975646] [2019-12-07 11:07:15,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 11:07:15,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:15,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 11:07:15,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:07:15,317 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 33 states. [2019-12-07 11:07:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:15,545 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-12-07 11:07:15,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 11:07:15,545 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2019-12-07 11:07:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:15,546 INFO L225 Difference]: With dead ends: 57 [2019-12-07 11:07:15,546 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 11:07:15,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 144 SyntacticMatches, 28 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 11:07:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 11:07:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 11:07:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 11:07:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-12-07 11:07:15,551 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-12-07 11:07:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:15,551 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-12-07 11:07:15,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 11:07:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-12-07 11:07:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 11:07:15,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:15,552 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:15,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:15,753 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-12-07 11:07:15,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:15,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662476671] [2019-12-07 11:07:15,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-12-07 11:07:15,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662476671] [2019-12-07 11:07:15,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782113688] [2019-12-07 11:07:15,933 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/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 11:07:16,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-07 11:07:16,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:07:16,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 11:07:16,333 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-12-07 11:07:16,345 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 11:07:27,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069285248] [2019-12-07 11:07:27,801 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 11:07:27,801 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:07:27,801 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 11:07:27,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:07:27,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 34 [2019-12-07 11:07:27,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230006525] [2019-12-07 11:07:27,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 11:07:27,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:27,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 11:07:27,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:07:27,803 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 34 states. [2019-12-07 11:07:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:28,014 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-12-07 11:07:28,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:07:28,015 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 93 [2019-12-07 11:07:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:28,015 INFO L225 Difference]: With dead ends: 60 [2019-12-07 11:07:28,015 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 11:07:28,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 31 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=800, Invalid=1552, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 11:07:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 11:07:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 11:07:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 11:07:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-12-07 11:07:28,021 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-12-07 11:07:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:28,022 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-12-07 11:07:28,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 11:07:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-12-07 11:07:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:07:28,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:28,023 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:28,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:28,224 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:28,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:28,224 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-12-07 11:07:28,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:28,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782902592] [2019-12-07 11:07:28,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 315 proven. 59 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-12-07 11:07:28,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782902592] [2019-12-07 11:07:28,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98187780] [2019-12-07 11:07:28,871 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:29,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:07:29,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:07:29,352 WARN L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 195 conjunts are in the unsatisfiable core [2019-12-07 11:07:29,353 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2019-12-07 11:07:29,462 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:07:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2019-12-07 11:07:33,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:07:33,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [39] total 41 [2019-12-07 11:07:33,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467454938] [2019-12-07 11:07:33,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:07:33,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:33,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:07:33,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1349, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:07:33,286 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 8 states. [2019-12-07 11:07:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:33,325 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-12-07 11:07:33,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:07:33,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-12-07 11:07:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:33,326 INFO L225 Difference]: With dead ends: 56 [2019-12-07 11:07:33,326 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:07:33,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 191 SyntacticMatches, 19 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=1503, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 11:07:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:07:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:07:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:07:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:07:33,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2019-12-07 11:07:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:33,327 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:07:33,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:07:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:07:33,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:07:33,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:33,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:07:33,578 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:07:33,579 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:07:33,579 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2019-12-07 11:07:33,579 INFO L246 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2019-12-07 11:07:33,579 INFO L246 CegarLoopResult]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-12-07 11:07:33,579 INFO L242 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (<= 15 ULTIMATE.start_main_~a~0) [2019-12-07 11:07:33,580 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-12-07 11:07:33,580 INFO L246 CegarLoopResult]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-12-07 11:07:33,580 INFO L246 CegarLoopResult]: For program point sumEXIT(lines 3 9) no Hoare annotation was computed. [2019-12-07 11:07:33,580 INFO L242 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|)) [2019-12-07 11:07:33,580 INFO L246 CegarLoopResult]: For program point L7-1(line 7) no Hoare annotation was computed. [2019-12-07 11:07:33,580 INFO L246 CegarLoopResult]: For program point L4(lines 4 8) no Hoare annotation was computed. [2019-12-07 11:07:33,581 INFO L246 CegarLoopResult]: For program point sumFINAL(lines 3 9) no Hoare annotation was computed. [2019-12-07 11:07:33,581 INFO L249 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2019-12-07 11:07:33,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:07:33 BoogieIcfgContainer [2019-12-07 11:07:33,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:07:33,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:07:33,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:07:33,589 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:07:33,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:06:29" (3/4) ... [2019-12-07 11:07:33,594 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:07:33,600 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2019-12-07 11:07:33,604 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 11:07:33,604 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 11:07:33,630 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_68c7a556-0201-430a-a7bc-86ec1e487684/bin/utaipan/witness.graphml [2019-12-07 11:07:33,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:07:33,631 INFO L168 Benchmark]: Toolchain (without parser) took 64228.73 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.7 MB). Free memory was 939.8 MB in the beginning and 958.0 MB in the end (delta: -18.3 MB). Peak memory consumption was 428.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:33,631 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:07:33,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:33,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:07:33,632 INFO L168 Benchmark]: Boogie Preprocessor took 10.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:07:33,632 INFO L168 Benchmark]: RCFGBuilder took 135.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:33,632 INFO L168 Benchmark]: TraceAbstraction took 63853.86 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.5 MB). Free memory was 1.1 GB in the beginning and 962.9 MB in the end (delta: 149.7 MB). Peak memory consumption was 462.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:33,633 INFO L168 Benchmark]: Witness Printer took 41.49 ms. Allocated memory is still 1.5 GB. Free memory was 962.9 MB in the beginning and 958.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:07:33,634 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 135.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63853.86 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.5 MB). Free memory was 1.1 GB in the beginning and 962.9 MB in the end (delta: 149.7 MB). Peak memory consumption was 462.2 MB. Max. memory is 11.5 GB. * Witness Printer took 41.49 ms. Allocated memory is still 1.5 GB. Free memory was 962.9 MB in the beginning and 958.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Result: SAFE, OverallTime: 63.7s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 126 SDtfs, 2211 SDslu, 759 SDs, 0 SdLazy, 1077 SolverSat, 963 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2140 GetRequests, 1439 SyntacticMatches, 258 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4023 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 11 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 55.9s InterpolantComputationTime, 1719 NumberOfCodeBlocks, 1719 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 2528 ConstructedInterpolants, 0 QuantifiedInterpolants, 692078 SizeOfPredicates, 170 NumberOfNonLiveVariables, 2580 ConjunctsInSsa, 461 ConjunctsInUnsatCore, 46 InterpolantComputations, 3 PerfectInterpolantSequences, 5721/11520 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...