./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_15x0-2.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_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_15x0-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 31319b3dce926b7eddaa50d24c240f6870931f21 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:47:26,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:47:26,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:47:26,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:47:26,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:47:26,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:47:26,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:47:26,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:47:26,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:47:26,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:47:26,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:47:26,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:47:26,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:47:26,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:47:26,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:47:26,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:47:26,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:47:26,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:47:26,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:47:26,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:47:26,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:47:26,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:47:26,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:47:26,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:47:26,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:47:26,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:47:26,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:47:26,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:47:26,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:47:26,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:47:26,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:47:26,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:47:26,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:47:26,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:47:26,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:47:26,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:47:26,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:47:26,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:47:26,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:47:26,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:47:26,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:47:26,493 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:47:26,502 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:47:26,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:47:26,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:47:26,503 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:47:26,503 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:47:26,503 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:47:26,503 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:47:26,504 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:47:26,504 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:47:26,504 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:47:26,504 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:47:26,504 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:47:26,504 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:47:26,504 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:47:26,504 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:47:26,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:47:26,505 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:47:26,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:47:26,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:47:26,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:47:26,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:47:26,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:47:26,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:47:26,506 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:47:26,506 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:47:26,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:47:26,506 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:47:26,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:47:26,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:47:26,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:47:26,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:47:26,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:47:26,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:47:26,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:47:26,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:47:26,507 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:47:26,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:47:26,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:47:26,508 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:47:26,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:47:26,508 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_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 -> 31319b3dce926b7eddaa50d24c240f6870931f21 [2019-12-07 16:47:26,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:47:26,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:47:26,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:47:26,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:47:26,616 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:47:26,616 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/../../sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2019-12-07 16:47:26,652 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/data/d189a48b2/685f73dea6e3436fa35b9716cb08b932/FLAGb8ae98c87 [2019-12-07 16:47:27,074 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:47:27,075 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2019-12-07 16:47:27,078 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/data/d189a48b2/685f73dea6e3436fa35b9716cb08b932/FLAGb8ae98c87 [2019-12-07 16:47:27,087 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/data/d189a48b2/685f73dea6e3436fa35b9716cb08b932 [2019-12-07 16:47:27,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:47:27,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:47:27,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:47:27,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:47:27,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:47:27,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446e037f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27, skipping insertion in model container [2019-12-07 16:47:27,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:47:27,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:47:27,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:47:27,212 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:47:27,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:47:27,263 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:47:27,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27 WrapperNode [2019-12-07 16:47:27,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:47:27,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:47:27,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:47:27,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:47:27,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:47:27,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:47:27,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:47:27,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:47:27,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... [2019-12-07 16:47:27,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:47:27,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:47:27,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:47:27,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:47:27,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:47:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:47:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-12-07 16:47:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-12-07 16:47:27,428 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:47:27,428 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 16:47:27,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:47:27 BoogieIcfgContainer [2019-12-07 16:47:27,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:47:27,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:47:27,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:47:27,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:47:27,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:47:27" (1/3) ... [2019-12-07 16:47:27,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352817f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:47:27, skipping insertion in model container [2019-12-07 16:47:27,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:47:27" (2/3) ... [2019-12-07 16:47:27,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352817f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:47:27, skipping insertion in model container [2019-12-07 16:47:27,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:47:27" (3/3) ... [2019-12-07 16:47:27,433 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2019-12-07 16:47:27,440 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:47:27,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:47:27,451 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:47:27,465 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:47:27,465 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:47:27,466 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:47:27,466 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:47:27,466 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:47:27,466 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:47:27,466 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:47:27,466 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:47:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-12-07 16:47:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:47:27,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:27,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:27,480 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:27,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:27,484 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-12-07 16:47:27,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:27,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993371386] [2019-12-07 16:47:27,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:27,622 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 16:47:27,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993371386] [2019-12-07 16:47:27,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:47:27,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:47:27,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240249316] [2019-12-07 16:47:27,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:47:27,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:27,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:47:27,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:47:27,638 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 7 states. [2019-12-07 16:47:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:27,722 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-12-07 16:47:27,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:47:27,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 16:47:27,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:27,729 INFO L225 Difference]: With dead ends: 24 [2019-12-07 16:47:27,730 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 16:47:27,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:47:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 16:47:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 16:47:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 16:47:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-12-07 16:47:27,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-12-07 16:47:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:27,758 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-12-07 16:47:27,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:47:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-12-07 16:47:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:47:27,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:27,759 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:27,760 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-12-07 16:47:27,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:27,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067382557] [2019-12-07 16:47:27,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:27,824 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 16:47:27,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067382557] [2019-12-07 16:47:27,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479931878] [2019-12-07 16:47:27,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:27,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:47:27,854 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:27,909 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 16:47:27,909 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:28,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:47:28,032 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 16:47:28,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1963079524] [2019-12-07 16:47:28,047 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:28,047 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:28,051 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 16:47:28,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:28,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 15 [2019-12-07 16:47:28,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338781181] [2019-12-07 16:47:28,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:47:28,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:28,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:47:28,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:47:28,054 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 15 states. [2019-12-07 16:47:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:28,153 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 16:47:28,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:47:28,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-12-07 16:47:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:28,155 INFO L225 Difference]: With dead ends: 21 [2019-12-07 16:47:28,155 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 16:47:28,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:47:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 16:47:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 16:47:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 16:47:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 16:47:28,160 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-12-07 16:47:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:28,161 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 16:47:28,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:47:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 16:47:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:47:28,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:28,162 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:28,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:28,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:28,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-12-07 16:47:28,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:28,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312484006] [2019-12-07 16:47:28,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:28,466 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 16:47:28,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312484006] [2019-12-07 16:47:28,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492129063] [2019-12-07 16:47:28,467 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:28,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 16:47:28,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:47:28,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:47:28,493 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:28,537 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 16:47:28,537 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:28,750 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 16:47:28,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2068384120] [2019-12-07 16:47:28,752 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:28,752 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:28,752 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 16:47:28,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:28,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 19 [2019-12-07 16:47:28,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536867686] [2019-12-07 16:47:28,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 16:47:28,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:28,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 16:47:28,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:47:28,754 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 19 states. [2019-12-07 16:47:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:28,895 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-12-07 16:47:28,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:47:28,895 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-12-07 16:47:28,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:28,896 INFO L225 Difference]: With dead ends: 24 [2019-12-07 16:47:28,896 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 16:47:28,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:47:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 16:47:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 16:47:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 16:47:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 16:47:28,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-12-07 16:47:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:28,901 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 16:47:28,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 16:47:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 16:47:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:47:28,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:28,902 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:29,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:29,104 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:29,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:29,104 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-12-07 16:47:29,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:29,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457658109] [2019-12-07 16:47:29,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:29,227 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 16:47:29,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457658109] [2019-12-07 16:47:29,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850254911] [2019-12-07 16:47:29,228 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:29,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:47:29,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:47:29,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:47:29,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:29,312 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 16:47:29,312 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:29,625 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 16:47:29,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [573863900] [2019-12-07 16:47:29,627 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:29,627 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:29,627 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 16:47:29,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:29,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 11] total 23 [2019-12-07 16:47:29,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686755690] [2019-12-07 16:47:29,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 16:47:29,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:29,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 16:47:29,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-12-07 16:47:29,629 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 23 states. [2019-12-07 16:47:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:29,792 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 16:47:29,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:47:29,792 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-12-07 16:47:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:29,793 INFO L225 Difference]: With dead ends: 27 [2019-12-07 16:47:29,793 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 16:47:29,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-12-07 16:47:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 16:47:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 16:47:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 16:47:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 16:47:29,799 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-12-07 16:47:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:29,799 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 16:47:29,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 16:47:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 16:47:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:47:29,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:29,800 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:30,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:30,001 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-12-07 16:47:30,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:30,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211377601] [2019-12-07 16:47:30,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:30,136 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 16:47:30,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211377601] [2019-12-07 16:47:30,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338940505] [2019-12-07 16:47:30,137 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:30,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:47:30,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:30,226 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 16:47:30,226 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:30,751 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 16:47:30,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [528608503] [2019-12-07 16:47:30,753 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:30,753 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:30,753 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 16:47:30,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:30,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 13] total 27 [2019-12-07 16:47:30,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214529503] [2019-12-07 16:47:30,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 16:47:30,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:30,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 16:47:30,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-12-07 16:47:30,755 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 27 states. [2019-12-07 16:47:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:30,962 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 16:47:30,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:47:30,963 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-12-07 16:47:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:30,964 INFO L225 Difference]: With dead ends: 30 [2019-12-07 16:47:30,964 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 16:47:30,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 16:47:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 16:47:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 16:47:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 16:47:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-12-07 16:47:30,970 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-12-07 16:47:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:30,970 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-12-07 16:47:30,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 16:47:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-12-07 16:47:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:47:30,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:30,971 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:31,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:31,172 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:31,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-12-07 16:47:31,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:31,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946771455] [2019-12-07 16:47:31,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:31,322 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 16:47:31,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946771455] [2019-12-07 16:47:31,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990158192] [2019-12-07 16:47:31,323 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:31,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 16:47:31,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:47:31,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 16:47:31,356 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:31,436 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 16:47:31,437 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:32,219 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 16:47:32,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [908651600] [2019-12-07 16:47:32,221 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:32,221 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:32,221 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 16:47:32,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:32,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 15] total 31 [2019-12-07 16:47:32,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764896966] [2019-12-07 16:47:32,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 16:47:32,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 16:47:32,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2019-12-07 16:47:32,223 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 31 states. [2019-12-07 16:47:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:32,476 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-12-07 16:47:32,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:47:32,477 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-12-07 16:47:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:32,477 INFO L225 Difference]: With dead ends: 33 [2019-12-07 16:47:32,477 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 16:47:32,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 12 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=355, Invalid=1451, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 16:47:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 16:47:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 16:47:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 16:47:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 16:47:32,482 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-12-07 16:47:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:32,482 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 16:47:32,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 16:47:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-12-07 16:47:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:47:32,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:32,483 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:32,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:32,684 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-12-07 16:47:32,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:32,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896142557] [2019-12-07 16:47:32,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:32,849 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 16:47:32,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896142557] [2019-12-07 16:47:32,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145314287] [2019-12-07 16:47:32,849 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:32,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:47:32,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:47:32,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 16:47:32,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:32,985 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 16:47:32,985 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:34,171 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 16:47:34,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [157266474] [2019-12-07 16:47:34,172 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:34,172 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:34,172 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 16:47:34,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:34,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 17] total 35 [2019-12-07 16:47:34,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394148821] [2019-12-07 16:47:34,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 16:47:34,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:34,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 16:47:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 16:47:34,174 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 35 states. [2019-12-07 16:47:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:34,469 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 16:47:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 16:47:34,470 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-12-07 16:47:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:34,471 INFO L225 Difference]: With dead ends: 36 [2019-12-07 16:47:34,471 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 16:47:34,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=461, Invalid=1891, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 16:47:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 16:47:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 16:47:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 16:47:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 16:47:34,480 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-12-07 16:47:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:34,480 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 16:47:34,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 16:47:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 16:47:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 16:47:34,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:34,482 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:34,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:34,683 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-12-07 16:47:34,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:34,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882881988] [2019-12-07 16:47:34,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:34,858 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 16:47:34,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882881988] [2019-12-07 16:47:34,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176685166] [2019-12-07 16:47:34,858 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:34,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 16:47:34,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:35,027 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 16:47:35,027 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:36,712 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 16:47:36,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1545691109] [2019-12-07 16:47:36,713 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:36,713 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:36,713 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 16:47:36,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:36,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 19] total 39 [2019-12-07 16:47:36,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913381377] [2019-12-07 16:47:36,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 16:47:36,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:36,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 16:47:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1285, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 16:47:36,715 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 39 states. [2019-12-07 16:47:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:37,083 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-12-07 16:47:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 16:47:37,083 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 51 [2019-12-07 16:47:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:37,084 INFO L225 Difference]: With dead ends: 39 [2019-12-07 16:47:37,084 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 16:47:37,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 75 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=581, Invalid=2389, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 16:47:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 16:47:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 16:47:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:47:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-12-07 16:47:37,088 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-12-07 16:47:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:37,089 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-12-07 16:47:37,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 16:47:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-12-07 16:47:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 16:47:37,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:37,090 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:37,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:37,291 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-12-07 16:47:37,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:37,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932652798] [2019-12-07 16:47:37,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:37,501 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 16:47:37,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932652798] [2019-12-07 16:47:37,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982612934] [2019-12-07 16:47:37,502 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:37,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 16:47:37,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:47:37,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 16:47:37,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:37,727 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 16:47:37,727 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:40,379 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 16:47:40,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1617634539] [2019-12-07 16:47:40,380 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:40,380 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:40,380 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 16:47:40,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:40,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 21] total 43 [2019-12-07 16:47:40,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173097446] [2019-12-07 16:47:40,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 16:47:40,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:40,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 16:47:40,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 16:47:40,382 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 43 states. [2019-12-07 16:47:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:40,873 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-12-07 16:47:40,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 16:47:40,873 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 57 [2019-12-07 16:47:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:40,874 INFO L225 Difference]: With dead ends: 42 [2019-12-07 16:47:40,874 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 16:47:40,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 84 SyntacticMatches, 18 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 16:47:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 16:47:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 16:47:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 16:47:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-12-07 16:47:40,879 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-12-07 16:47:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:40,879 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-12-07 16:47:40,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 16:47:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-12-07 16:47:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:47:40,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:40,880 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:41,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:41,081 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:41,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-12-07 16:47:41,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:41,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782378624] [2019-12-07 16:47:41,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:41,325 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 16:47:41,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782378624] [2019-12-07 16:47:41,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299153824] [2019-12-07 16:47:41,325 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:41,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:47:41,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:47:41,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 16:47:41,418 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:41,581 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 16:47:41,581 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:45,039 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 16:47:45,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [554587656] [2019-12-07 16:47:45,041 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:45,041 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:45,041 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 16:47:45,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:45,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 23] total 47 [2019-12-07 16:47:45,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182753332] [2019-12-07 16:47:45,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 16:47:45,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:45,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 16:47:45,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1879, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 16:47:45,043 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 47 states. [2019-12-07 16:47:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:45,631 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-12-07 16:47:45,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 16:47:45,632 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 63 [2019-12-07 16:47:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:45,633 INFO L225 Difference]: With dead ends: 45 [2019-12-07 16:47:45,633 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 16:47:45,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 93 SyntacticMatches, 20 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=863, Invalid=3559, Unknown=0, NotChecked=0, Total=4422 [2019-12-07 16:47:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 16:47:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 16:47:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 16:47:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-12-07 16:47:45,644 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-12-07 16:47:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:45,645 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-12-07 16:47:45,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 16:47:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-12-07 16:47:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 16:47:45,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:45,647 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:45,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:45,848 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-12-07 16:47:45,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:45,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147330425] [2019-12-07 16:47:45,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:46,107 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 16:47:46,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147330425] [2019-12-07 16:47:46,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348709077] [2019-12-07 16:47:46,107 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:46,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 16:47:46,236 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:46,425 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 16:47:46,425 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:51,376 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 16:47:51,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1542258481] [2019-12-07 16:47:51,377 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:51,377 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:51,377 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 16:47:51,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:51,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 25] total 51 [2019-12-07 16:47:51,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096022786] [2019-12-07 16:47:51,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 16:47:51,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:51,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 16:47:51,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2218, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 16:47:51,379 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 51 states. [2019-12-07 16:47:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:52,106 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-12-07 16:47:52,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 16:47:52,107 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2019-12-07 16:47:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:52,109 INFO L225 Difference]: With dead ends: 48 [2019-12-07 16:47:52,109 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 16:47:52,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 102 SyntacticMatches, 22 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1025, Invalid=4231, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 16:47:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 16:47:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 16:47:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 16:47:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-12-07 16:47:52,119 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-12-07 16:47:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:52,120 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-12-07 16:47:52,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 16:47:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-12-07 16:47:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 16:47:52,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:52,122 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:52,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:52,323 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:52,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:52,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-12-07 16:47:52,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:52,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014402997] [2019-12-07 16:47:52,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:52,591 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 16:47:52,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014402997] [2019-12-07 16:47:52,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193621581] [2019-12-07 16:47:52,591 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:52,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-07 16:47:52,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:47:52,754 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 16:47:52,756 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:47:52,967 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 16:47:52,968 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:47:58,479 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 16:47:58,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1324000473] [2019-12-07 16:47:58,480 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:47:58,480 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:47:58,481 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 16:47:58,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:47:58,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16, 27] total 55 [2019-12-07 16:47:58,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477084473] [2019-12-07 16:47:58,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 16:47:58,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:47:58,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 16:47:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=2585, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 16:47:58,483 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 55 states. [2019-12-07 16:47:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:47:59,094 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-12-07 16:47:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 16:47:59,094 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 75 [2019-12-07 16:47:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:47:59,095 INFO L225 Difference]: With dead ends: 51 [2019-12-07 16:47:59,095 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 16:47:59,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 111 SyntacticMatches, 24 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1201, Invalid=4961, Unknown=0, NotChecked=0, Total=6162 [2019-12-07 16:47:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 16:47:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-12-07 16:47:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 16:47:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-12-07 16:47:59,100 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-12-07 16:47:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:47:59,101 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-12-07 16:47:59,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 16:47:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-12-07 16:47:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 16:47:59,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:47:59,101 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:47:59,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:47:59,302 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:47:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:47:59,303 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-12-07 16:47:59,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:47:59,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474318746] [2019-12-07 16:47:59,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:47:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:47:59,658 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 16:47:59,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474318746] [2019-12-07 16:47:59,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245926278] [2019-12-07 16:47:59,659 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:47:59,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:47:59,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:47:59,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 16:47:59,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:48:00,139 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 16:48:00,139 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:48:07,777 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 16:48:07,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [248330154] [2019-12-07 16:48:07,778 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:48:07,778 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:48:07,778 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 16:48:07,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:48:07,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 29] total 59 [2019-12-07 16:48:07,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031051550] [2019-12-07 16:48:07,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-12-07 16:48:07,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:48:07,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-12-07 16:48:07,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=2980, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 16:48:07,781 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 59 states. [2019-12-07 16:48:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:48:09,268 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-12-07 16:48:09,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 16:48:09,269 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 81 [2019-12-07 16:48:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:48:09,269 INFO L225 Difference]: With dead ends: 54 [2019-12-07 16:48:09,269 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 16:48:09,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 120 SyntacticMatches, 26 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1837 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1391, Invalid=5749, Unknown=0, NotChecked=0, Total=7140 [2019-12-07 16:48:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 16:48:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 16:48:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 16:48:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-12-07 16:48:09,275 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-12-07 16:48:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:48:09,275 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-12-07 16:48:09,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-12-07 16:48:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-12-07 16:48:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 16:48:09,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:48:09,276 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:48:09,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:48:09,477 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:48:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:48:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-12-07 16:48:09,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:48:09,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757308231] [2019-12-07 16:48:09,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:48:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:48:09,822 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 16:48:09,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757308231] [2019-12-07 16:48:09,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067122795] [2019-12-07 16:48:09,823 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:48:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:48:10,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 16:48:10,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:48:10,390 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 16:48:10,391 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:48:19,749 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 16:48:19,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1034779718] [2019-12-07 16:48:19,750 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:48:19,750 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:48:19,751 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 16:48:19,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:48:19,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18, 31] total 63 [2019-12-07 16:48:19,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037525707] [2019-12-07 16:48:19,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-12-07 16:48:19,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:48:19,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-12-07 16:48:19,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=3403, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 16:48:19,754 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 63 states. [2019-12-07 16:48:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:48:20,889 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-12-07 16:48:20,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 16:48:20,889 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 87 [2019-12-07 16:48:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:48:20,890 INFO L225 Difference]: With dead ends: 57 [2019-12-07 16:48:20,890 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 16:48:20,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 129 SyntacticMatches, 28 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1595, Invalid=6595, Unknown=0, NotChecked=0, Total=8190 [2019-12-07 16:48:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 16:48:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 16:48:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 16:48:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-12-07 16:48:20,895 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-12-07 16:48:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:48:20,895 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-12-07 16:48:20,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-12-07 16:48:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-12-07 16:48:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 16:48:20,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:48:20,896 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:48:21,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:48:21,097 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:48:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:48:21,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-12-07 16:48:21,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:48:21,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407297970] [2019-12-07 16:48:21,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:48:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:48:21,484 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 16:48:21,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407297970] [2019-12-07 16:48:21,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915271071] [2019-12-07 16:48:21,485 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/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 16:48:21,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-07 16:48:21,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:48:21,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 16:48:21,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:48:22,163 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 16:48:22,163 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:48:23,451 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 16:48:23,577 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 16:48:23,689 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 16:48:23,814 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 16:48:23,937 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 16:48:24,058 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-12-07 16:48:24,179 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 16:48:24,286 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-12-07 16:48:24,388 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-07 16:48:34,993 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 16:48:34,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1711472857] [2019-12-07 16:48:34,994 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:48:34,994 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:48:34,994 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:48:34,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:48:34,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 33] total 66 [2019-12-07 16:48:34,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699892141] [2019-12-07 16:48:34,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-12-07 16:48:34,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:48:34,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-12-07 16:48:34,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=3725, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 16:48:34,996 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 66 states. [2019-12-07 16:48:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:48:35,939 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-12-07 16:48:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 16:48:35,939 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 93 [2019-12-07 16:48:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:48:35,940 INFO L225 Difference]: With dead ends: 60 [2019-12-07 16:48:35,940 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 16:48:35,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 138 SyntacticMatches, 31 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2395 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1810, Invalid=7310, Unknown=0, NotChecked=0, Total=9120 [2019-12-07 16:48:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 16:48:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 16:48:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 16:48:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-12-07 16:48:35,946 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-12-07 16:48:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:48:35,947 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-12-07 16:48:35,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-12-07 16:48:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-12-07 16:48:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:48:35,948 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:48:35,948 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:48:36,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:48:36,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:48:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:48:36,149 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-12-07 16:48:36,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:48:36,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439658507] [2019-12-07 16:48:36,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:48:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:48:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:48:36,215 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:48:36,215 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:48:36,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:48:36 BoogieIcfgContainer [2019-12-07 16:48:36,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:48:36,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:48:36,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:48:36,251 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:48:36,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:47:27" (3/4) ... [2019-12-07 16:48:36,252 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:48:36,295 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3c7fac4d-ab2a-4c0e-931d-df721e8c06cb/bin/utaipan/witness.graphml [2019-12-07 16:48:36,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:48:36,296 INFO L168 Benchmark]: Toolchain (without parser) took 69207.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 147.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:48:36,297 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:48:36,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:48:36,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:48:36,297 INFO L168 Benchmark]: Boogie Preprocessor took 9.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:48:36,297 INFO L168 Benchmark]: RCFGBuilder took 133.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:48:36,298 INFO L168 Benchmark]: TraceAbstraction took 68820.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.0 MB). Peak memory consumption was 181.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:48:36,298 INFO L168 Benchmark]: Witness Printer took 44.73 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:48:36,299 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 133.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68820.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.0 MB). Peak memory consumption was 181.6 MB. Max. memory is 11.5 GB. * Witness Printer took 44.73 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 15; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Result: UNSAFE, OverallTime: 68.7s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 106 SDtfs, 1281 SDslu, 1616 SDs, 0 SdLazy, 3208 SolverSat, 1935 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2145 GetRequests, 1115 SyntacticMatches, 239 SemanticMatches, 791 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13162 ImplicationChecksByTransitivity, 14.0s 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, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 55.9s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 2234 ConstructedInterpolants, 0 QuantifiedInterpolants, 580392 SizeOfPredicates, 133 NumberOfNonLiveVariables, 2296 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 3710/9450 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 incorrect! Received shutdown request...