./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label38.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/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 04fd81e9543232110dc189b4b001c0bb7a784bec ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:36:52,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:36:52,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:36:52,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:36:52,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:36:52,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:36:52,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:36:52,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:36:52,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:36:52,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:36:52,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:36:52,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:36:52,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:36:52,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:36:52,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:36:52,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:36:52,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:36:52,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:36:52,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:36:52,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:36:52,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:36:52,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:36:52,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:36:52,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:36:52,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:36:52,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:36:52,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:36:52,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:36:52,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:36:52,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:36:52,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:36:52,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:36:52,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:36:52,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:36:52,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:36:52,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:36:52,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:36:52,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:36:52,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:36:52,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:36:52,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:36:52,092 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:36:52,112 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:36:52,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:36:52,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:36:52,114 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:36:52,115 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:36:52,115 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:36:52,115 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:36:52,115 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:36:52,116 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:36:52,116 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:36:52,117 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:36:52,117 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:36:52,117 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:36:52,118 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:36:52,118 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:36:52,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:36:52,119 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:36:52,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:36:52,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:36:52,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:36:52,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:36:52,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:36:52,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:36:52,121 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:36:52,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:36:52,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:36:52,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:36:52,122 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:36:52,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:36:52,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:36:52,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:36:52,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:36:52,123 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:36:52,123 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:36:52,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:36:52,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:36:52,124 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:36:52,124 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_9bdfafd5-0803-4c7f-a760-492ef049b204/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 -> 04fd81e9543232110dc189b4b001c0bb7a784bec [2019-11-26 02:36:52,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:36:52,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:36:52,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:36:52,276 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:36:52,276 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:36:52,277 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label38.c [2019-11-26 02:36:52,329 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/data/c7630b96e/a97b4fe833f641aa9aa778bbb458bc4b/FLAG7bdffbdc3 [2019-11-26 02:36:52,865 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:36:52,865 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/sv-benchmarks/c/eca-rers2012/Problem02_label38.c [2019-11-26 02:36:52,881 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/data/c7630b96e/a97b4fe833f641aa9aa778bbb458bc4b/FLAG7bdffbdc3 [2019-11-26 02:36:53,124 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/data/c7630b96e/a97b4fe833f641aa9aa778bbb458bc4b [2019-11-26 02:36:53,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:36:53,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:36:53,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:36:53,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:36:53,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:36:53,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6567e04a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53, skipping insertion in model container [2019-11-26 02:36:53,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:36:53,186 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:36:53,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:36:53,585 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:36:53,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:36:53,785 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:36:53,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53 WrapperNode [2019-11-26 02:36:53,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:36:53,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:36:53,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:36:53,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:36:53,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:36:53,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:36:53,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:36:53,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:36:53,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... [2019-11-26 02:36:53,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:36:53,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:36:53,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:36:53,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:36:53,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/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-11-26 02:36:54,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:36:54,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:36:55,897 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:36:55,897 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:36:55,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:36:55 BoogieIcfgContainer [2019-11-26 02:36:55,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:36:55,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:36:55,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:36:55,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:36:55,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:36:53" (1/3) ... [2019-11-26 02:36:55,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff0f80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:36:55, skipping insertion in model container [2019-11-26 02:36:55,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:53" (2/3) ... [2019-11-26 02:36:55,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff0f80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:36:55, skipping insertion in model container [2019-11-26 02:36:55,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:36:55" (3/3) ... [2019-11-26 02:36:55,909 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label38.c [2019-11-26 02:36:55,918 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:36:55,925 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:36:55,936 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:36:56,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:36:56,002 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:36:56,002 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:36:56,002 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:36:56,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:36:56,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:36:56,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:36:56,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:36:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-26 02:36:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:36:56,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:56,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:36:56,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:56,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 925961231, now seen corresponding path program 1 times [2019-11-26 02:36:56,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:56,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989612865] [2019-11-26 02:36:56,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:36:56,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989612865] [2019-11-26 02:36:56,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:56,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:56,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860064498] [2019-11-26 02:36:56,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:36:56,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:36:56,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:36:56,451 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-26 02:36:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:57,242 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-26 02:36:57,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:36:57,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:36:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:57,263 INFO L225 Difference]: With dead ends: 333 [2019-11-26 02:36:57,264 INFO L226 Difference]: Without dead ends: 243 [2019-11-26 02:36:57,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:36:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-26 02:36:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-26 02:36:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-26 02:36:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 398 transitions. [2019-11-26 02:36:57,346 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 398 transitions. Word has length 80 [2019-11-26 02:36:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:57,347 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 398 transitions. [2019-11-26 02:36:57,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:36:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 398 transitions. [2019-11-26 02:36:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-26 02:36:57,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:57,353 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:36:57,353 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2010267698, now seen corresponding path program 1 times [2019-11-26 02:36:57,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:57,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483166829] [2019-11-26 02:36:57,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:36:57,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483166829] [2019-11-26 02:36:57,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:57,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:57,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413812372] [2019-11-26 02:36:57,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:36:57,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:36:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:57,485 INFO L87 Difference]: Start difference. First operand 243 states and 398 transitions. Second operand 3 states. [2019-11-26 02:36:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:57,857 INFO L93 Difference]: Finished difference Result 725 states and 1191 transitions. [2019-11-26 02:36:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:36:57,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-26 02:36:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:57,861 INFO L225 Difference]: With dead ends: 725 [2019-11-26 02:36:57,861 INFO L226 Difference]: Without dead ends: 483 [2019-11-26 02:36:57,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-26 02:36:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-26 02:36:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-26 02:36:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 743 transitions. [2019-11-26 02:36:57,890 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 743 transitions. Word has length 89 [2019-11-26 02:36:57,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:57,891 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 743 transitions. [2019-11-26 02:36:57,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:36:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 743 transitions. [2019-11-26 02:36:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-26 02:36:57,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:57,898 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:36:57,899 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:57,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:57,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1583661614, now seen corresponding path program 1 times [2019-11-26 02:36:57,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:57,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131969176] [2019-11-26 02:36:57,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:36:57,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131969176] [2019-11-26 02:36:57,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:57,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:57,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771960739] [2019-11-26 02:36:57,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:36:58,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:36:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:36:58,001 INFO L87 Difference]: Start difference. First operand 483 states and 743 transitions. Second operand 4 states. [2019-11-26 02:36:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:58,659 INFO L93 Difference]: Finished difference Result 1847 states and 2838 transitions. [2019-11-26 02:36:58,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:36:58,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-26 02:36:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:58,666 INFO L225 Difference]: With dead ends: 1847 [2019-11-26 02:36:58,666 INFO L226 Difference]: Without dead ends: 1365 [2019-11-26 02:36:58,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:36:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-11-26 02:36:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 883. [2019-11-26 02:36:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-26 02:36:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1294 transitions. [2019-11-26 02:36:58,708 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1294 transitions. Word has length 99 [2019-11-26 02:36:58,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:58,709 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1294 transitions. [2019-11-26 02:36:58,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:36:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1294 transitions. [2019-11-26 02:36:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:36:58,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:58,712 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:36:58,712 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:58,713 INFO L82 PathProgramCache]: Analyzing trace with hash -518464828, now seen corresponding path program 1 times [2019-11-26 02:36:58,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:58,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861406247] [2019-11-26 02:36:58,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:36:58,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861406247] [2019-11-26 02:36:58,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:58,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:58,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854212088] [2019-11-26 02:36:58,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:36:58,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:36:58,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:58,764 INFO L87 Difference]: Start difference. First operand 883 states and 1294 transitions. Second operand 3 states. [2019-11-26 02:36:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:59,183 INFO L93 Difference]: Finished difference Result 1925 states and 2862 transitions. [2019-11-26 02:36:59,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:36:59,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-26 02:36:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:59,189 INFO L225 Difference]: With dead ends: 1925 [2019-11-26 02:36:59,189 INFO L226 Difference]: Without dead ends: 1043 [2019-11-26 02:36:59,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-26 02:36:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-11-26 02:36:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-26 02:36:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1183 transitions. [2019-11-26 02:36:59,214 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1183 transitions. Word has length 108 [2019-11-26 02:36:59,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:59,214 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1183 transitions. [2019-11-26 02:36:59,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:36:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1183 transitions. [2019-11-26 02:36:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:36:59,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:59,217 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:36:59,218 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2017794354, now seen corresponding path program 1 times [2019-11-26 02:36:59,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:59,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871226822] [2019-11-26 02:36:59,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:36:59,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871226822] [2019-11-26 02:36:59,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:59,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:36:59,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886425141] [2019-11-26 02:36:59,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:36:59,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:36:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:59,261 INFO L87 Difference]: Start difference. First operand 883 states and 1183 transitions. Second operand 3 states. [2019-11-26 02:36:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:59,644 INFO L93 Difference]: Finished difference Result 2405 states and 3186 transitions. [2019-11-26 02:36:59,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:36:59,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-26 02:36:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:59,652 INFO L225 Difference]: With dead ends: 2405 [2019-11-26 02:36:59,652 INFO L226 Difference]: Without dead ends: 1443 [2019-11-26 02:36:59,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-26 02:36:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2019-11-26 02:36:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-11-26 02:36:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1776 transitions. [2019-11-26 02:36:59,689 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1776 transitions. Word has length 109 [2019-11-26 02:36:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:59,689 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 1776 transitions. [2019-11-26 02:36:59,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:36:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1776 transitions. [2019-11-26 02:36:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-26 02:36:59,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:59,693 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:36:59,693 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:59,694 INFO L82 PathProgramCache]: Analyzing trace with hash 372660026, now seen corresponding path program 1 times [2019-11-26 02:36:59,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:59,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118843913] [2019-11-26 02:36:59,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:36:59,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118843913] [2019-11-26 02:36:59,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:59,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:59,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403758241] [2019-11-26 02:36:59,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:36:59,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:36:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:59,752 INFO L87 Difference]: Start difference. First operand 1443 states and 1776 transitions. Second operand 3 states. [2019-11-26 02:37:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:00,145 INFO L93 Difference]: Finished difference Result 2885 states and 3551 transitions. [2019-11-26 02:37:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:00,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-26 02:37:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:00,154 INFO L225 Difference]: With dead ends: 2885 [2019-11-26 02:37:00,155 INFO L226 Difference]: Without dead ends: 1443 [2019-11-26 02:37:00,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-26 02:37:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2019-11-26 02:37:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-11-26 02:37:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1761 transitions. [2019-11-26 02:37:00,196 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1761 transitions. Word has length 112 [2019-11-26 02:37:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:00,196 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 1761 transitions. [2019-11-26 02:37:00,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1761 transitions. [2019-11-26 02:37:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-26 02:37:00,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:00,200 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:00,200 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:00,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2068308384, now seen corresponding path program 1 times [2019-11-26 02:37:00,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:00,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519504598] [2019-11-26 02:37:00,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-26 02:37:00,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519504598] [2019-11-26 02:37:00,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975588582] [2019-11-26 02:37:00,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/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-11-26 02:37:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:00,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:37:00,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:37:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-26 02:37:00,484 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:37:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-26 02:37:00,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:37:00,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-11-26 02:37:00,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64060633] [2019-11-26 02:37:00,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:00,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:00,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:00,515 INFO L87 Difference]: Start difference. First operand 1443 states and 1761 transitions. Second operand 3 states. [2019-11-26 02:37:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:00,703 INFO L93 Difference]: Finished difference Result 2643 states and 3252 transitions. [2019-11-26 02:37:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:00,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-26 02:37:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:00,704 INFO L225 Difference]: With dead ends: 2643 [2019-11-26 02:37:00,704 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:37:00,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 263 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:37:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:37:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:37:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:37:00,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2019-11-26 02:37:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:00,707 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:37:00,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:37:00,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:37:00,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:37:00,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:37:01,099 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-26 02:37:01,224 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-26 02:37:01,226 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-26 02:37:01,227 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-26 02:37:01,228 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-26 02:37:01,229 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-26 02:37:01,236 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-26 02:37:01,236 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-26 02:37:01,236 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-26 02:37:01,236 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-26 02:37:01,236 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-26 02:37:01,236 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-26 02:37:01,237 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-11-26 02:37:01,237 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-26 02:37:01,237 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-26 02:37:01,237 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-26 02:37:01,237 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-26 02:37:01,237 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (not (= ~a28~0 11))) (.cse5 (= ~a19~0 1)) (.cse3 (= ~a28~0 7)) (.cse0 (= ~a25~0 1)) (.cse4 (not (= ~a11~0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse1 .cse4 .cse2) (and .cse5 .cse0 .cse1 .cse4) (and .cse5 .cse1 .cse2) (and (<= 10 ~a28~0) .cse1 .cse2) (and .cse5 .cse3 .cse0 .cse4))) [2019-11-26 02:37:01,238 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-26 02:37:01,238 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-26 02:37:01,238 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-26 02:37:01,238 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-26 02:37:01,238 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-26 02:37:01,238 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-26 02:37:01,238 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-26 02:37:01,238 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-26 02:37:01,238 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-26 02:37:01,238 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-26 02:37:01,239 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (not (= ~a28~0 11))) (.cse5 (= ~a19~0 1)) (.cse3 (= ~a28~0 7)) (.cse0 (= ~a25~0 1)) (.cse4 (not (= ~a11~0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse1 .cse4 .cse2) (and .cse5 .cse0 .cse1 .cse4) (and .cse5 .cse1 .cse2) (and (<= 10 ~a28~0) .cse1 .cse2) (and .cse5 .cse3 .cse0 .cse4))) [2019-11-26 02:37:01,239 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-26 02:37:01,239 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-26 02:37:01,239 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-26 02:37:01,239 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-26 02:37:01,239 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-26 02:37:01,239 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-26 02:37:01,239 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-26 02:37:01,239 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-26 02:37:01,240 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-26 02:37:01,241 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-26 02:37:01,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:37:01 BoogieIcfgContainer [2019-11-26 02:37:01,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:37:01,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:37:01,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:37:01,282 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:37:01,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:36:55" (3/4) ... [2019-11-26 02:37:01,285 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:37:01,321 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-11-26 02:37:01,323 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:37:01,325 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:37:01,326 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:37:01,545 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9bdfafd5-0803-4c7f-a760-492ef049b204/bin/utaipan/witness.graphml [2019-11-26 02:37:01,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:37:01,546 INFO L168 Benchmark]: Toolchain (without parser) took 8417.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 939.3 MB in the beginning and 930.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 224.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:01,547 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:37:01,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:01,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:01,548 INFO L168 Benchmark]: Boogie Preprocessor took 89.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:01,548 INFO L168 Benchmark]: RCFGBuilder took 1938.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.4 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:01,549 INFO L168 Benchmark]: TraceAbstraction took 5381.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 892.4 MB in the beginning and 951.9 MB in the end (delta: -59.5 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:01,549 INFO L168 Benchmark]: Witness Printer took 263.58 ms. Allocated memory is still 1.2 GB. Free memory was 951.9 MB in the beginning and 930.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:01,551 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 656.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1938.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.4 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5381.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 892.4 MB in the beginning and 951.9 MB in the end (delta: -59.5 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. * Witness Printer took 263.58 ms. Allocated memory is still 1.2 GB. Free memory was 951.9 MB in the beginning and 930.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((a25 == 1 && a17 <= 8) && !(a28 == 11)) || (a28 == 7 && a17 <= 8)) || ((a17 <= 8 && !(a11 == 1)) && !(a28 == 11))) || (((a19 == 1 && a25 == 1) && a17 <= 8) && !(a11 == 1))) || ((a19 == 1 && a17 <= 8) && !(a28 == 11))) || ((10 <= a28 && a17 <= 8) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && !(a11 == 1)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((a25 == 1 && a17 <= 8) && !(a28 == 11)) || (a28 == 7 && a17 <= 8)) || ((a17 <= 8 && !(a11 == 1)) && !(a28 == 11))) || (((a19 == 1 && a25 == 1) && a17 <= 8) && !(a11 == 1))) || ((a19 == 1 && a17 <= 8) && !(a28 == 11))) || ((10 <= a28 && a17 <= 8) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && !(a11 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 552 SDtfs, 748 SDslu, 47 SDs, 0 SdLazy, 1902 SolverSat, 523 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1443occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 642 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 38 NumberOfFragments, 163 HoareAnnotationTreeSize, 3 FomulaSimplifications, 436 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 122 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 863 NumberOfCodeBlocks, 863 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 197592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 321 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 370/378 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...