./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25ea15f5ff8abe515b4cb496a6d70ce27fd2ceb9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 08:13:52,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 08:13:52,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 08:13:52,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 08:13:52,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 08:13:52,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 08:13:52,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 08:13:52,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 08:13:52,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 08:13:52,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 08:13:52,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 08:13:52,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 08:13:52,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 08:13:52,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 08:13:52,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 08:13:52,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 08:13:52,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 08:13:52,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 08:13:52,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 08:13:52,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 08:13:52,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 08:13:52,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 08:13:52,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 08:13:52,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 08:13:52,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 08:13:52,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 08:13:52,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 08:13:52,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 08:13:52,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 08:13:52,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 08:13:52,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 08:13:52,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 08:13:52,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 08:13:52,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 08:13:52,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 08:13:52,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 08:13:52,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 08:13:52,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 08:13:52,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 08:13:52,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 08:13:52,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 08:13:52,375 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 08:13:52,392 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 08:13:52,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 08:13:52,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 08:13:52,393 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 08:13:52,393 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 08:13:52,393 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 08:13:52,393 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 08:13:52,394 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 08:13:52,394 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 08:13:52,394 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 08:13:52,394 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 08:13:52,394 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 08:13:52,394 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 08:13:52,394 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 08:13:52,394 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 08:13:52,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 08:13:52,395 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 08:13:52,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 08:13:52,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 08:13:52,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 08:13:52,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 08:13:52,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 08:13:52,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 08:13:52,396 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 08:13:52,396 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 08:13:52,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 08:13:52,396 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 08:13:52,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 08:13:52,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 08:13:52,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 08:13:52,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:13:52,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 08:13:52,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 08:13:52,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 08:13:52,397 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 08:13:52,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 08:13:52,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 08:13:52,397 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 08:13:52,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 08:13:52,398 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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(reach_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 -> 25ea15f5ff8abe515b4cb496a6d70ce27fd2ceb9 [2020-12-09 08:13:52,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 08:13:52,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 08:13:52,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 08:13:52,613 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 08:13:52,613 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 08:13:52,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/../../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2020-12-09 08:13:52,656 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/data/9ccc3b6a1/ffabe15eadea4473aa4c0e7d25e211d6/FLAG03c28cfe8 [2020-12-09 08:13:53,029 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 08:13:53,029 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2020-12-09 08:13:53,035 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/data/9ccc3b6a1/ffabe15eadea4473aa4c0e7d25e211d6/FLAG03c28cfe8 [2020-12-09 08:13:53,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/data/9ccc3b6a1/ffabe15eadea4473aa4c0e7d25e211d6 [2020-12-09 08:13:53,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 08:13:53,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 08:13:53,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 08:13:53,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 08:13:53,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 08:13:53,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53, skipping insertion in model container [2020-12-09 08:13:53,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 08:13:53,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 08:13:53,188 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c[454,467] [2020-12-09 08:13:53,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:13:53,198 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 08:13:53,207 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c[454,467] [2020-12-09 08:13:53,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:13:53,217 INFO L208 MainTranslator]: Completed translation [2020-12-09 08:13:53,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53 WrapperNode [2020-12-09 08:13:53,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 08:13:53,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 08:13:53,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 08:13:53,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 08:13:53,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 08:13:53,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 08:13:53,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 08:13:53,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 08:13:53,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... [2020-12-09 08:13:53,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 08:13:53,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 08:13:53,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 08:13:53,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 08:13:53,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:13:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 08:13:53,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 08:13:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 08:13:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-12-09 08:13:53,319 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-12-09 08:13:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 08:13:53,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 08:13:53,483 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 08:13:53,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:53 BoogieIcfgContainer [2020-12-09 08:13:53,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 08:13:53,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 08:13:53,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 08:13:53,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 08:13:53,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:13:53" (1/3) ... [2020-12-09 08:13:53,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682212d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:13:53, skipping insertion in model container [2020-12-09 08:13:53,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:53" (2/3) ... [2020-12-09 08:13:53,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682212d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:13:53, skipping insertion in model container [2020-12-09 08:13:53,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:53" (3/3) ... [2020-12-09 08:13:53,490 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2020-12-09 08:13:53,500 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 08:13:53,502 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 08:13:53,509 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 08:13:53,525 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 08:13:53,525 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 08:13:53,525 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 08:13:53,525 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 08:13:53,525 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 08:13:53,525 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 08:13:53,525 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 08:13:53,525 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 08:13:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-12-09 08:13:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 08:13:53,538 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:53,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:53,539 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2020-12-09 08:13:53,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:53,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373019929] [2020-12-09 08:13:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:13:53,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373019929] [2020-12-09 08:13:53,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:13:53,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 08:13:53,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646332110] [2020-12-09 08:13:53,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 08:13:53,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:53,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 08:13:53,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:13:53,727 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 5 states. [2020-12-09 08:13:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:53,766 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-12-09 08:13:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:13:53,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 08:13:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:53,776 INFO L225 Difference]: With dead ends: 24 [2020-12-09 08:13:53,776 INFO L226 Difference]: Without dead ends: 14 [2020-12-09 08:13:53,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:13:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-12-09 08:13:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-12-09 08:13:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-12-09 08:13:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-12-09 08:13:53,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2020-12-09 08:13:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:53,814 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-12-09 08:13:53,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 08:13:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-12-09 08:13:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 08:13:53,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:53,816 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:53,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 08:13:53,817 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2020-12-09 08:13:53,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:53,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466787747] [2020-12-09 08:13:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:13:53,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466787747] [2020-12-09 08:13:53,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381665069] [2020-12-09 08:13:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:13:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:53,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 08:13:53,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:13:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 08:13:53,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:13:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 08:13:54,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [259809444] [2020-12-09 08:13:54,136 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:13:54,136 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:13:54,140 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:13:54,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:13:54,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2020-12-09 08:13:54,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985721970] [2020-12-09 08:13:54,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 08:13:54,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 08:13:54,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-09 08:13:54,144 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2020-12-09 08:13:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:54,183 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-12-09 08:13:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 08:13:54,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-12-09 08:13:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:54,184 INFO L225 Difference]: With dead ends: 21 [2020-12-09 08:13:54,184 INFO L226 Difference]: Without dead ends: 17 [2020-12-09 08:13:54,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-12-09 08:13:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-09 08:13:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-09 08:13:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-09 08:13:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-12-09 08:13:54,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2020-12-09 08:13:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:54,190 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-12-09 08:13:54,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 08:13:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-12-09 08:13:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 08:13:54,191 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:54,192 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:54,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 08:13:54,393 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:54,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:54,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2020-12-09 08:13:54,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:54,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762690112] [2020-12-09 08:13:54,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 08:13:54,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762690112] [2020-12-09 08:13:54,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584280434] [2020-12-09 08:13:54,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:13:54,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 08:13:54,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:13:54,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 08:13:54,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:13:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 08:13:54,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:13:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 08:13:54,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2005388573] [2020-12-09 08:13:54,818 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:13:54,818 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:13:54,819 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:13:54,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:13:54,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2020-12-09 08:13:54,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351755985] [2020-12-09 08:13:54,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 08:13:54,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:54,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 08:13:54,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-09 08:13:54,821 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2020-12-09 08:13:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:54,865 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-12-09 08:13:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 08:13:54,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-09 08:13:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:54,867 INFO L225 Difference]: With dead ends: 24 [2020-12-09 08:13:54,867 INFO L226 Difference]: Without dead ends: 20 [2020-12-09 08:13:54,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-09 08:13:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-09 08:13:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-09 08:13:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-09 08:13:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-12-09 08:13:54,872 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2020-12-09 08:13:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:54,872 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-12-09 08:13:54,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 08:13:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-12-09 08:13:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 08:13:54,873 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:54,873 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:55,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:13:55,074 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:55,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2020-12-09 08:13:55,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:55,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029211239] [2020-12-09 08:13:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 08:13:55,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029211239] [2020-12-09 08:13:55,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199372988] [2020-12-09 08:13:55,143 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:13:55,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 08:13:55,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:13:55,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 08:13:55,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:13:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 08:13:55,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:13:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 08:13:55,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224356147] [2020-12-09 08:13:55,519 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:13:55,519 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:13:55,519 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:13:55,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:13:55,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2020-12-09 08:13:55,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535212258] [2020-12-09 08:13:55,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 08:13:55,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:55,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 08:13:55,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-09 08:13:55,521 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2020-12-09 08:13:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:55,581 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-12-09 08:13:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 08:13:55,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-12-09 08:13:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:55,582 INFO L225 Difference]: With dead ends: 27 [2020-12-09 08:13:55,582 INFO L226 Difference]: Without dead ends: 23 [2020-12-09 08:13:55,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-12-09 08:13:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-12-09 08:13:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-12-09 08:13:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-12-09 08:13:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-12-09 08:13:55,586 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2020-12-09 08:13:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:55,586 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-12-09 08:13:55,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 08:13:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-12-09 08:13:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 08:13:55,587 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:55,587 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:55,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:13:55,788 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:55,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2020-12-09 08:13:55,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:55,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277066720] [2020-12-09 08:13:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-09 08:13:55,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277066720] [2020-12-09 08:13:55,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435829847] [2020-12-09 08:13:55,848 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:13:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:55,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 08:13:55,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:13:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-09 08:13:55,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:13:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 08:13:56,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1093721292] [2020-12-09 08:13:56,390 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:13:56,390 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:13:56,390 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:13:56,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:13:56,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2020-12-09 08:13:56,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517263364] [2020-12-09 08:13:56,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 08:13:56,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:56,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 08:13:56,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-12-09 08:13:56,392 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 15 states. [2020-12-09 08:13:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:56,474 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-12-09 08:13:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 08:13:56,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2020-12-09 08:13:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:56,476 INFO L225 Difference]: With dead ends: 30 [2020-12-09 08:13:56,476 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 08:13:56,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-12-09 08:13:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 08:13:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-09 08:13:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 08:13:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-12-09 08:13:56,480 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2020-12-09 08:13:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:56,480 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-12-09 08:13:56,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 08:13:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-12-09 08:13:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 08:13:56,481 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:56,481 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:56,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:13:56,682 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:56,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:56,682 INFO L82 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2020-12-09 08:13:56,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:56,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893766215] [2020-12-09 08:13:56,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-12-09 08:13:56,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893766215] [2020-12-09 08:13:56,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313177293] [2020-12-09 08:13:56,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:13:56,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-09 08:13:56,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:13:56,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 08:13:56,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:13:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-12-09 08:13:56,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:13:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-09 08:13:57,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1019958789] [2020-12-09 08:13:57,542 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:13:57,543 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:13:57,543 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:13:57,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:13:57,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2020-12-09 08:13:57,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351051343] [2020-12-09 08:13:57,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 08:13:57,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:57,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 08:13:57,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-12-09 08:13:57,544 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 17 states. [2020-12-09 08:13:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:57,610 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-12-09 08:13:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 08:13:57,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2020-12-09 08:13:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:57,611 INFO L225 Difference]: With dead ends: 33 [2020-12-09 08:13:57,611 INFO L226 Difference]: Without dead ends: 29 [2020-12-09 08:13:57,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-12-09 08:13:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-12-09 08:13:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-12-09 08:13:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 08:13:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-12-09 08:13:57,615 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2020-12-09 08:13:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:57,616 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-12-09 08:13:57,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 08:13:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-12-09 08:13:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 08:13:57,617 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:57,617 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:57,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-09 08:13:57,818 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2020-12-09 08:13:57,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:57,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122020462] [2020-12-09 08:13:57,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-09 08:13:57,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122020462] [2020-12-09 08:13:57,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403402502] [2020-12-09 08:13:57,921 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:13:57,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 08:13:57,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:13:57,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 08:13:57,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:13:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-12-09 08:13:58,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:13:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-09 08:13:58,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1200946389] [2020-12-09 08:13:58,999 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:13:58,999 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:13:59,000 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:13:59,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:13:59,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2020-12-09 08:13:59,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630649167] [2020-12-09 08:13:59,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 08:13:59,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:13:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 08:13:59,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-12-09 08:13:59,001 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 19 states. [2020-12-09 08:13:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:13:59,085 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-12-09 08:13:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 08:13:59,085 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-12-09 08:13:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:13:59,086 INFO L225 Difference]: With dead ends: 36 [2020-12-09 08:13:59,086 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 08:13:59,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-12-09 08:13:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 08:13:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-12-09 08:13:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 08:13:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-12-09 08:13:59,091 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2020-12-09 08:13:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:13:59,091 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-12-09 08:13:59,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 08:13:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-12-09 08:13:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-09 08:13:59,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:13:59,092 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:13:59,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:13:59,294 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:13:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:13:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2020-12-09 08:13:59,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:13:59,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460694608] [2020-12-09 08:13:59,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:13:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-09 08:13:59,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460694608] [2020-12-09 08:13:59,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563139080] [2020-12-09 08:13:59,407 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:13:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:13:59,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 08:13:59,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:13:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-09 08:13:59,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:14:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-09 08:14:00,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1802815535] [2020-12-09 08:14:00,862 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:14:00,862 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:14:00,862 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:14:00,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:14:00,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2020-12-09 08:14:00,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303504069] [2020-12-09 08:14:00,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 08:14:00,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:14:00,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 08:14:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-12-09 08:14:00,864 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 21 states. [2020-12-09 08:14:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:14:00,949 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-12-09 08:14:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 08:14:00,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2020-12-09 08:14:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:14:00,950 INFO L225 Difference]: With dead ends: 39 [2020-12-09 08:14:00,950 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 08:14:00,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-12-09 08:14:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 08:14:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-09 08:14:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 08:14:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-12-09 08:14:00,955 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2020-12-09 08:14:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:14:00,955 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-12-09 08:14:00,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 08:14:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-12-09 08:14:00,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 08:14:00,956 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:14:00,956 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:14:01,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:14:01,157 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:14:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:14:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2020-12-09 08:14:01,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:14:01,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462014683] [2020-12-09 08:14:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:14:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:14:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-09 08:14:01,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462014683] [2020-12-09 08:14:01,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212098804] [2020-12-09 08:14:01,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:14:01,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2020-12-09 08:14:01,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:14:01,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 08:14:01,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:14:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-09 08:14:01,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:14:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-12-09 08:14:03,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [651335391] [2020-12-09 08:14:03,517 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:14:03,517 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:14:03,518 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:14:03,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:14:03,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2020-12-09 08:14:03,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70377101] [2020-12-09 08:14:03,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 51 states [2020-12-09 08:14:03,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:14:03,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2020-12-09 08:14:03,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2020-12-09 08:14:03,521 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 51 states. [2020-12-09 08:14:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:14:04,163 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2020-12-09 08:14:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-09 08:14:04,163 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 57 [2020-12-09 08:14:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:14:04,164 INFO L225 Difference]: With dead ends: 68 [2020-12-09 08:14:04,164 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 08:14:04,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2020-12-09 08:14:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 08:14:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-12-09 08:14:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-09 08:14:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-12-09 08:14:04,172 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 57 [2020-12-09 08:14:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:14:04,173 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-12-09 08:14:04,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2020-12-09 08:14:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-12-09 08:14:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-09 08:14:04,174 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:14:04,174 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:14:04,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-09 08:14:04,376 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:14:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:14:04,377 INFO L82 PathProgramCache]: Analyzing trace with hash -543729842, now seen corresponding path program 9 times [2020-12-09 08:14:04,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:14:04,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216847784] [2020-12-09 08:14:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:14:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:14:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-12-09 08:14:04,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216847784] [2020-12-09 08:14:04,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989531382] [2020-12-09 08:14:04,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:14:04,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 08:14:04,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:14:04,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 38 conjunts are in the unsatisfiable core [2020-12-09 08:14:04,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:14:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-12-09 08:14:04,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:14:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-12-09 08:14:19,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1025038765] [2020-12-09 08:14:19,955 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:14:19,955 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:14:19,955 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:14:19,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:14:19,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2020-12-09 08:14:19,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771871266] [2020-12-09 08:14:19,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-12-09 08:14:19,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:14:19,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-12-09 08:14:19,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2020-12-09 08:14:19,957 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 41 states. [2020-12-09 08:14:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:14:20,339 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-12-09 08:14:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 08:14:20,339 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 111 [2020-12-09 08:14:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:14:20,341 INFO L225 Difference]: With dead ends: 69 [2020-12-09 08:14:20,341 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 08:14:20,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2020-12-09 08:14:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 08:14:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-12-09 08:14:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-09 08:14:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-12-09 08:14:20,347 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2020-12-09 08:14:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:14:20,347 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-12-09 08:14:20,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-12-09 08:14:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-12-09 08:14:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-09 08:14:20,349 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:14:20,349 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:14:20,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:14:20,550 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:14:20,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:14:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1011974276, now seen corresponding path program 10 times [2020-12-09 08:14:20,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:14:20,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876518865] [2020-12-09 08:14:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:14:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:14:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-12-09 08:14:20,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876518865] [2020-12-09 08:14:20,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040132739] [2020-12-09 08:14:20,830 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/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 [2020-12-09 08:14:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:14:21,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-09 08:14:21,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:14:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-12-09 08:14:21,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:14:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-12-09 08:14:42,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1832915638] [2020-12-09 08:14:42,139 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:14:42,139 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:14:42,139 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:14:42,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:14:42,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2020-12-09 08:14:42,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990598769] [2020-12-09 08:14:42,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-12-09 08:14:42,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:14:42,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-12-09 08:14:42,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2020-12-09 08:14:42,141 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 43 states. [2020-12-09 08:14:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:14:42,603 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2020-12-09 08:14:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-09 08:14:42,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 117 [2020-12-09 08:14:42,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:14:42,605 INFO L225 Difference]: With dead ends: 72 [2020-12-09 08:14:42,605 INFO L226 Difference]: Without dead ends: 68 [2020-12-09 08:14:42,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2020-12-09 08:14:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-09 08:14:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-09 08:14:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 08:14:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-12-09 08:14:42,611 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2020-12-09 08:14:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:14:42,612 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-12-09 08:14:42,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-12-09 08:14:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-12-09 08:14:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-09 08:14:42,613 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:14:42,613 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:14:42,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:14:42,814 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:14:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:14:42,816 INFO L82 PathProgramCache]: Analyzing trace with hash 486282894, now seen corresponding path program 11 times [2020-12-09 08:14:42,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:14:42,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388341995] [2020-12-09 08:14:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:14:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:14:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-12-09 08:14:43,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388341995] [2020-12-09 08:14:43,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476204514] [2020-12-09 08:14:43,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 08:14:43,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2020-12-09 08:14:43,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 08:14:43,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-09 08:14:43,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:14:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-12-09 08:14:44,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:14:48,201 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-09 08:14:48,505 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-09 08:14:48,608 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-09 08:14:51,592 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-12-09 08:14:51,897 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-09 08:15:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-12-09 08:15:11,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1892781294] [2020-12-09 08:15:11,064 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 08:15:11,064 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:15:11,065 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:15:11,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 08:15:11,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 43, 43] total 65 [2020-12-09 08:15:11,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782938570] [2020-12-09 08:15:11,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 65 states [2020-12-09 08:15:11,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:15:11,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2020-12-09 08:15:11,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=3482, Unknown=0, NotChecked=0, Total=4160 [2020-12-09 08:15:11,067 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 65 states. [2020-12-09 08:15:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:15:12,725 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2020-12-09 08:15:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-12-09 08:15:12,726 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 123 [2020-12-09 08:15:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:15:12,727 INFO L225 Difference]: With dead ends: 75 [2020-12-09 08:15:12,727 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 08:15:12,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1992 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1956, Invalid=8756, Unknown=0, NotChecked=0, Total=10712 [2020-12-09 08:15:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 08:15:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-09 08:15:12,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 08:15:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2020-12-09 08:15:12,735 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2020-12-09 08:15:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:15:12,736 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2020-12-09 08:15:12,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2020-12-09 08:15:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2020-12-09 08:15:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-09 08:15:12,737 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:15:12,737 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:15:12,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-09 08:15:12,938 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:15:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:15:12,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1510268740, now seen corresponding path program 12 times [2020-12-09 08:15:12,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:15:12,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403081413] [2020-12-09 08:15:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:15:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 08:15:12,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 08:15:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 08:15:13,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 08:15:13,044 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 08:15:13,045 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 08:15:13,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 08:15:13,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:15:13 BoogieIcfgContainer [2020-12-09 08:15:13,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 08:15:13,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 08:15:13,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 08:15:13,094 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 08:15:13,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:53" (3/4) ... [2020-12-09 08:15:13,096 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 08:15:13,133 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bddd77d1-a917-4169-bbc6-ca25aca0dbd9/bin/utaipan/witness.graphml [2020-12-09 08:15:13,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 08:15:13,134 INFO L168 Benchmark]: Toolchain (without parser) took 80086.08 ms. Allocated memory was 90.2 MB in the beginning and 232.8 MB in the end (delta: 142.6 MB). Free memory was 51.0 MB in the beginning and 139.9 MB in the end (delta: -88.9 MB). Peak memory consumption was 53.7 MB. Max. memory is 16.1 GB. [2020-12-09 08:15:13,134 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 90.2 MB. Free memory is still 67.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 08:15:13,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.04 ms. Allocated memory is still 90.2 MB. Free memory was 50.8 MB in the beginning and 68.2 MB in the end (delta: -17.4 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. [2020-12-09 08:15:13,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.96 ms. Allocated memory is still 90.2 MB. Free memory was 68.2 MB in the beginning and 66.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 08:15:13,135 INFO L168 Benchmark]: Boogie Preprocessor took 12.69 ms. Allocated memory is still 90.2 MB. Free memory was 66.9 MB in the beginning and 66.0 MB in the end (delta: 871.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 08:15:13,135 INFO L168 Benchmark]: RCFGBuilder took 231.03 ms. Allocated memory is still 90.2 MB. Free memory was 66.0 MB in the beginning and 53.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 08:15:13,136 INFO L168 Benchmark]: TraceAbstraction took 79608.07 ms. Allocated memory was 90.2 MB in the beginning and 232.8 MB in the end (delta: 142.6 MB). Free memory was 53.4 MB in the beginning and 146.2 MB in the end (delta: -92.8 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. [2020-12-09 08:15:13,136 INFO L168 Benchmark]: Witness Printer took 39.49 ms. Allocated memory is still 232.8 MB. Free memory was 145.2 MB in the beginning and 139.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 08:15:13,137 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 90.2 MB. Free memory is still 67.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 168.04 ms. Allocated memory is still 90.2 MB. Free memory was 50.8 MB in the beginning and 68.2 MB in the end (delta: -17.4 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 21.96 ms. Allocated memory is still 90.2 MB. Free memory was 68.2 MB in the beginning and 66.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 12.69 ms. Allocated memory is still 90.2 MB. Free memory was 66.9 MB in the beginning and 66.0 MB in the end (delta: 871.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 231.03 ms. Allocated memory is still 90.2 MB. Free memory was 66.0 MB in the beginning and 53.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 79608.07 ms. Allocated memory was 90.2 MB in the beginning and 232.8 MB in the end (delta: 142.6 MB). Free memory was 53.4 MB in the beginning and 146.2 MB in the end (delta: -92.8 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. * Witness Printer took 39.49 ms. Allocated memory is still 232.8 MB. Free memory was 145.2 MB in the beginning and 139.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 20; [L13] CALL, EXPR id(input) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) [L13] int result = id(input); [L14] COND TRUE result == 20 [L15] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 79.5s, OverallIterations: 13, TraceHistogramMax: 21, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 109 SDtfs, 1411 SDslu, 958 SDs, 0 SdLazy, 1045 SolverSat, 646 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1642 GetRequests, 1209 SyntacticMatches, 1 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4919 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=12, 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: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 71.1s InterpolantComputationTime, 1416 NumberOfCodeBlocks, 1416 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1892 ConstructedInterpolants, 0 QuantifiedInterpolants, 423944 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1843 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 34 InterpolantComputations, 1 PerfectInterpolantSequences, 4683/10872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...