./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i25_o25-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i25_o25-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 980109aaf5797fcdc56688cd1127831babfd66a2 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:26:30,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:26:30,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:26:30,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:26:30,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:26:30,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:26:30,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:26:30,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:26:30,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:26:30,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:26:30,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:26:30,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:26:30,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:26:30,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:26:30,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:26:30,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:26:30,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:26:30,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:26:30,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:26:30,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:26:30,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:26:30,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:26:30,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:26:30,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:26:30,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:26:30,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:26:30,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:26:30,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:26:30,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:26:30,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:26:30,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:26:30,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:26:30,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:26:30,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:26:30,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:26:30,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:26:30,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:26:30,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:26:30,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:26:30,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:26:30,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:26:30,208 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:26:30,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:26:30,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:26:30,218 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:26:30,219 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:26:30,219 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:26:30,219 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:26:30,219 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:26:30,219 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:26:30,219 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:26:30,219 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:26:30,219 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:26:30,220 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:26:30,220 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:26:30,220 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:26:30,220 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:26:30,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:26:30,221 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:26:30,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:26:30,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:26:30,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:26:30,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:26:30,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:26:30,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:26:30,221 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:26:30,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:26:30,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:26:30,222 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:26:30,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:26:30,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:26:30,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:26:30,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:26:30,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:26:30,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:26:30,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:26:30,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:26:30,223 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:26:30,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:26:30,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:26:30,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:26:30,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:26:30,223 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 980109aaf5797fcdc56688cd1127831babfd66a2 [2019-12-07 14:26:30,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:26:30,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:26:30,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:26:30,335 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:26:30,336 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:26:30,336 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/../../sv-benchmarks/c/recursive-simple/id_i25_o25-1.c [2019-12-07 14:26:30,383 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/data/f1359e953/646e42509df9427692c41f56de3fb9eb/FLAGae6186dd3 [2019-12-07 14:26:30,696 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:26:30,697 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/sv-benchmarks/c/recursive-simple/id_i25_o25-1.c [2019-12-07 14:26:30,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/data/f1359e953/646e42509df9427692c41f56de3fb9eb/FLAGae6186dd3 [2019-12-07 14:26:30,709 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/data/f1359e953/646e42509df9427692c41f56de3fb9eb [2019-12-07 14:26:30,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:26:30,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:26:30,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:26:30,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:26:30,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:26:30,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605e252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30, skipping insertion in model container [2019-12-07 14:26:30,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:26:30,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:26:30,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:26:30,828 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:26:30,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:26:30,884 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:26:30,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30 WrapperNode [2019-12-07 14:26:30,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:26:30,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:26:30,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:26:30,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:26:30,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:26:30,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:26:30,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:26:30,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:26:30,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... [2019-12-07 14:26:30,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:26:30,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:26:30,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:26:30,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:26:30,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:26:30,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:26:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:26:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-12-07 14:26:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-12-07 14:26:31,059 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:26:31,060 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 14:26:31,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:26:31 BoogieIcfgContainer [2019-12-07 14:26:31,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:26:31,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:26:31,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:26:31,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:26:31,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:26:30" (1/3) ... [2019-12-07 14:26:31,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380b82aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:26:31, skipping insertion in model container [2019-12-07 14:26:31,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:26:30" (2/3) ... [2019-12-07 14:26:31,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380b82aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:26:31, skipping insertion in model container [2019-12-07 14:26:31,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:26:31" (3/3) ... [2019-12-07 14:26:31,065 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i25_o25-1.c [2019-12-07 14:26:31,071 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:26:31,075 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:26:31,082 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:26:31,096 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:26:31,096 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:26:31,096 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:26:31,096 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:26:31,096 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:26:31,096 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:26:31,096 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:26:31,096 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:26:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-12-07 14:26:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:26:31,110 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:31,110 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:31,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:31,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:31,114 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-12-07 14:26:31,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:31,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709484497] [2019-12-07 14:26:31,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:26:31,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709484497] [2019-12-07 14:26:31,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:31,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:26:31,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236996473] [2019-12-07 14:26:31,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:26:31,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:31,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:26:31,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:26:31,236 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 5 states. [2019-12-07 14:26:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:31,283 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-12-07 14:26:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:26:31,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 14:26:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:31,291 INFO L225 Difference]: With dead ends: 22 [2019-12-07 14:26:31,291 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 14:26:31,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:26:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 14:26:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 14:26:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 14:26:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-12-07 14:26:31,320 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-12-07 14:26:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:31,321 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-12-07 14:26:31,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:26:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-12-07 14:26:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:26:31,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:31,322 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:31,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:31,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:31,322 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-12-07 14:26:31,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:31,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234070483] [2019-12-07 14:26:31,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:26:31,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234070483] [2019-12-07 14:26:31,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037007613] [2019-12-07 14:26:31,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:31,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:26:31,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:26:31,418 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:31,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:26:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:26:31,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [207412927] [2019-12-07 14:26:31,541 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:31,541 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:31,546 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:31,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:31,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-12-07 14:26:31,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077924603] [2019-12-07 14:26:31,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:26:31,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:31,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:26:31,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:26:31,549 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-12-07 14:26:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:31,584 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 14:26:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:26:31,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 14:26:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:31,585 INFO L225 Difference]: With dead ends: 21 [2019-12-07 14:26:31,586 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 14:26:31,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:26:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 14:26:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 14:26:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 14:26:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 14:26:31,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-12-07 14:26:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:31,590 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 14:26:31,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:26:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 14:26:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:26:31,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:31,591 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:31,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:31,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:31,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:31,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-12-07 14:26:31,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:31,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388851797] [2019-12-07 14:26:31,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:26:31,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388851797] [2019-12-07 14:26:31,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99804257] [2019-12-07 14:26:31,884 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:31,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 14:26:31,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:26:31,922 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:26:31,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:26:31,935 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:26:32,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [406095733] [2019-12-07 14:26:32,118 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:32,118 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:32,118 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:32,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:32,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2019-12-07 14:26:32,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283889839] [2019-12-07 14:26:32,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:26:32,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:26:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:26:32,120 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-12-07 14:26:32,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:32,166 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-12-07 14:26:32,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:26:32,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-07 14:26:32,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:32,167 INFO L225 Difference]: With dead ends: 24 [2019-12-07 14:26:32,167 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 14:26:32,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:26:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 14:26:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 14:26:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 14:26:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 14:26:32,171 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-12-07 14:26:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:32,171 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 14:26:32,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:26:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 14:26:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:26:32,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:32,172 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:32,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:32,373 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:32,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:32,373 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-12-07 14:26:32,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:32,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131207544] [2019-12-07 14:26:32,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 14:26:32,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131207544] [2019-12-07 14:26:32,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309813870] [2019-12-07 14:26:32,480 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:32,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:26:32,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:26:32,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:26:32,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 14:26:32,521 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 14:26:32,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [666999871] [2019-12-07 14:26:32,839 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:32,839 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:32,839 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:32,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:32,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2019-12-07 14:26:32,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849922901] [2019-12-07 14:26:32,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:26:32,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:32,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:26:32,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:26:32,841 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2019-12-07 14:26:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:32,900 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 14:26:32,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:26:32,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-12-07 14:26:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:32,901 INFO L225 Difference]: With dead ends: 27 [2019-12-07 14:26:32,901 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 14:26:32,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:26:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 14:26:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 14:26:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 14:26:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 14:26:32,905 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-12-07 14:26:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:32,905 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 14:26:32,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:26:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 14:26:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:26:32,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:32,906 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:33,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:33,107 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-12-07 14:26:33,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:33,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747872465] [2019-12-07 14:26:33,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 14:26:33,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747872465] [2019-12-07 14:26:33,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771701280] [2019-12-07 14:26:33,181 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:33,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:26:33,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 14:26:33,214 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:26:33,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1380306696] [2019-12-07 14:26:33,665 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:33,665 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:33,665 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:33,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:33,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2019-12-07 14:26:33,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795404369] [2019-12-07 14:26:33,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 14:26:33,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:33,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 14:26:33,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:26:33,667 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 15 states. [2019-12-07 14:26:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:33,729 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 14:26:33,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:26:33,729 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-12-07 14:26:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:33,730 INFO L225 Difference]: With dead ends: 30 [2019-12-07 14:26:33,730 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 14:26:33,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:26:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 14:26:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 14:26:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 14:26:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-12-07 14:26:33,735 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-12-07 14:26:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:33,736 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-12-07 14:26:33,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 14:26:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-12-07 14:26:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:26:33,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:33,737 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:33,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:33,938 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:33,939 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-12-07 14:26:33,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:33,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890133323] [2019-12-07 14:26:33,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 14:26:34,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890133323] [2019-12-07 14:26:34,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600960390] [2019-12-07 14:26:34,009 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:34,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 14:26:34,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:26:34,040 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:26:34,042 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 14:26:34,054 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 14:26:34,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1585057568] [2019-12-07 14:26:34,786 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:34,786 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:34,787 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:34,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:34,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2019-12-07 14:26:34,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466990315] [2019-12-07 14:26:34,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 14:26:34,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:34,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 14:26:34,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:26:34,788 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 17 states. [2019-12-07 14:26:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:34,858 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-12-07 14:26:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:26:34,858 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-12-07 14:26:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:34,859 INFO L225 Difference]: With dead ends: 33 [2019-12-07 14:26:34,859 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 14:26:34,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:26:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 14:26:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 14:26:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 14:26:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 14:26:34,865 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-12-07 14:26:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:34,866 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 14:26:34,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 14:26:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-12-07 14:26:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:26:34,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:34,867 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:35,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:35,068 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-12-07 14:26:35,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:35,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228235091] [2019-12-07 14:26:35,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 14:26:35,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228235091] [2019-12-07 14:26:35,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457114658] [2019-12-07 14:26:35,164 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:35,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:26:35,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:26:35,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 14:26:35,203 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 14:26:35,211 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:26:36,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1921329305] [2019-12-07 14:26:36,281 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:36,281 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:36,281 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:36,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:36,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2019-12-07 14:26:36,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000591611] [2019-12-07 14:26:36,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:26:36,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:26:36,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:26:36,283 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 19 states. [2019-12-07 14:26:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:36,359 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 14:26:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:26:36,359 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-12-07 14:26:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:36,360 INFO L225 Difference]: With dead ends: 36 [2019-12-07 14:26:36,360 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 14:26:36,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-12-07 14:26:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 14:26:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 14:26:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 14:26:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 14:26:36,366 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-12-07 14:26:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:36,366 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 14:26:36,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 14:26:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 14:26:36,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:26:36,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:36,368 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:36,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:36,569 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:36,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:36,569 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-12-07 14:26:36,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:36,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051141701] [2019-12-07 14:26:36,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 14:26:36,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051141701] [2019-12-07 14:26:36,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321273894] [2019-12-07 14:26:36,664 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:36,710 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 14:26:36,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 14:26:36,720 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 14:26:38,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1013723121] [2019-12-07 14:26:38,408 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:38,408 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:38,409 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:38,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:38,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2019-12-07 14:26:38,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58529803] [2019-12-07 14:26:38,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 14:26:38,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:38,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 14:26:38,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:26:38,410 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 21 states. [2019-12-07 14:26:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:38,494 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-12-07 14:26:38,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:26:38,494 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2019-12-07 14:26:38,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:38,495 INFO L225 Difference]: With dead ends: 39 [2019-12-07 14:26:38,495 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 14:26:38,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 84 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-12-07 14:26:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 14:26:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 14:26:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 14:26:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-12-07 14:26:38,499 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-12-07 14:26:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:38,499 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-12-07 14:26:38,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 14:26:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-12-07 14:26:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 14:26:38,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:38,500 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:38,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:38,701 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:38,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:38,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-12-07 14:26:38,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:38,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30426667] [2019-12-07 14:26:38,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 14:26:38,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30426667] [2019-12-07 14:26:38,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396148209] [2019-12-07 14:26:38,795 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:38,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 14:26:38,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:26:38,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 14:26:38,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 14:26:38,872 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 14:26:41,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1943065293] [2019-12-07 14:26:41,100 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:41,100 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:41,100 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:41,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:41,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2019-12-07 14:26:41,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798396666] [2019-12-07 14:26:41,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 14:26:41,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:41,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 14:26:41,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:26:41,102 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 23 states. [2019-12-07 14:26:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:41,214 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-12-07 14:26:41,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:26:41,214 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2019-12-07 14:26:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:41,215 INFO L225 Difference]: With dead ends: 42 [2019-12-07 14:26:41,215 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 14:26:41,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2019-12-07 14:26:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 14:26:41,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 14:26:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 14:26:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-12-07 14:26:41,220 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-12-07 14:26:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:41,220 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-12-07 14:26:41,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 14:26:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-12-07 14:26:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:26:41,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:41,221 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:41,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:41,422 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:41,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:41,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-12-07 14:26:41,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:41,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699975953] [2019-12-07 14:26:41,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 14:26:41,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699975953] [2019-12-07 14:26:41,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2614988] [2019-12-07 14:26:41,551 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:41,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:26:41,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:26:41,637 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 14:26:41,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 14:26:41,652 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 14:26:44,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009732051] [2019-12-07 14:26:44,640 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:44,641 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:44,641 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:44,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:44,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2019-12-07 14:26:44,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246257980] [2019-12-07 14:26:44,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 14:26:44,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 14:26:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-12-07 14:26:44,642 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 25 states. [2019-12-07 14:26:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:44,768 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-12-07 14:26:44,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:26:44,769 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2019-12-07 14:26:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:44,770 INFO L225 Difference]: With dead ends: 45 [2019-12-07 14:26:44,770 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 14:26:44,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 14:26:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 14:26:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 14:26:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 14:26:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-12-07 14:26:44,774 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-12-07 14:26:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:44,775 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-12-07 14:26:44,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 14:26:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-12-07 14:26:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:26:44,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:44,776 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:44,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:44,976 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:44,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:44,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-12-07 14:26:44,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:44,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090336543] [2019-12-07 14:26:44,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 14:26:45,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090336543] [2019-12-07 14:26:45,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004130686] [2019-12-07 14:26:45,081 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:45,205 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 14:26:45,206 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 14:26:45,216 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 14:26:50,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1575236084] [2019-12-07 14:26:50,822 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:50,822 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:50,823 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:50,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:50,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2019-12-07 14:26:50,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276113450] [2019-12-07 14:26:50,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 14:26:50,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:50,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 14:26:50,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:26:50,825 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 27 states. [2019-12-07 14:26:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:50,970 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-12-07 14:26:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 14:26:50,971 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2019-12-07 14:26:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:50,972 INFO L225 Difference]: With dead ends: 48 [2019-12-07 14:26:50,972 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 14:26:50,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 114 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 14:26:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 14:26:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 14:26:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 14:26:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-12-07 14:26:50,978 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-12-07 14:26:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:50,978 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-12-07 14:26:50,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 14:26:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-12-07 14:26:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:26:50,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:50,979 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:51,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:51,180 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:51,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:51,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-12-07 14:26:51,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:51,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186888034] [2019-12-07 14:26:51,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-07 14:26:51,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186888034] [2019-12-07 14:26:51,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063851778] [2019-12-07 14:26:51,315 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:51,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-07 14:26:51,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:26:51,486 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 14:26:51,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-07 14:26:51,498 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:26:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 14:26:57,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2044305635] [2019-12-07 14:26:57,189 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:26:57,189 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:26:57,190 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:26:57,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:26:57,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2019-12-07 14:26:57,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061583938] [2019-12-07 14:26:57,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 14:26:57,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:26:57,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 14:26:57,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-12-07 14:26:57,191 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 29 states. [2019-12-07 14:26:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:57,342 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-12-07 14:26:57,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:26:57,343 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2019-12-07 14:26:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:57,343 INFO L225 Difference]: With dead ends: 51 [2019-12-07 14:26:57,343 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 14:26:57,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 14:26:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 14:26:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-12-07 14:26:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 14:26:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-12-07 14:26:57,348 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-12-07 14:26:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:57,348 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-12-07 14:26:57,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 14:26:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-12-07 14:26:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 14:26:57,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:57,349 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:57,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:57,550 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:57,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-12-07 14:26:57,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:26:57,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452287542] [2019-12-07 14:26:57,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-12-07 14:26:57,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452287542] [2019-12-07 14:26:57,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454620042] [2019-12-07 14:26:57,678 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:26:57,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:26:57,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:26:57,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 14:26:57,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:26:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-12-07 14:26:57,895 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:27:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-07 14:27:05,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1297517740] [2019-12-07 14:27:05,876 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:27:05,876 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:27:05,876 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:27:05,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:27:05,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2019-12-07 14:27:05,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156706909] [2019-12-07 14:27:05,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 14:27:05,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:05,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 14:27:05,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2019-12-07 14:27:05,879 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 31 states. [2019-12-07 14:27:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:06,074 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-12-07 14:27:06,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:27:06,074 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2019-12-07 14:27:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:06,075 INFO L225 Difference]: With dead ends: 54 [2019-12-07 14:27:06,075 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 14:27:06,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 134 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 14:27:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 14:27:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 14:27:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 14:27:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-12-07 14:27:06,079 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-12-07 14:27:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:06,079 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-12-07 14:27:06,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 14:27:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-12-07 14:27:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 14:27:06,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:06,080 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:27:06,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:06,281 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:06,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-12-07 14:27:06,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:06,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702859537] [2019-12-07 14:27:06,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-12-07 14:27:06,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702859537] [2019-12-07 14:27:06,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425426655] [2019-12-07 14:27:06,457 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:06,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 14:27:06,745 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:27:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-12-07 14:27:06,756 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:27:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 14:27:16,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [639840341] [2019-12-07 14:27:16,138 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:27:16,138 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:27:16,138 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:27:16,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:27:16,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2019-12-07 14:27:16,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795592129] [2019-12-07 14:27:16,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 14:27:16,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:16,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 14:27:16,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 14:27:16,140 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 33 states. [2019-12-07 14:27:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:16,353 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-12-07 14:27:16,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 14:27:16,354 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2019-12-07 14:27:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:16,354 INFO L225 Difference]: With dead ends: 57 [2019-12-07 14:27:16,354 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 14:27:16,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 144 SyntacticMatches, 28 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 14:27:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 14:27:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 14:27:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 14:27:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-12-07 14:27:16,359 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-12-07 14:27:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:16,359 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-12-07 14:27:16,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 14:27:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-12-07 14:27:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 14:27:16,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:16,360 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:27:16,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:16,561 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:16,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-12-07 14:27:16,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:16,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359845671] [2019-12-07 14:27:16,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-12-07 14:27:16,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359845671] [2019-12-07 14:27:16,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016459543] [2019-12-07 14:27:16,712 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:17,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-07 14:27:17,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:27:17,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 14:27:17,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:27:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-12-07 14:27:17,081 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:27:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 14:27:28,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1467935627] [2019-12-07 14:27:28,007 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:27:28,007 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:27:28,008 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:27:28,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:27:28,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2019-12-07 14:27:28,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308035850] [2019-12-07 14:27:28,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 14:27:28,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:28,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 14:27:28,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 14:27:28,009 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 35 states. [2019-12-07 14:27:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:28,239 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-12-07 14:27:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 14:27:28,239 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 93 [2019-12-07 14:27:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:28,240 INFO L225 Difference]: With dead ends: 60 [2019-12-07 14:27:28,240 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 14:27:28,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 30 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=803, Invalid=1647, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 14:27:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 14:27:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 14:27:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 14:27:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-12-07 14:27:28,244 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-12-07 14:27:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:28,245 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-12-07 14:27:28,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 14:27:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-12-07 14:27:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 14:27:28,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:28,245 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:27:28,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:28,446 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-12-07 14:27:28,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:28,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497279924] [2019-12-07 14:27:28,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-12-07 14:27:28,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497279924] [2019-12-07 14:27:28,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254699036] [2019-12-07 14:27:28,612 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:29,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:27:29,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:27:29,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 14:27:29,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:27:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-12-07 14:27:29,112 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:27:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 14:27:44,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [550253356] [2019-12-07 14:27:44,098 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:27:44,098 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:27:44,098 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:27:44,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:27:44,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 35] total 37 [2019-12-07 14:27:44,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535624227] [2019-12-07 14:27:44,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 14:27:44,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:27:44,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 14:27:44,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 14:27:44,100 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 37 states. [2019-12-07 14:27:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:27:44,325 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-12-07 14:27:44,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 14:27:44,326 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 99 [2019-12-07 14:27:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:27:44,326 INFO L225 Difference]: With dead ends: 63 [2019-12-07 14:27:44,326 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 14:27:44,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 164 SyntacticMatches, 32 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=904, Invalid=1852, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 14:27:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 14:27:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 14:27:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 14:27:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-12-07 14:27:44,332 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-12-07 14:27:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:27:44,333 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-12-07 14:27:44,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 14:27:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-12-07 14:27:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 14:27:44,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:27:44,334 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:27:44,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:44,534 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:27:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:27:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-12-07 14:27:44,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:27:44,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956617878] [2019-12-07 14:27:44,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:27:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-12-07 14:27:44,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956617878] [2019-12-07 14:27:44,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544262140] [2019-12-07 14:27:44,728 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:27:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:27:45,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 14:27:45,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:27:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-12-07 14:27:45,328 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:27:54,520 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 14:27:54,895 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 14:27:55,100 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 14:27:55,205 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 14:27:55,331 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:27:55,440 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:27:55,560 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 14:28:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:28:03,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2033705395] [2019-12-07 14:28:03,466 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:28:03,467 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:28:03,467 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:28:03,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:28:03,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 37] total 39 [2019-12-07 14:28:03,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242226509] [2019-12-07 14:28:03,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 14:28:03,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:28:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 14:28:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1100, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 14:28:03,468 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 39 states. [2019-12-07 14:28:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:03,722 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-12-07 14:28:03,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 14:28:03,722 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 105 [2019-12-07 14:28:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:03,723 INFO L225 Difference]: With dead ends: 66 [2019-12-07 14:28:03,723 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 14:28:03,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 174 SyntacticMatches, 34 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1011, Invalid=2069, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 14:28:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 14:28:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 14:28:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 14:28:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-12-07 14:28:03,727 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-12-07 14:28:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:03,727 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-12-07 14:28:03,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 14:28:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-12-07 14:28:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 14:28:03,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:03,728 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:03,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:03,929 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:03,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:03,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-12-07 14:28:03,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:28:03,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867373608] [2019-12-07 14:28:03,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-12-07 14:28:04,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867373608] [2019-12-07 14:28:04,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317110770] [2019-12-07 14:28:04,122 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:04,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-07 14:28:04,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:28:04,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 14:28:04,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:28:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-12-07 14:28:04,877 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:28:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-12-07 14:28:25,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [839654668] [2019-12-07 14:28:25,968 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:28:25,968 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:28:25,968 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:28:25,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:28:25,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2019-12-07 14:28:25,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460011831] [2019-12-07 14:28:25,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 14:28:25,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:28:25,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 14:28:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 14:28:25,970 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 41 states. [2019-12-07 14:28:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:26,234 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-12-07 14:28:26,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:28:26,234 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 111 [2019-12-07 14:28:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:26,235 INFO L225 Difference]: With dead ends: 69 [2019-12-07 14:28:26,235 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 14:28:26,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 36 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 14:28:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 14:28:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-12-07 14:28:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 14:28:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-12-07 14:28:26,239 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-12-07 14:28:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:26,239 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-12-07 14:28:26,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 14:28:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-12-07 14:28:26,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 14:28:26,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:26,240 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:26,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:26,441 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:26,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:26,441 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-12-07 14:28:26,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:28:26,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688052175] [2019-12-07 14:28:26,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-12-07 14:28:26,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688052175] [2019-12-07 14:28:26,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013664058] [2019-12-07 14:28:26,655 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:27,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:28:27,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:28:27,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 14:28:27,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:28:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-12-07 14:28:27,558 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:28:30,351 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-07 14:28:30,458 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-07 14:28:30,576 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-12-07 14:28:30,683 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-07 14:28:30,787 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-12-07 14:28:31,469 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 14:28:31,603 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-12-07 14:28:31,730 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 14:28:32,019 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-07 14:28:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-12-07 14:28:55,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [359919049] [2019-12-07 14:28:55,928 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:28:55,929 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:28:55,929 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:28:55,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:28:55,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2019-12-07 14:28:55,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186704320] [2019-12-07 14:28:55,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 14:28:55,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:28:55,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 14:28:55,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 14:28:55,931 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 43 states. [2019-12-07 14:28:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:28:56,197 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-12-07 14:28:56,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:28:56,197 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 117 [2019-12-07 14:28:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:28:56,198 INFO L225 Difference]: With dead ends: 72 [2019-12-07 14:28:56,198 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 14:28:56,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 194 SyntacticMatches, 38 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 14:28:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 14:28:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-07 14:28:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 14:28:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-12-07 14:28:56,203 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-12-07 14:28:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:28:56,203 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-12-07 14:28:56,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 14:28:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-12-07 14:28:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 14:28:56,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:28:56,204 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:28:56,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:56,405 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:28:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:28:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-12-07 14:28:56,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:28:56,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047676206] [2019-12-07 14:28:56,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:28:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-12-07 14:28:56,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047676206] [2019-12-07 14:28:56,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776657060] [2019-12-07 14:28:56,635 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:28:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:28:57,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 14:28:57,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:28:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-12-07 14:28:57,737 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:00,716 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 14:29:11,029 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 14:29:11,143 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 14:29:11,264 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:29:11,386 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:29:11,509 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 14:29:11,627 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 14:29:11,750 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 14:29:11,874 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 14:29:12,002 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-07 14:29:12,131 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-07 14:29:12,263 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 14:29:12,391 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 14:29:12,533 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 14:29:12,669 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 14:29:12,818 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 14:29:20,425 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 14:29:20,532 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:29:20,639 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:29:20,747 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 14:29:20,852 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-12-07 14:29:20,965 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 14:29:21,067 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 14:29:23,925 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 14:29:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 14:29:31,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1181209121] [2019-12-07 14:29:31,379 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:29:31,379 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:29:31,380 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:29:31,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:29:31,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 43] total 45 [2019-12-07 14:29:31,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993938602] [2019-12-07 14:29:31,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-07 14:29:31,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:29:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 14:29:31,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=1472, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 14:29:31,382 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 45 states. [2019-12-07 14:29:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:31,721 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-12-07 14:29:31,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 14:29:31,722 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 123 [2019-12-07 14:29:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:31,722 INFO L225 Difference]: With dead ends: 75 [2019-12-07 14:29:31,722 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 14:29:31,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 204 SyntacticMatches, 40 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1368, Invalid=2792, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 14:29:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 14:29:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 14:29:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 14:29:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-12-07 14:29:31,727 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-12-07 14:29:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:31,727 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-12-07 14:29:31,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-07 14:29:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-12-07 14:29:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 14:29:31,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:31,728 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:31,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:29:31,929 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:29:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-12-07 14:29:31,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:29:31,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751533250] [2019-12-07 14:29:31,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:29:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-12-07 14:29:32,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751533250] [2019-12-07 14:29:32,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438299703] [2019-12-07 14:29:32,199 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:29:33,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-12-07 14:29:33,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:29:33,632 INFO L264 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 14:29:33,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-12-07 14:29:33,652 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:37,444 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-12-07 14:30:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-12-07 14:30:08,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [666525221] [2019-12-07 14:30:08,625 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:30:08,626 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:30:08,626 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:30:08,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:30:08,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 45] total 47 [2019-12-07 14:30:08,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518190238] [2019-12-07 14:30:08,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 14:30:08,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:30:08,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 14:30:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1608, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 14:30:08,628 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 47 states. [2019-12-07 14:30:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:30:09,043 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-12-07 14:30:09,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 14:30:09,043 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 129 [2019-12-07 14:30:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:30:09,044 INFO L225 Difference]: With dead ends: 78 [2019-12-07 14:30:09,044 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 14:30:09,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 42 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1499, Invalid=3057, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 14:30:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 14:30:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 14:30:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 14:30:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-12-07 14:30:09,048 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-12-07 14:30:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:30:09,048 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-12-07 14:30:09,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 14:30:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-12-07 14:30:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 14:30:09,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:30:09,049 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:30:09,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:30:09,249 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:30:09,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:30:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-12-07 14:30:09,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:30:09,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749560776] [2019-12-07 14:30:09,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:30:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:30:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-12-07 14:30:09,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749560776] [2019-12-07 14:30:09,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378165602] [2019-12-07 14:30:09,530 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:30:11,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:30:11,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:30:11,182 INFO L264 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 14:30:11,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:30:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-12-07 14:30:11,204 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:30:13,254 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 14:30:13,394 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 14:30:13,511 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 14:30:13,635 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 14:30:13,755 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 14:30:13,884 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 14:30:14,029 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 14:30:14,197 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 14:30:14,354 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 14:30:14,525 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 14:30:14,697 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 14:30:14,871 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 14:30:15,057 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 14:30:15,255 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 14:30:15,440 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 14:30:15,657 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-12-07 14:30:16,298 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-12-07 14:30:19,629 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-07 14:30:19,747 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-07 14:30:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-12-07 14:30:53,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1110709598] [2019-12-07 14:30:53,461 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:30:53,461 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:30:53,461 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:30:53,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:30:53,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 47] total 49 [2019-12-07 14:30:53,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9857098] [2019-12-07 14:30:53,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 14:30:53,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:30:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 14:30:53,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=1750, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 14:30:53,463 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 49 states. [2019-12-07 14:30:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:30:53,814 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-12-07 14:30:53,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 14:30:53,815 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 135 [2019-12-07 14:30:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:30:53,816 INFO L225 Difference]: With dead ends: 81 [2019-12-07 14:30:53,816 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 14:30:53,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 224 SyntacticMatches, 44 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1636, Invalid=3334, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 14:30:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 14:30:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-12-07 14:30:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 14:30:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-12-07 14:30:53,820 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2019-12-07 14:30:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:30:53,820 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-12-07 14:30:53,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 14:30:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-12-07 14:30:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 14:30:53,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:30:53,821 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:30:54,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:30:54,022 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:30:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:30:54,022 INFO L82 PathProgramCache]: Analyzing trace with hash -555819607, now seen corresponding path program 22 times [2019-12-07 14:30:54,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:30:54,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23486627] [2019-12-07 14:30:54,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:30:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:30:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-12-07 14:30:54,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23486627] [2019-12-07 14:30:54,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233767475] [2019-12-07 14:30:54,321 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:30:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:30:56,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 14:30:56,186 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:30:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-12-07 14:30:56,220 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:30:58,051 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 14:31:00,204 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-12-07 14:31:00,306 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-12-07 14:31:00,412 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 14:31:00,786 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 14:31:00,895 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 14:31:01,002 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 14:31:01,109 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 14:31:01,516 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-12-07 14:31:01,992 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-12-07 14:31:02,110 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-12-07 14:31:02,225 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-07 14:31:02,335 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-12-07 14:31:11,950 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-12-07 14:31:12,065 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-12-07 14:31:12,199 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 14:31:12,333 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 14:31:12,477 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 14:31:20,043 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 14:31:20,187 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 14:31:20,335 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 14:31:20,473 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 14:31:20,676 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 14:31:20,788 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 14:31:20,897 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 14:31:21,013 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 14:31:21,126 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 14:31:21,243 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 14:31:21,359 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 14:31:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-12-07 14:31:45,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2070800908] [2019-12-07 14:31:45,912 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:31:45,912 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:31:45,912 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:31:45,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:31:45,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 49] total 51 [2019-12-07 14:31:45,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465726009] [2019-12-07 14:31:45,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 14:31:45,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:31:45,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 14:31:45,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=1898, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 14:31:45,914 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 51 states. [2019-12-07 14:31:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:31:46,247 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-12-07 14:31:46,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 14:31:46,248 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 141 [2019-12-07 14:31:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:31:46,249 INFO L225 Difference]: With dead ends: 84 [2019-12-07 14:31:46,249 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 14:31:46,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 234 SyntacticMatches, 46 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1779, Invalid=3623, Unknown=0, NotChecked=0, Total=5402 [2019-12-07 14:31:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 14:31:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-12-07 14:31:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 14:31:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-12-07 14:31:46,253 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2019-12-07 14:31:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:31:46,254 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-12-07 14:31:46,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 14:31:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-12-07 14:31:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 14:31:46,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:31:46,255 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:31:46,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:31:46,455 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:31:46,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:31:46,456 INFO L82 PathProgramCache]: Analyzing trace with hash -945685357, now seen corresponding path program 23 times [2019-12-07 14:31:46,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:31:46,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009527732] [2019-12-07 14:31:46,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:31:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:31:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-12-07 14:31:46,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009527732] [2019-12-07 14:31:46,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101749321] [2019-12-07 14:31:46,794 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:31:49,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-12-07 14:31:49,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:31:49,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 14:31:49,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:31:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-12-07 14:31:49,137 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:31:52,756 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 14:31:52,961 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 14:31:53,071 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-07 14:31:53,180 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-07 14:31:53,290 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-07 14:31:53,391 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-07 14:31:53,498 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-12-07 14:31:53,607 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-12-07 14:31:53,717 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-12-07 14:31:53,839 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-12-07 14:31:53,942 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-12-07 14:31:54,054 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2019-12-07 14:31:54,165 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-12-07 14:31:58,954 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 14:31:59,263 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 14:31:59,462 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 14:32:05,072 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 14:32:05,173 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 14:32:05,281 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 14:32:05,386 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 14:32:05,497 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 14:32:05,608 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 14:32:10,011 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 14:32:10,114 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 14:32:10,224 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 14:32:10,332 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 14:32:10,451 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 14:32:19,786 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 14:32:19,889 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 14:32:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-12-07 14:32:41,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [330736234] [2019-12-07 14:32:41,185 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:32:41,185 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:32:41,186 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:32:41,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:32:41,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 51] total 53 [2019-12-07 14:32:41,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590419803] [2019-12-07 14:32:41,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-12-07 14:32:41,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:32:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-12-07 14:32:41,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=2052, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 14:32:41,187 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 53 states. [2019-12-07 14:32:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:32:41,641 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-12-07 14:32:41,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 14:32:41,641 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 147 [2019-12-07 14:32:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:32:41,642 INFO L225 Difference]: With dead ends: 87 [2019-12-07 14:32:41,642 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 14:32:41,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 48 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1928, Invalid=3924, Unknown=0, NotChecked=0, Total=5852 [2019-12-07 14:32:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 14:32:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-07 14:32:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 14:32:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-12-07 14:32:41,645 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2019-12-07 14:32:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:32:41,646 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-12-07 14:32:41,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-12-07 14:32:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-12-07 14:32:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 14:32:41,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:32:41,647 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:32:41,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:32:41,847 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:32:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:32:41,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1588806697, now seen corresponding path program 24 times [2019-12-07 14:32:41,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:32:41,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875345778] [2019-12-07 14:32:41,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:32:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:32:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-12-07 14:32:42,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875345778] [2019-12-07 14:32:42,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303703159] [2019-12-07 14:32:42,199 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:32:44,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:32:44,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:32:44,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 14:32:44,907 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:32:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-12-07 14:32:44,946 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:32:48,256 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 14:32:48,749 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 14:32:48,861 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 14:32:48,981 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-07 14:32:49,103 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-07 14:32:49,225 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-07 14:32:49,358 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-07 14:32:49,518 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-12-07 14:32:49,627 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-12-07 14:32:49,755 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-12-07 14:32:49,870 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-12-07 14:32:49,995 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-12-07 14:32:50,119 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-12-07 14:32:50,245 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-12-07 14:32:50,363 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-12-07 14:32:50,467 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-12-07 14:32:50,677 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-12-07 14:32:50,964 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 14:32:51,067 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-12-07 14:32:57,026 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 14:32:57,420 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-07 14:32:57,525 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-07 14:32:57,640 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-07 14:32:57,752 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-07 14:32:57,870 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-12-07 14:32:57,987 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-12-07 14:32:58,109 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-12-07 14:32:58,220 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-12-07 14:32:58,324 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2019-12-07 14:32:58,444 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-12-07 14:33:03,560 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 14:33:03,671 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-12-07 14:33:03,779 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-12-07 14:33:03,894 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 14:33:04,010 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 14:33:04,143 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 14:33:04,249 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 14:33:04,357 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-07 14:33:04,460 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-07 14:33:09,050 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-07 14:33:09,167 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 14:33:09,283 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 14:33:15,378 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 14:33:15,482 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 14:33:15,589 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 14:33:29,301 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 14:33:32,301 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 14:33:32,604 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 14:33:33,036 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 14:33:33,145 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 14:33:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-12-07 14:33:48,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2012943333] [2019-12-07 14:33:48,329 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:33:48,329 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:33:48,329 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:33:48,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:33:48,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 53] total 54 [2019-12-07 14:33:48,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857679014] [2019-12-07 14:33:48,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 14:33:48,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:33:48,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 14:33:48,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 14:33:48,331 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 54 states. [2019-12-07 14:33:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:48,827 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-12-07 14:33:48,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 14:33:48,827 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 153 [2019-12-07 14:33:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:48,828 INFO L225 Difference]: With dead ends: 90 [2019-12-07 14:33:48,828 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 14:33:48,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 254 SyntacticMatches, 51 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=4082, Unknown=0, NotChecked=0, Total=6162 [2019-12-07 14:33:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 14:33:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-07 14:33:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 14:33:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-12-07 14:33:48,831 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2019-12-07 14:33:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:48,832 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-12-07 14:33:48,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 14:33:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-12-07 14:33:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 14:33:48,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:48,833 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:49,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:49,034 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:49,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:49,034 INFO L82 PathProgramCache]: Analyzing trace with hash 959677331, now seen corresponding path program 25 times [2019-12-07 14:33:49,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:33:49,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830910575] [2019-12-07 14:33:49,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-12-07 14:33:50,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830910575] [2019-12-07 14:33:50,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873768298] [2019-12-07 14:33:50,314 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:53,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 107 conjunts are in the unsatisfiable core [2019-12-07 14:33:53,545 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:33:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-12-07 14:33:53,620 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:33:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-12-07 14:33:56,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1720490871] [2019-12-07 14:33:56,563 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:33:56,563 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:33:56,563 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:33:56,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:33:56,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2019-12-07 14:33:56,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120379695] [2019-12-07 14:33:56,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 14:33:56,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:33:56,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 14:33:56,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 14:33:56,564 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 55 states. [2019-12-07 14:33:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:57,298 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-12-07 14:33:57,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-07 14:33:57,298 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 159 [2019-12-07 14:33:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:57,299 INFO L225 Difference]: With dead ends: 93 [2019-12-07 14:33:57,299 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 14:33:57,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 314 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 14:33:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 14:33:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-07 14:33:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 14:33:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-12-07 14:33:57,302 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 159 [2019-12-07 14:33:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:57,302 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-12-07 14:33:57,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 14:33:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-12-07 14:33:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 14:33:57,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:33:57,303 INFO L410 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:33:57,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:33:57,503 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:33:57,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:33:57,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1468417367, now seen corresponding path program 26 times [2019-12-07 14:33:57,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:33:57,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344970681] [2019-12-07 14:33:57,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:33:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:33:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-12-07 14:33:57,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344970681] [2019-12-07 14:33:57,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:33:57,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-12-07 14:33:57,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311639549] [2019-12-07 14:33:57,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 14:33:57,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:33:57,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 14:33:57,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=520, Unknown=0, NotChecked=0, Total=930 [2019-12-07 14:33:57,938 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 31 states. [2019-12-07 14:33:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:33:58,183 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-12-07 14:33:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 14:33:58,183 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 165 [2019-12-07 14:33:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:33:58,183 INFO L225 Difference]: With dead ends: 89 [2019-12-07 14:33:58,183 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:33:58,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 14:33:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:33:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:33:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:33:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:33:58,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2019-12-07 14:33:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:33:58,184 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:33:58,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 14:33:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:33:58,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:33:58,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:33:58,202 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:33:58,202 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:33:58,202 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2019-12-07 14:33:58,202 INFO L246 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2019-12-07 14:33:58,202 INFO L246 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2019-12-07 14:33:58,202 INFO L242 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= ULTIMATE.start_main_~input~0 25) (<= 25 ULTIMATE.start_main_~input~0)) [2019-12-07 14:33:58,202 INFO L246 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-12-07 14:33:58,202 INFO L246 CegarLoopResult]: For program point L9(lines 9 15) no Hoare annotation was computed. [2019-12-07 14:33:58,203 INFO L246 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2019-12-07 14:33:58,203 INFO L246 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2019-12-07 14:33:58,203 INFO L249 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2019-12-07 14:33:58,203 INFO L242 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (and (<= |id_#in~x| id_~x) (<= id_~x |id_#in~x|)) [2019-12-07 14:33:58,203 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-12-07 14:33:58,203 INFO L246 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-12-07 14:33:58,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:33:58 BoogieIcfgContainer [2019-12-07 14:33:58,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:33:58,206 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:33:58,206 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:33:58,207 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:33:58,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:26:31" (3/4) ... [2019-12-07 14:33:58,209 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:33:58,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-12-07 14:33:58,215 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 14:33:58,215 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 14:33:58,238 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_015807f0-d511-47ea-8b04-bfd3568520af/bin/utaipan/witness.graphml [2019-12-07 14:33:58,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:33:58,239 INFO L168 Benchmark]: Toolchain (without parser) took 447527.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 947.3 MB in the beginning and 649.5 MB in the end (delta: 297.7 MB). Peak memory consumption was 511.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,239 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:33:58,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:33:58,240 INFO L168 Benchmark]: Boogie Preprocessor took 10.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:33:58,240 INFO L168 Benchmark]: RCFGBuilder took 142.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,240 INFO L168 Benchmark]: TraceAbstraction took 447144.91 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 659.5 MB in the end (delta: 417.9 MB). Peak memory consumption was 531.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,240 INFO L168 Benchmark]: Witness Printer took 31.84 ms. Allocated memory is still 1.2 GB. Free memory was 659.5 MB in the beginning and 649.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:33:58,241 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 142.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 447144.91 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 659.5 MB in the end (delta: 417.9 MB). Peak memory consumption was 531.1 MB. Max. memory is 11.5 GB. * Witness Printer took 31.84 ms. Allocated memory is still 1.2 GB. Free memory was 659.5 MB in the beginning and 649.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Result: SAFE, OverallTime: 447.0s, OverallIterations: 27, TraceHistogramMax: 27, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 345 SDtfs, 7976 SDslu, 4896 SDs, 0 SdLazy, 4297 SolverSat, 3627 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5489 GetRequests, 3680 SyntacticMatches, 653 SemanticMatches, 1156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16499 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 415.9s InterpolantComputationTime, 4524 NumberOfCodeBlocks, 4524 NumberOfCodeBlocksAsserted, 160 NumberOfCheckSat, 6622 ConstructedInterpolants, 0 QuantifiedInterpolants, 2254928 SizeOfPredicates, 349 NumberOfNonLiveVariables, 5125 ConjunctsInSsa, 803 ConjunctsInUnsatCore, 77 InterpolantComputations, 2 PerfectInterpolantSequences, 22504/52754 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...