./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i10_o10-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_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i10_o10-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 d354f5dc1a4e4616bf2c7c7fc4888805a134a8dd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:45:34,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:45:34,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:45:34,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:45:34,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:45:34,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:45:34,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:45:34,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:45:34,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:45:34,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:45:34,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:45:34,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:45:34,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:45:34,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:45:34,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:45:34,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:45:34,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:45:34,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:45:34,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:45:34,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:45:34,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:45:34,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:45:34,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:45:34,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:45:34,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:45:34,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:45:34,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:45:34,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:45:34,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:45:34,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:45:34,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:45:34,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:45:34,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:45:34,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:45:34,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:45:34,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:45:34,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:45:34,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:45:34,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:45:34,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:45:34,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:45:34,404 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:45:34,414 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:45:34,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:45:34,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:45:34,415 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:45:34,415 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:45:34,415 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:45:34,415 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:45:34,415 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:45:34,416 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:45:34,416 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:45:34,416 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:45:34,416 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:45:34,416 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:45:34,416 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:45:34,416 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:45:34,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:45:34,417 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:45:34,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:45:34,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:45:34,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:45:34,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:45:34,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:45:34,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:45:34,418 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:45:34,418 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:45:34,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:45:34,418 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:45:34,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:45:34,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:45:34,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:45:34,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:45:34,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:45:34,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:45:34,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:45:34,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:45:34,419 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:45:34,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:45:34,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:45:34,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:45:34,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:45:34,420 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_8affa116-206a-4696-b552-2eecc2a7170e/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 -> d354f5dc1a4e4616bf2c7c7fc4888805a134a8dd [2019-12-07 10:45:34,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:45:34,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:45:34,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:45:34,528 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:45:34,528 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:45:34,529 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/../../sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2019-12-07 10:45:34,564 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/data/b45955c07/290d833e1dc9469e9070d5aeaa18c9da/FLAGab6b05ac8 [2019-12-07 10:45:34,879 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:45:34,879 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2019-12-07 10:45:34,883 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/data/b45955c07/290d833e1dc9469e9070d5aeaa18c9da/FLAGab6b05ac8 [2019-12-07 10:45:34,891 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/data/b45955c07/290d833e1dc9469e9070d5aeaa18c9da [2019-12-07 10:45:34,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:45:34,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:45:34,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:45:34,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:45:34,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:45:34,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:45:34" (1/1) ... [2019-12-07 10:45:34,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ee8720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:34, skipping insertion in model container [2019-12-07 10:45:34,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:45:34" (1/1) ... [2019-12-07 10:45:34,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:45:34,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:45:35,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:45:35,011 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:45:35,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:45:35,063 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:45:35,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35 WrapperNode [2019-12-07 10:45:35,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:45:35,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:45:35,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:45:35,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:45:35,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... [2019-12-07 10:45:35,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... [2019-12-07 10:45:35,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:45:35,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:45:35,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:45:35,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:45:35,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... [2019-12-07 10:45:35,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... [2019-12-07 10:45:35,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... [2019-12-07 10:45:35,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... [2019-12-07 10:45:35,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... [2019-12-07 10:45:35,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... [2019-12-07 10:45:35,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... [2019-12-07 10:45:35,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:45:35,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:45:35,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:45:35,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:45:35,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:35,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:45:35,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:45:35,135 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-12-07 10:45:35,135 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-12-07 10:45:35,231 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:45:35,231 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 10:45:35,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:45:35 BoogieIcfgContainer [2019-12-07 10:45:35,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:45:35,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:45:35,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:45:35,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:45:35,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:45:34" (1/3) ... [2019-12-07 10:45:35,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626b7045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:45:35, skipping insertion in model container [2019-12-07 10:45:35,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:35" (2/3) ... [2019-12-07 10:45:35,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626b7045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:45:35, skipping insertion in model container [2019-12-07 10:45:35,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:45:35" (3/3) ... [2019-12-07 10:45:35,237 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2019-12-07 10:45:35,243 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:45:35,247 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:45:35,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:45:35,268 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:45:35,268 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:45:35,269 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:45:35,269 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:45:35,269 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:45:35,269 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:45:35,269 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:45:35,269 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:45:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-12-07 10:45:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:45:35,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:35,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:35,283 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:35,287 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-12-07 10:45:35,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:35,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236841508] [2019-12-07 10:45:35,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:35,395 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 10:45:35,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236841508] [2019-12-07 10:45:35,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:45:35,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:45:35,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887472200] [2019-12-07 10:45:35,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:45:35,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:35,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:45:35,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:45:35,410 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 5 states. [2019-12-07 10:45:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:35,454 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-12-07 10:45:35,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:45:35,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 10:45:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:35,461 INFO L225 Difference]: With dead ends: 22 [2019-12-07 10:45:35,461 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 10:45:35,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:45:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 10:45:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 10:45:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 10:45:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-12-07 10:45:35,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-12-07 10:45:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:35,491 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-12-07 10:45:35,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:45:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-12-07 10:45:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:45:35,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:35,492 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:35,492 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:35,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-12-07 10:45:35,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:35,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684014686] [2019-12-07 10:45:35,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:35,533 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 10:45:35,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684014686] [2019-12-07 10:45:35,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789437318] [2019-12-07 10:45:35,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:35,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:45:35,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:35,592 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 10:45:35,592 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:35,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:45:35,706 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 10:45:35,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [785572608] [2019-12-07 10:45:35,724 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:35,724 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:35,729 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 10:45:35,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:35,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-12-07 10:45:35,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062819608] [2019-12-07 10:45:35,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:45:35,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:45:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:45:35,732 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-12-07 10:45:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:35,768 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 10:45:35,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:45:35,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 10:45:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:35,769 INFO L225 Difference]: With dead ends: 21 [2019-12-07 10:45:35,769 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 10:45:35,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:45:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 10:45:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 10:45:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 10:45:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 10:45:35,773 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-12-07 10:45:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:35,773 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 10:45:35,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:45:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 10:45:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:45:35,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:35,774 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:35,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:35,975 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:35,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-12-07 10:45:35,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:35,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172300061] [2019-12-07 10:45:35,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:36,040 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 10:45:36,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172300061] [2019-12-07 10:45:36,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606336764] [2019-12-07 10:45:36,040 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:36,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 10:45:36,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:36,060 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:45:36,061 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:36,068 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 10:45:36,068 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:36,258 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 10:45:36,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1656303529] [2019-12-07 10:45:36,259 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:36,260 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:36,260 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 10:45:36,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:36,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2019-12-07 10:45:36,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836332776] [2019-12-07 10:45:36,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:45:36,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:36,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:45:36,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:45:36,262 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-12-07 10:45:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:36,316 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-12-07 10:45:36,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:45:36,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-07 10:45:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:36,317 INFO L225 Difference]: With dead ends: 24 [2019-12-07 10:45:36,317 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 10:45:36,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:45:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 10:45:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 10:45:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 10:45:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 10:45:36,322 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-12-07 10:45:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:36,323 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 10:45:36,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:45:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 10:45:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:45:36,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:36,324 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:36,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:36,524 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:36,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-12-07 10:45:36,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:36,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430405263] [2019-12-07 10:45:36,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:36,584 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 10:45:36,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430405263] [2019-12-07 10:45:36,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798147159] [2019-12-07 10:45:36,584 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:36,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:45:36,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:36,607 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:45:36,608 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:36,618 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 10:45:36,618 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:36,924 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 10:45:36,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1637013466] [2019-12-07 10:45:36,925 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:36,925 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:36,926 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 10:45:36,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:36,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2019-12-07 10:45:36,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385179206] [2019-12-07 10:45:36,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:45:36,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:45:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:45:36,928 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2019-12-07 10:45:36,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:36,982 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 10:45:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:45:36,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-12-07 10:45:36,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:36,987 INFO L225 Difference]: With dead ends: 27 [2019-12-07 10:45:36,987 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 10:45:36,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:45:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 10:45:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 10:45:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 10:45:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 10:45:36,992 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-12-07 10:45:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:36,993 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 10:45:36,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:45:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 10:45:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:45:36,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:36,994 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:37,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:37,194 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-12-07 10:45:37,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:37,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411134023] [2019-12-07 10:45:37,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:37,266 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 10:45:37,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411134023] [2019-12-07 10:45:37,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463342600] [2019-12-07 10:45:37,267 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:37,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 10:45:37,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:37,298 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 10:45:37,298 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:37,750 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 10:45:37,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [835431130] [2019-12-07 10:45:37,752 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:37,752 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:37,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 10:45:37,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:37,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2019-12-07 10:45:37,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177455757] [2019-12-07 10:45:37,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:45:37,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:37,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:45:37,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:45:37,753 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 15 states. [2019-12-07 10:45:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:37,819 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 10:45:37,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:45:37,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-12-07 10:45:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:37,820 INFO L225 Difference]: With dead ends: 30 [2019-12-07 10:45:37,820 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 10:45:37,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:45:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 10:45:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 10:45:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 10:45:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-12-07 10:45:37,824 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-12-07 10:45:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:37,824 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-12-07 10:45:37,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:45:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-12-07 10:45:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:45:37,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:37,825 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:38,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:38,026 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-12-07 10:45:38,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:38,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929666505] [2019-12-07 10:45:38,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:38,106 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 10:45:38,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929666505] [2019-12-07 10:45:38,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775176895] [2019-12-07 10:45:38,107 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:38,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 10:45:38,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:38,135 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 10:45:38,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:38,145 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 10:45:38,145 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:38,879 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 10:45:38,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2127109531] [2019-12-07 10:45:38,880 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:38,880 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:38,880 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 10:45:38,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:38,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2019-12-07 10:45:38,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024255885] [2019-12-07 10:45:38,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 10:45:38,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:38,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 10:45:38,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:45:38,882 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 17 states. [2019-12-07 10:45:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:38,952 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-12-07 10:45:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:45:38,952 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-12-07 10:45:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:38,953 INFO L225 Difference]: With dead ends: 33 [2019-12-07 10:45:38,953 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 10:45:38,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:45:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 10:45:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 10:45:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 10:45:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 10:45:38,957 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-12-07 10:45:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:38,958 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 10:45:38,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 10:45:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-12-07 10:45:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:45:38,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:38,959 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:39,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:39,160 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:39,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:39,160 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-12-07 10:45:39,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:39,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486063549] [2019-12-07 10:45:39,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:39,240 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 10:45:39,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486063549] [2019-12-07 10:45:39,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862654844] [2019-12-07 10:45:39,240 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:39,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:45:39,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:39,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 10:45:39,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:39,286 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 10:45:39,286 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:40,349 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 10:45:40,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [606871832] [2019-12-07 10:45:40,351 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:40,351 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:40,351 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 10:45:40,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:40,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2019-12-07 10:45:40,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577694745] [2019-12-07 10:45:40,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 10:45:40,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:40,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 10:45:40,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:45:40,352 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 19 states. [2019-12-07 10:45:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:40,428 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 10:45:40,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:45:40,428 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-12-07 10:45:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:40,429 INFO L225 Difference]: With dead ends: 36 [2019-12-07 10:45:40,429 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 10:45:40,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:45:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 10:45:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 10:45:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 10:45:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 10:45:40,433 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-12-07 10:45:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:40,433 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 10:45:40,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 10:45:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 10:45:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:45:40,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:40,435 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:40,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:40,636 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:40,636 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-12-07 10:45:40,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:40,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330349424] [2019-12-07 10:45:40,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:40,732 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 10:45:40,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330349424] [2019-12-07 10:45:40,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933948771] [2019-12-07 10:45:40,732 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:40,783 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 10:45:40,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:40,793 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 10:45:40,793 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:42,374 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 10:45:42,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [702336632] [2019-12-07 10:45:42,376 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:42,376 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:42,376 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 10:45:42,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:42,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2019-12-07 10:45:42,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157950844] [2019-12-07 10:45:42,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 10:45:42,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 10:45:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-12-07 10:45:42,378 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 21 states. [2019-12-07 10:45:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:42,463 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-12-07 10:45:42,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:45:42,463 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2019-12-07 10:45:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:42,464 INFO L225 Difference]: With dead ends: 39 [2019-12-07 10:45:42,464 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 10:45:42,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 84 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:45:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 10:45:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 10:45:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 10:45:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-12-07 10:45:42,468 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-12-07 10:45:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:42,469 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-12-07 10:45:42,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 10:45:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-12-07 10:45:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 10:45:42,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:42,470 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:42,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:42,670 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-12-07 10:45:42,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:42,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816956874] [2019-12-07 10:45:42,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:42,770 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 10:45:42,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816956874] [2019-12-07 10:45:42,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082769520] [2019-12-07 10:45:42,771 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:42,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 10:45:42,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:42,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 10:45:42,837 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:42,847 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 10:45:42,847 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:45,029 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 10:45:45,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2048426212] [2019-12-07 10:45:45,030 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:45,030 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:45,030 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 10:45:45,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:45,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2019-12-07 10:45:45,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725297934] [2019-12-07 10:45:45,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 10:45:45,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:45,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 10:45:45,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:45:45,032 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 23 states. [2019-12-07 10:45:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:45,135 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-12-07 10:45:45,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:45:45,135 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2019-12-07 10:45:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:45,136 INFO L225 Difference]: With dead ends: 42 [2019-12-07 10:45:45,136 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 10:45:45,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2019-12-07 10:45:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 10:45:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 10:45:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 10:45:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-12-07 10:45:45,140 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-12-07 10:45:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:45,140 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-12-07 10:45:45,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 10:45:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-12-07 10:45:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:45:45,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:45,141 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:45,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:45,342 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:45,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-12-07 10:45:45,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:45,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553980304] [2019-12-07 10:45:45,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:45,454 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 10:45:45,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553980304] [2019-12-07 10:45:45,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365272868] [2019-12-07 10:45:45,455 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:45,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:45:45,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:45:45,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 10:45:45,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:45,548 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 10:45:45,549 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:48,597 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 10:45:48,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1126612227] [2019-12-07 10:45:48,599 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:48,599 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:48,599 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java: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 10:45:48,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:48,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 24 [2019-12-07 10:45:48,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840189132] [2019-12-07 10:45:48,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 10:45:48,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 10:45:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:45:48,601 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2019-12-07 10:45:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:48,721 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-12-07 10:45:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:45:48,722 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2019-12-07 10:45:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:48,722 INFO L225 Difference]: With dead ends: 45 [2019-12-07 10:45:48,723 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 10:45:48,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 10:45:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 10:45:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 10:45:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 10:45:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-12-07 10:45:48,727 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-12-07 10:45:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:48,727 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-12-07 10:45:48,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 10:45:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-12-07 10:45:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 10:45:48,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:48,728 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:48,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:48,929 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-12-07 10:45:48,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:48,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096432840] [2019-12-07 10:45:48,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:49,233 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 10:45:49,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096432840] [2019-12-07 10:45:49,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467579731] [2019-12-07 10:45:49,234 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/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 10:45:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:49,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 10:45:49,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:45:49,400 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 10:45:49,401 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:45:49,952 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 10:45:49,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2037943141] [2019-12-07 10:45:49,953 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 10:45:49,953 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:45:49,953 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 10:45:49,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:45:49,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2019-12-07 10:45:49,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347540064] [2019-12-07 10:45:49,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 10:45:49,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 10:45:49,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:45:49,955 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 25 states. [2019-12-07 10:45:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:50,103 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-12-07 10:45:50,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 10:45:50,103 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2019-12-07 10:45:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:50,104 INFO L225 Difference]: With dead ends: 48 [2019-12-07 10:45:50,104 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 10:45:50,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:45:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 10:45:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 10:45:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 10:45:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-12-07 10:45:50,108 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-12-07 10:45:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:50,108 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-12-07 10:45:50,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 10:45:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-12-07 10:45:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 10:45:50,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:45:50,109 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:45:50,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:45:50,310 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:45:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:45:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-12-07 10:45:50,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:45:50,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887114305] [2019-12-07 10:45:50,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:45:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:45:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-07 10:45:50,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887114305] [2019-12-07 10:45:50,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:45:50,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 10:45:50,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146492284] [2019-12-07 10:45:50,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:45:50,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:45:50,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:45:50,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:45:50,434 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-12-07 10:45:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:45:50,534 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-12-07 10:45:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:45:50,535 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-12-07 10:45:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:45:50,535 INFO L225 Difference]: With dead ends: 44 [2019-12-07 10:45:50,535 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:45:50,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-12-07 10:45:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:45:50,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:45:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:45:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:45:50,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-12-07 10:45:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:45:50,537 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:45:50,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:45:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:45:50,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:45:50,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:45:50,552 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:45:50,552 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:45:50,552 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2019-12-07 10:45:50,552 INFO L246 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2019-12-07 10:45:50,553 INFO L246 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2019-12-07 10:45:50,553 INFO L242 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= ULTIMATE.start_main_~input~0 10) (<= 10 ULTIMATE.start_main_~input~0)) [2019-12-07 10:45:50,553 INFO L246 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-12-07 10:45:50,553 INFO L246 CegarLoopResult]: For program point L9(lines 9 15) no Hoare annotation was computed. [2019-12-07 10:45:50,553 INFO L246 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2019-12-07 10:45:50,553 INFO L246 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2019-12-07 10:45:50,553 INFO L249 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2019-12-07 10:45:50,553 INFO L242 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (and (<= |id_#in~x| id_~x) (<= id_~x |id_#in~x|)) [2019-12-07 10:45:50,553 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-12-07 10:45:50,553 INFO L246 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-12-07 10:45:50,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:45:50 BoogieIcfgContainer [2019-12-07 10:45:50,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:45:50,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:45:50,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:45:50,557 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:45:50,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:45:35" (3/4) ... [2019-12-07 10:45:50,560 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:45:50,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-12-07 10:45:50,569 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 10:45:50,569 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:45:50,594 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8affa116-206a-4696-b552-2eecc2a7170e/bin/utaipan/witness.graphml [2019-12-07 10:45:50,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:45:50,595 INFO L168 Benchmark]: Toolchain (without parser) took 15700.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.3 MB). Free memory was 943.5 MB in the beginning and 908.1 MB in the end (delta: 35.4 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:50,595 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:45:50,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:50,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.04 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 10:45:50,596 INFO L168 Benchmark]: Boogie Preprocessor took 10.43 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 10:45:50,597 INFO L168 Benchmark]: RCFGBuilder took 137.11 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:50,597 INFO L168 Benchmark]: TraceAbstraction took 15323.66 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 911.0 MB in the end (delta: 171.6 MB). Peak memory consumption was 320.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:50,597 INFO L168 Benchmark]: Witness Printer took 36.98 ms. Allocated memory is still 1.3 GB. Free memory was 911.0 MB in the beginning and 908.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:45:50,600 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 137.11 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15323.66 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 911.0 MB in the end (delta: 171.6 MB). Peak memory consumption was 320.5 MB. Max. memory is 11.5 GB. * Witness Printer took 36.98 ms. Allocated memory is still 1.3 GB. Free memory was 911.0 MB in the beginning and 908.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Result: SAFE, OverallTime: 15.2s, OverallIterations: 12, TraceHistogramMax: 12, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 150 SDtfs, 545 SDslu, 1068 SDs, 0 SdLazy, 875 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1079 GetRequests, 725 SyntacticMatches, 113 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=11, 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, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 924 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 203528 SizeOfPredicates, 64 NumberOfNonLiveVariables, 916 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 1904/4004 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...