./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label49.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/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 95000caaa926e46a44fd070da2a40a84b9e2d593 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:27:09,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:09,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:09,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:09,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:09,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:09,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:09,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:09,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:09,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:09,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:09,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:09,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:09,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:09,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:09,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:09,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:09,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:09,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:09,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:09,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:09,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:09,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:09,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:09,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:09,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:09,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:09,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:09,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:09,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:09,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:09,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:09,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:09,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:09,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:09,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:09,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:09,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:09,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:09,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:09,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:09,080 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:27:09,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:09,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:09,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:09,097 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:09,097 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:09,097 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:09,097 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:27:09,097 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:09,098 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:09,098 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:27:09,098 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:27:09,098 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:09,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:09,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:27:09,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:27:09,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:27:09,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:09,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:09,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:09,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:09,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:27:09,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:09,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:09,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:09,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:09,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:09,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:09,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:09,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:09,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:09,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:09,102 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:27:09,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:27:09,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:09,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:09,103 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/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/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 -> 95000caaa926e46a44fd070da2a40a84b9e2d593 [2019-10-22 11:27:09,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:09,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:09,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:09,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:09,145 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:09,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label49.c [2019-10-22 11:27:09,204 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/data/10d2aed24/ef15d8e0f383408c82fc2499b38a7708/FLAG970269fb0 [2019-10-22 11:27:09,688 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:09,688 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/sv-benchmarks/c/eca-rers2012/Problem02_label49.c [2019-10-22 11:27:09,705 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/data/10d2aed24/ef15d8e0f383408c82fc2499b38a7708/FLAG970269fb0 [2019-10-22 11:27:10,173 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/data/10d2aed24/ef15d8e0f383408c82fc2499b38a7708 [2019-10-22 11:27:10,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:10,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:10,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:10,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:10,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:10,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd21baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10, skipping insertion in model container [2019-10-22 11:27:10,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,193 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:10,231 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:10,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:10,654 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:10,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:10,791 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:10,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10 WrapperNode [2019-10-22 11:27:10,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:10,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:10,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:10,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:10,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:10,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:10,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:10,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:10,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... [2019-10-22 11:27:10,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:10,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:10,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:10,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:10,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/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-10-22 11:27:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:12,278 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:12,278 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:27:12,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:12 BoogieIcfgContainer [2019-10-22 11:27:12,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:12,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:12,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:12,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:12,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:10" (1/3) ... [2019-10-22 11:27:12,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccdf4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:12, skipping insertion in model container [2019-10-22 11:27:12,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:10" (2/3) ... [2019-10-22 11:27:12,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccdf4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:12, skipping insertion in model container [2019-10-22 11:27:12,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:12" (3/3) ... [2019-10-22 11:27:12,288 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label49.c [2019-10-22 11:27:12,297 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:12,305 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:27:12,318 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:27:12,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:12,344 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:12,344 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:12,344 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:12,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:12,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:12,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:12,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-10-22 11:27:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 11:27:12,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:12,373 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:12,374 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:12,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:12,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1378216101, now seen corresponding path program 1 times [2019-10-22 11:27:12,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:12,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553406567] [2019-10-22 11:27:12,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:12,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:12,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:12,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553406567] [2019-10-22 11:27:12,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:12,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:12,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125349914] [2019-10-22 11:27:12,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:12,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:12,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:12,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:12,805 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-10-22 11:27:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:14,269 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-10-22 11:27:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:14,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-22 11:27:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:14,293 INFO L225 Difference]: With dead ends: 775 [2019-10-22 11:27:14,293 INFO L226 Difference]: Without dead ends: 460 [2019-10-22 11:27:14,299 INFO L600 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-10-22 11:27:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-10-22 11:27:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-10-22 11:27:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-22 11:27:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-10-22 11:27:14,382 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 125 [2019-10-22 11:27:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:14,384 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-10-22 11:27:14,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-10-22 11:27:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-22 11:27:14,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:14,388 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:14,388 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:14,388 INFO L82 PathProgramCache]: Analyzing trace with hash 427040720, now seen corresponding path program 1 times [2019-10-22 11:27:14,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:14,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110923444] [2019-10-22 11:27:14,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:14,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:14,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:14,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110923444] [2019-10-22 11:27:14,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:14,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:14,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456134409] [2019-10-22 11:27:14,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:14,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:14,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:14,647 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 4 states. [2019-10-22 11:27:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:15,340 INFO L93 Difference]: Finished difference Result 977 states and 1474 transitions. [2019-10-22 11:27:15,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:15,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-22 11:27:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:15,346 INFO L225 Difference]: With dead ends: 977 [2019-10-22 11:27:15,346 INFO L226 Difference]: Without dead ends: 588 [2019-10-22 11:27:15,348 INFO L600 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-10-22 11:27:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-22 11:27:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 448. [2019-10-22 11:27:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-22 11:27:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 621 transitions. [2019-10-22 11:27:15,371 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 621 transitions. Word has length 129 [2019-10-22 11:27:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:15,371 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 621 transitions. [2019-10-22 11:27:15,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 621 transitions. [2019-10-22 11:27:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-22 11:27:15,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:15,377 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:15,377 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:15,377 INFO L82 PathProgramCache]: Analyzing trace with hash 349951226, now seen corresponding path program 1 times [2019-10-22 11:27:15,378 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:15,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900013885] [2019-10-22 11:27:15,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:15,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:15,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:15,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900013885] [2019-10-22 11:27:15,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:15,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:15,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005414887] [2019-10-22 11:27:15,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:15,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:15,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:15,437 INFO L87 Difference]: Start difference. First operand 448 states and 621 transitions. Second operand 4 states. [2019-10-22 11:27:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:16,184 INFO L93 Difference]: Finished difference Result 1753 states and 2444 transitions. [2019-10-22 11:27:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:16,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-10-22 11:27:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:16,197 INFO L225 Difference]: With dead ends: 1753 [2019-10-22 11:27:16,197 INFO L226 Difference]: Without dead ends: 1307 [2019-10-22 11:27:16,199 INFO L600 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-10-22 11:27:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2019-10-22 11:27:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 871. [2019-10-22 11:27:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-10-22 11:27:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1168 transitions. [2019-10-22 11:27:16,242 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1168 transitions. Word has length 143 [2019-10-22 11:27:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:16,242 INFO L462 AbstractCegarLoop]: Abstraction has 871 states and 1168 transitions. [2019-10-22 11:27:16,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1168 transitions. [2019-10-22 11:27:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-22 11:27:16,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:16,254 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:16,254 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:16,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1893011715, now seen corresponding path program 1 times [2019-10-22 11:27:16,255 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:16,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135279374] [2019-10-22 11:27:16,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:16,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:16,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:27:16,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135279374] [2019-10-22 11:27:16,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:16,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:16,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374278818] [2019-10-22 11:27:16,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:16,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:16,351 INFO L87 Difference]: Start difference. First operand 871 states and 1168 transitions. Second operand 4 states. [2019-10-22 11:27:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:17,160 INFO L93 Difference]: Finished difference Result 3287 states and 4394 transitions. [2019-10-22 11:27:17,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:17,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-22 11:27:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:17,168 INFO L225 Difference]: With dead ends: 3287 [2019-10-22 11:27:17,168 INFO L226 Difference]: Without dead ends: 2418 [2019-10-22 11:27:17,170 INFO L600 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-10-22 11:27:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2019-10-22 11:27:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2132. [2019-10-22 11:27:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-10-22 11:27:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2647 transitions. [2019-10-22 11:27:17,213 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2647 transitions. Word has length 155 [2019-10-22 11:27:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:17,213 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2647 transitions. [2019-10-22 11:27:17,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2647 transitions. [2019-10-22 11:27:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-22 11:27:17,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:17,217 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:17,217 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:17,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1809702189, now seen corresponding path program 1 times [2019-10-22 11:27:17,218 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:17,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77146097] [2019-10-22 11:27:17,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:17,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:17,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:27:17,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77146097] [2019-10-22 11:27:17,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:17,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:17,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097016809] [2019-10-22 11:27:17,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:17,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:17,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:17,301 INFO L87 Difference]: Start difference. First operand 2132 states and 2647 transitions. Second operand 4 states. [2019-10-22 11:27:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:18,049 INFO L93 Difference]: Finished difference Result 5395 states and 6742 transitions. [2019-10-22 11:27:18,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:18,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-22 11:27:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:18,058 INFO L225 Difference]: With dead ends: 5395 [2019-10-22 11:27:18,058 INFO L226 Difference]: Without dead ends: 3265 [2019-10-22 11:27:18,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2019-10-22 11:27:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 2133. [2019-10-22 11:27:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-10-22 11:27:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2588 transitions. [2019-10-22 11:27:18,156 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2588 transitions. Word has length 158 [2019-10-22 11:27:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:18,156 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 2588 transitions. [2019-10-22 11:27:18,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2588 transitions. [2019-10-22 11:27:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-22 11:27:18,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:18,161 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:18,161 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:18,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:18,161 INFO L82 PathProgramCache]: Analyzing trace with hash 312992377, now seen corresponding path program 1 times [2019-10-22 11:27:18,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:18,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34160521] [2019-10-22 11:27:18,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:18,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34160521] [2019-10-22 11:27:18,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:18,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:18,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293465627] [2019-10-22 11:27:18,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:18,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:18,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:18,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:18,229 INFO L87 Difference]: Start difference. First operand 2133 states and 2588 transitions. Second operand 3 states. [2019-10-22 11:27:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:18,654 INFO L93 Difference]: Finished difference Result 4549 states and 5472 transitions. [2019-10-22 11:27:18,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:18,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-22 11:27:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:18,661 INFO L225 Difference]: With dead ends: 4549 [2019-10-22 11:27:18,661 INFO L226 Difference]: Without dead ends: 2278 [2019-10-22 11:27:18,663 INFO L600 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-10-22 11:27:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-10-22 11:27:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2133. [2019-10-22 11:27:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-10-22 11:27:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2495 transitions. [2019-10-22 11:27:18,701 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2495 transitions. Word has length 165 [2019-10-22 11:27:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:18,701 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 2495 transitions. [2019-10-22 11:27:18,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2495 transitions. [2019-10-22 11:27:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 11:27:18,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:18,705 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:18,705 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:18,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:18,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2122414462, now seen corresponding path program 1 times [2019-10-22 11:27:18,706 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:18,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409386087] [2019-10-22 11:27:18,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:18,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:27:18,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409386087] [2019-10-22 11:27:18,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:18,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:18,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032382256] [2019-10-22 11:27:18,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:18,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:18,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:18,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:18,772 INFO L87 Difference]: Start difference. First operand 2133 states and 2495 transitions. Second operand 3 states. [2019-10-22 11:27:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:19,163 INFO L93 Difference]: Finished difference Result 4681 states and 5436 transitions. [2019-10-22 11:27:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:19,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-22 11:27:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:19,169 INFO L225 Difference]: With dead ends: 4681 [2019-10-22 11:27:19,169 INFO L226 Difference]: Without dead ends: 1990 [2019-10-22 11:27:19,171 INFO L600 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-10-22 11:27:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-10-22 11:27:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1850. [2019-10-22 11:27:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-10-22 11:27:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2047 transitions. [2019-10-22 11:27:19,201 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2047 transitions. Word has length 174 [2019-10-22 11:27:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:19,201 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 2047 transitions. [2019-10-22 11:27:19,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2047 transitions. [2019-10-22 11:27:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-22 11:27:19,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:19,205 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:27:19,205 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1776115291, now seen corresponding path program 1 times [2019-10-22 11:27:19,206 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:19,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842001557] [2019-10-22 11:27:19,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:19,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:19,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-22 11:27:19,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842001557] [2019-10-22 11:27:19,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333176882] [2019-10-22 11:27:19,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/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-10-22 11:27:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:19,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:27:19,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:27:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:27:19,568 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:27:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:27:19,608 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:27:19,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-22 11:27:19,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398361076] [2019-10-22 11:27:19,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:19,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:19,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:19,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:19,611 INFO L87 Difference]: Start difference. First operand 1850 states and 2047 transitions. Second operand 3 states. [2019-10-22 11:27:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:19,934 INFO L93 Difference]: Finished difference Result 3697 states and 4091 transitions. [2019-10-22 11:27:19,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:19,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-22 11:27:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:19,939 INFO L225 Difference]: With dead ends: 3697 [2019-10-22 11:27:19,939 INFO L226 Difference]: Without dead ends: 1849 [2019-10-22 11:27:19,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:27:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2019-10-22 11:27:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1429. [2019-10-22 11:27:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-10-22 11:27:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1533 transitions. [2019-10-22 11:27:19,964 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1533 transitions. Word has length 188 [2019-10-22 11:27:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:19,965 INFO L462 AbstractCegarLoop]: Abstraction has 1429 states and 1533 transitions. [2019-10-22 11:27:19,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1533 transitions. [2019-10-22 11:27:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-22 11:27:19,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:19,968 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 11:27:20,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:27:20,169 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 360926504, now seen corresponding path program 1 times [2019-10-22 11:27:20,170 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:20,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131053487] [2019-10-22 11:27:20,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:20,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:20,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:20,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131053487] [2019-10-22 11:27:20,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:20,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:20,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169343992] [2019-10-22 11:27:20,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:27:20,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:20,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:27:20,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:20,360 INFO L87 Difference]: Start difference. First operand 1429 states and 1533 transitions. Second operand 7 states. [2019-10-22 11:27:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:21,369 INFO L93 Difference]: Finished difference Result 3741 states and 4045 transitions. [2019-10-22 11:27:21,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:27:21,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2019-10-22 11:27:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:21,378 INFO L225 Difference]: With dead ends: 3741 [2019-10-22 11:27:21,378 INFO L226 Difference]: Without dead ends: 2031 [2019-10-22 11:27:21,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:27:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2019-10-22 11:27:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1429. [2019-10-22 11:27:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-10-22 11:27:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1503 transitions. [2019-10-22 11:27:21,403 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1503 transitions. Word has length 198 [2019-10-22 11:27:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:21,403 INFO L462 AbstractCegarLoop]: Abstraction has 1429 states and 1503 transitions. [2019-10-22 11:27:21,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:27:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1503 transitions. [2019-10-22 11:27:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-22 11:27:21,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:21,406 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 11:27:21,406 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:21,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1134644622, now seen corresponding path program 1 times [2019-10-22 11:27:21,406 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:21,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558286656] [2019-10-22 11:27:21,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:21,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:21,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:21,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558286656] [2019-10-22 11:27:21,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:21,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:21,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319315162] [2019-10-22 11:27:21,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:21,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:21,528 INFO L87 Difference]: Start difference. First operand 1429 states and 1503 transitions. Second operand 4 states. [2019-10-22 11:27:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:22,072 INFO L93 Difference]: Finished difference Result 3140 states and 3298 transitions. [2019-10-22 11:27:22,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:22,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-10-22 11:27:22,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:22,076 INFO L225 Difference]: With dead ends: 3140 [2019-10-22 11:27:22,076 INFO L226 Difference]: Without dead ends: 1573 [2019-10-22 11:27:22,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2019-10-22 11:27:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1429. [2019-10-22 11:27:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-10-22 11:27:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1489 transitions. [2019-10-22 11:27:22,098 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1489 transitions. Word has length 202 [2019-10-22 11:27:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:22,099 INFO L462 AbstractCegarLoop]: Abstraction has 1429 states and 1489 transitions. [2019-10-22 11:27:22,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1489 transitions. [2019-10-22 11:27:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-22 11:27:22,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:22,103 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 11:27:22,103 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash -135469808, now seen corresponding path program 1 times [2019-10-22 11:27:22,103 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:22,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031315914] [2019-10-22 11:27:22,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:22,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:22,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-22 11:27:22,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031315914] [2019-10-22 11:27:22,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:22,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:22,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758658353] [2019-10-22 11:27:22,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:22,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:22,248 INFO L87 Difference]: Start difference. First operand 1429 states and 1489 transitions. Second operand 4 states. [2019-10-22 11:27:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:22,914 INFO L93 Difference]: Finished difference Result 3276 states and 3429 transitions. [2019-10-22 11:27:22,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:22,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-10-22 11:27:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:22,916 INFO L225 Difference]: With dead ends: 3276 [2019-10-22 11:27:22,916 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:27:22,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:27:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:27:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:27:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:27:22,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2019-10-22 11:27:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:22,920 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:27:22,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:27:22,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:27:22,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:27:23,060 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-10-22 11:27:23,190 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-10-22 11:27:23,757 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 47 [2019-10-22 11:27:24,348 WARN L191 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 47 [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-22 11:27:24,350 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-22 11:27:24,351 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,351 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,351 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,351 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-22 11:27:24,351 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-22 11:27:24,352 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-22 11:27:24,353 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,353 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,353 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,353 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-22 11:27:24,354 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-22 11:27:24,354 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-22 11:27:24,354 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-22 11:27:24,356 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-22 11:27:24,357 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,358 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 547) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-22 11:27:24,359 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-22 11:27:24,360 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-22 11:27:24,361 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-22 11:27:24,362 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-22 11:27:24,362 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-22 11:27:24,362 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-22 11:27:24,362 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-22 11:27:24,362 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-22 11:27:24,362 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-22 11:27:24,362 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-22 11:27:24,369 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse1 (= ~a28~0 7)) (.cse6 (not .cse3)) (.cse11 (not (= 1 ~a11~0))) (.cse0 (= ~a19~0 1))) (let ((.cse2 (= ~a11~0 1)) (.cse9 (= ~a28~0 9)) (.cse10 (not .cse0)) (.cse5 (and .cse6 .cse11)) (.cse7 (not (= ~a28~0 11))) (.cse8 (not .cse1)) (.cse12 (= ~a17~0 8)) (.cse13 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (<= ~a19~0 0))) (or (and .cse4 .cse5) (and .cse4 .cse6 .cse7))) (and .cse8 .cse0 .cse6 .cse2) (and .cse9 (and .cse10 .cse3 .cse2)) (and (not .cse9) (and .cse10 .cse11 .cse7)) (and .cse10 .cse6 .cse1) (and .cse8 (and .cse5 .cse7)) (and .cse12 .cse0 .cse1 .cse13) (and .cse8 (or (and .cse12 .cse0 .cse13 .cse3) (and .cse0 .cse3 .cse11))))))) [2019-10-22 11:27:24,369 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,369 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,369 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-22 11:27:24,369 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-22 11:27:24,369 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-22 11:27:24,369 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-22 11:27:24,369 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-22 11:27:24,369 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-22 11:27:24,369 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,370 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse1 (= ~a28~0 7)) (.cse6 (not .cse3)) (.cse11 (not (= 1 ~a11~0))) (.cse0 (= ~a19~0 1))) (let ((.cse2 (= ~a11~0 1)) (.cse9 (= ~a28~0 9)) (.cse10 (not .cse0)) (.cse5 (and .cse6 .cse11)) (.cse7 (not (= ~a28~0 11))) (.cse8 (not .cse1)) (.cse12 (= ~a17~0 8)) (.cse13 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (<= ~a19~0 0))) (or (and .cse4 .cse5) (and .cse4 .cse6 .cse7))) (and .cse8 .cse0 .cse6 .cse2) (and .cse9 (and .cse10 .cse3 .cse2)) (and (not .cse9) (and .cse10 .cse11 .cse7)) (and .cse10 .cse6 .cse1) (and .cse8 (and .cse5 .cse7)) (and .cse12 .cse0 .cse1 .cse13) (and .cse8 (or (and .cse12 .cse0 .cse13 .cse3) (and .cse0 .cse3 .cse11))))))) [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-22 11:27:24,371 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-22 11:27:24,372 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-22 11:27:24,373 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-22 11:27:24,374 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-22 11:27:24,375 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-22 11:27:24,376 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-22 11:27:24,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:24 BoogieIcfgContainer [2019-10-22 11:27:24,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:24,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:24,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:24,415 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:24,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:12" (3/4) ... [2019-10-22 11:27:24,418 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:27:24,436 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:27:24,441 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:27:24,595 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b6dcdc08-3797-42c9-859e-df48df20a641/bin/utaipan/witness.graphml [2019-10-22 11:27:24,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:24,599 INFO L168 Benchmark]: Toolchain (without parser) took 14421.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 441.5 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -223.4 MB). Peak memory consumption was 218.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:24,599 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:24,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:24,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.22 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-10-22 11:27:24,600 INFO L168 Benchmark]: Boogie Preprocessor took 65.34 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-10-22 11:27:24,600 INFO L168 Benchmark]: RCFGBuilder took 1321.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:24,601 INFO L168 Benchmark]: TraceAbstraction took 12133.99 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.0 MB). Free memory was 996.4 MB in the beginning and 1.2 GB in the end (delta: -192.2 MB). Peak memory consumption was 453.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:24,601 INFO L168 Benchmark]: Witness Printer took 183.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:24,603 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 613.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.22 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. * Boogie Preprocessor took 65.34 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 1321.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12133.99 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.0 MB). Free memory was 996.4 MB in the beginning and 1.2 GB in the end (delta: -192.2 MB). Peak memory consumption was 453.8 MB. Max. memory is 11.5 GB. * Witness Printer took 183.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: 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: ((((((((((a19 == 1 && a28 == 7) && a11 == 1) && a25 == 1) || (a19 <= 0 && !(a25 == 1) && !(1 == a11)) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || (((!(a28 == 7) && a19 == 1) && !(a25 == 1)) && a11 == 1)) || (a28 == 9 && (!(a19 == 1) && a25 == 1) && a11 == 1)) || (!(a28 == 9) && (!(a19 == 1) && !(1 == a11)) && !(a28 == 11))) || ((!(a19 == 1) && !(a25 == 1)) && a28 == 7)) || (!(a28 == 7) && (!(a25 == 1) && !(1 == a11)) && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1)) || (!(a28 == 7) && ((((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1) || ((a19 == 1 && a25 == 1) && !(1 == a11)))) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((a19 == 1 && a28 == 7) && a11 == 1) && a25 == 1) || (a19 <= 0 && !(a25 == 1) && !(1 == a11)) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || (((!(a28 == 7) && a19 == 1) && !(a25 == 1)) && a11 == 1)) || (a28 == 9 && (!(a19 == 1) && a25 == 1) && a11 == 1)) || (!(a28 == 9) && (!(a19 == 1) && !(1 == a11)) && !(a28 == 11))) || ((!(a19 == 1) && !(a25 == 1)) && a28 == 7)) || (!(a28 == 7) && (!(a25 == 1) && !(1 == a11)) && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1)) || (!(a28 == 7) && ((((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1) || ((a19 == 1 && a25 == 1) && !(1 == a11)))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 12.0s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 1452 SDtfs, 2711 SDslu, 373 SDs, 0 SdLazy, 6992 SolverSat, 1157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2133occurred 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 3597 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 325 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5382 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4186 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2048 NumberOfCodeBlocks, 2048 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1202236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 817/820 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...