./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label42.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/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label42.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ced3eb982b16bda97708eba7d7a33ef6d709871 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:40:05,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:40:05,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:40:05,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:40:05,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:40:05,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:40:05,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:40:05,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:40:05,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:40:05,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:40:05,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:40:05,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:40:05,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:40:05,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:40:05,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:40:05,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:40:05,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:40:06,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:40:06,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:40:06,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:40:06,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:40:06,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:40:06,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:40:06,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:40:06,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:40:06,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:40:06,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:40:06,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:40:06,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:40:06,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:40:06,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:40:06,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:40:06,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:40:06,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:40:06,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:40:06,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:40:06,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:40:06,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:40:06,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:40:06,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:40:06,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:40:06,040 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:40:06,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:40:06,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:40:06,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:40:06,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:40:06,069 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:40:06,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:40:06,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:40:06,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:40:06,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:40:06,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:40:06,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:40:06,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:40:06,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:40:06,072 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:40:06,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:40:06,072 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:40:06,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:40:06,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:40:06,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:40:06,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:40:06,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:40:06,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:06,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:40:06,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:40:06,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:40:06,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:40:06,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:40:06,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:40:06,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer 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 -> Automizer 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 -> 1ced3eb982b16bda97708eba7d7a33ef6d709871 [2019-11-16 00:40:06,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:40:06,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:40:06,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:40:06,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:40:06,130 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:40:06,131 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label42.c [2019-11-16 00:40:06,199 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/data/463a091f1/4c7b939a30c94bc7bcca58c5353e9006/FLAG4eae30a10 [2019-11-16 00:40:06,867 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:40:06,868 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/sv-benchmarks/c/eca-rers2012/Problem01_label42.c [2019-11-16 00:40:06,901 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/data/463a091f1/4c7b939a30c94bc7bcca58c5353e9006/FLAG4eae30a10 [2019-11-16 00:40:07,130 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/data/463a091f1/4c7b939a30c94bc7bcca58c5353e9006 [2019-11-16 00:40:07,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:40:07,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:40:07,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:07,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:40:07,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:40:07,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:07" (1/1) ... [2019-11-16 00:40:07,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d3043b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:07, skipping insertion in model container [2019-11-16 00:40:07,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:07" (1/1) ... [2019-11-16 00:40:07,153 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:40:07,215 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:40:07,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:07,825 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:40:07,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:08,000 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:40:08,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08 WrapperNode [2019-11-16 00:40:08,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:08,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:08,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:40:08,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:40:08,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... [2019-11-16 00:40:08,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... [2019-11-16 00:40:08,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:08,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:40:08,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:40:08,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:40:08,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... [2019-11-16 00:40:08,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... [2019-11-16 00:40:08,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... [2019-11-16 00:40:08,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... [2019-11-16 00:40:08,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... [2019-11-16 00:40:08,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... [2019-11-16 00:40:08,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... [2019-11-16 00:40:08,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:40:08,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:40:08,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:40:08,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:40:08,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:40:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:40:10,049 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:40:10,049 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:40:10,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:10 BoogieIcfgContainer [2019-11-16 00:40:10,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:40:10,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:40:10,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:40:10,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:40:10,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:40:07" (1/3) ... [2019-11-16 00:40:10,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b438f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:10, skipping insertion in model container [2019-11-16 00:40:10,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:08" (2/3) ... [2019-11-16 00:40:10,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b438f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:10, skipping insertion in model container [2019-11-16 00:40:10,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:10" (3/3) ... [2019-11-16 00:40:10,065 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label42.c [2019-11-16 00:40:10,077 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:40:10,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:40:10,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:40:10,155 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:40:10,156 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:40:10,156 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:40:10,156 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:40:10,156 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:40:10,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:40:10,157 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:40:10,158 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:40:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-16 00:40:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-16 00:40:10,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:10,213 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] [2019-11-16 00:40:10,215 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1613704130, now seen corresponding path program 1 times [2019-11-16 00:40:10,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:10,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569887829] [2019-11-16 00:40:10,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:10,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:10,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:10,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569887829] [2019-11-16 00:40:10,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:10,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:40:10,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015352323] [2019-11-16 00:40:10,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:10,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:10,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:10,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:10,802 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-16 00:40:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:12,048 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-16 00:40:12,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:12,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-16 00:40:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:12,069 INFO L225 Difference]: With dead ends: 528 [2019-11-16 00:40:12,069 INFO L226 Difference]: Without dead ends: 266 [2019-11-16 00:40:12,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-16 00:40:12,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-16 00:40:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-16 00:40:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-11-16 00:40:12,167 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 115 [2019-11-16 00:40:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:12,170 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-11-16 00:40:12,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-11-16 00:40:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:40:12,179 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:12,179 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] [2019-11-16 00:40:12,180 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1626358534, now seen corresponding path program 1 times [2019-11-16 00:40:12,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:12,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667557633] [2019-11-16 00:40:12,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:12,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:12,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:40:12,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667557633] [2019-11-16 00:40:12,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:12,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:12,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351478260] [2019-11-16 00:40:12,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:12,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:12,517 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 4 states. [2019-11-16 00:40:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:13,665 INFO L93 Difference]: Finished difference Result 1054 states and 1488 transitions. [2019-11-16 00:40:13,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:13,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-16 00:40:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:13,675 INFO L225 Difference]: With dead ends: 1054 [2019-11-16 00:40:13,676 INFO L226 Difference]: Without dead ends: 790 [2019-11-16 00:40:13,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-16 00:40:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-16 00:40:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 528. [2019-11-16 00:40:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-16 00:40:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-11-16 00:40:13,740 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 119 [2019-11-16 00:40:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:13,741 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-11-16 00:40:13,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-11-16 00:40:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-16 00:40:13,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:13,746 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:13,746 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash -951101936, now seen corresponding path program 1 times [2019-11-16 00:40:13,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:13,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65004895] [2019-11-16 00:40:13,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:13,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:13,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:40:13,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65004895] [2019-11-16 00:40:13,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:13,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:40:13,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093324722] [2019-11-16 00:40:13,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:13,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:13,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:13,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:13,864 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-11-16 00:40:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:14,552 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-11-16 00:40:14,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:14,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-16 00:40:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:14,559 INFO L225 Difference]: With dead ends: 1316 [2019-11-16 00:40:14,559 INFO L226 Difference]: Without dead ends: 790 [2019-11-16 00:40:14,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-16 00:40:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-16 00:40:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-16 00:40:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-11-16 00:40:14,608 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 149 [2019-11-16 00:40:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:14,609 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-11-16 00:40:14,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-11-16 00:40:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-16 00:40:14,619 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:14,620 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:14,620 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:14,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1921921286, now seen corresponding path program 1 times [2019-11-16 00:40:14,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:14,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91425724] [2019-11-16 00:40:14,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:14,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:14,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:14,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91425724] [2019-11-16 00:40:14,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:14,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:14,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803069908] [2019-11-16 00:40:14,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:14,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:14,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:14,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:14,868 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-11-16 00:40:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:15,757 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-11-16 00:40:15,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:15,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-16 00:40:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:15,767 INFO L225 Difference]: With dead ends: 1449 [2019-11-16 00:40:15,767 INFO L226 Difference]: Without dead ends: 792 [2019-11-16 00:40:15,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:40:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-11-16 00:40:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-11-16 00:40:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-16 00:40:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-11-16 00:40:15,800 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 153 [2019-11-16 00:40:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:15,800 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-11-16 00:40:15,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-11-16 00:40:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-16 00:40:15,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:15,806 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:40:15,806 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:15,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash -680769074, now seen corresponding path program 1 times [2019-11-16 00:40:15,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:15,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148013320] [2019-11-16 00:40:15,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:15,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:15,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-16 00:40:15,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148013320] [2019-11-16 00:40:15,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:15,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:40:15,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843257630] [2019-11-16 00:40:15,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:15,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:15,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:15,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:15,944 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-11-16 00:40:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:16,554 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-11-16 00:40:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:16,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-16 00:40:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:16,562 INFO L225 Difference]: With dead ends: 1709 [2019-11-16 00:40:16,562 INFO L226 Difference]: Without dead ends: 1052 [2019-11-16 00:40:16,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-16 00:40:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-11-16 00:40:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-16 00:40:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-11-16 00:40:16,603 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 157 [2019-11-16 00:40:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:16,604 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-11-16 00:40:16,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-11-16 00:40:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:40:16,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:16,609 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-16 00:40:16,609 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:16,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash 556803504, now seen corresponding path program 1 times [2019-11-16 00:40:16,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:16,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441993657] [2019-11-16 00:40:16,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:16,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:16,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:16,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441993657] [2019-11-16 00:40:16,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:16,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:40:16,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653273781] [2019-11-16 00:40:16,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:16,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:16,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:16,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:16,709 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-11-16 00:40:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:17,789 INFO L93 Difference]: Finished difference Result 3150 states and 3974 transitions. [2019-11-16 00:40:17,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:17,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-16 00:40:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:17,806 INFO L225 Difference]: With dead ends: 3150 [2019-11-16 00:40:17,807 INFO L226 Difference]: Without dead ends: 2231 [2019-11-16 00:40:17,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-16 00:40:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1576. [2019-11-16 00:40:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-16 00:40:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1943 transitions. [2019-11-16 00:40:17,870 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1943 transitions. Word has length 166 [2019-11-16 00:40:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:17,871 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1943 transitions. [2019-11-16 00:40:17,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1943 transitions. [2019-11-16 00:40:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-16 00:40:17,878 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:17,878 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:17,879 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash 390134956, now seen corresponding path program 1 times [2019-11-16 00:40:17,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:17,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240369860] [2019-11-16 00:40:17,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:17,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:17,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-16 00:40:18,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240369860] [2019-11-16 00:40:18,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:18,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:40:18,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407822216] [2019-11-16 00:40:18,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:40:18,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:18,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:40:18,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:40:18,047 INFO L87 Difference]: Start difference. First operand 1576 states and 1943 transitions. Second operand 5 states. [2019-11-16 00:40:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:19,472 INFO L93 Difference]: Finished difference Result 3543 states and 4355 transitions. [2019-11-16 00:40:19,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:40:19,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-11-16 00:40:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:19,486 INFO L225 Difference]: With dead ends: 3543 [2019-11-16 00:40:19,486 INFO L226 Difference]: Without dead ends: 2100 [2019-11-16 00:40:19,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:40:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-16 00:40:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-16 00:40:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-16 00:40:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2217 transitions. [2019-11-16 00:40:19,546 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2217 transitions. Word has length 190 [2019-11-16 00:40:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:19,546 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2217 transitions. [2019-11-16 00:40:19,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:40:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2217 transitions. [2019-11-16 00:40:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-16 00:40:19,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:19,554 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:19,554 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:19,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:19,555 INFO L82 PathProgramCache]: Analyzing trace with hash 128921415, now seen corresponding path program 1 times [2019-11-16 00:40:19,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:19,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689177550] [2019-11-16 00:40:19,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:19,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:19,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-16 00:40:19,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689177550] [2019-11-16 00:40:19,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:19,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:19,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949305713] [2019-11-16 00:40:19,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:19,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:19,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:19,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:19,643 INFO L87 Difference]: Start difference. First operand 1838 states and 2217 transitions. Second operand 3 states. [2019-11-16 00:40:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:20,288 INFO L93 Difference]: Finished difference Result 4067 states and 4903 transitions. [2019-11-16 00:40:20,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:20,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-16 00:40:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:20,300 INFO L225 Difference]: With dead ends: 4067 [2019-11-16 00:40:20,300 INFO L226 Difference]: Without dead ends: 1969 [2019-11-16 00:40:20,304 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-11-16 00:40:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-16 00:40:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-16 00:40:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-16 00:40:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2019-11-16 00:40:20,348 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 193 [2019-11-16 00:40:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:20,348 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2019-11-16 00:40:20,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2019-11-16 00:40:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-16 00:40:20,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:20,355 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:20,356 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2022598972, now seen corresponding path program 1 times [2019-11-16 00:40:20,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:20,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647492814] [2019-11-16 00:40:20,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:20,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:20,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-16 00:40:20,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647492814] [2019-11-16 00:40:20,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410930000] [2019-11-16 00:40:20,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:20,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:20,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-16 00:40:20,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:40:20,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-16 00:40:20,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769358224] [2019-11-16 00:40:20,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:20,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:20,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:20,921 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand 3 states. [2019-11-16 00:40:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:21,568 INFO L93 Difference]: Finished difference Result 3672 states and 4041 transitions. [2019-11-16 00:40:21,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:21,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-11-16 00:40:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:21,570 INFO L225 Difference]: With dead ends: 3672 [2019-11-16 00:40:21,571 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:40:21,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:40:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:40:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:40:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:40:21,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2019-11-16 00:40:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:21,582 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:40:21,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:40:21,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:40:21,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:21,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:40:22,251 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2019-11-16 00:40:22,556 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2019-11-16 00:40:22,558 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-16 00:40:22,558 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-16 00:40:22,558 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,558 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,559 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,559 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,559 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,559 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,559 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-16 00:40:22,559 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-16 00:40:22,559 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-16 00:40:22,559 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-16 00:40:22,559 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,560 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,561 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-16 00:40:22,561 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-16 00:40:22,561 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-16 00:40:22,561 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-16 00:40:22,561 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-16 00:40:22,561 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-16 00:40:22,561 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-16 00:40:22,561 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-16 00:40:22,561 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,562 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-16 00:40:22,563 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-16 00:40:22,563 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-16 00:40:22,563 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-16 00:40:22,563 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-16 00:40:22,563 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-16 00:40:22,563 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-16 00:40:22,563 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-16 00:40:22,563 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-16 00:40:22,564 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (not (= ~a16~0 6))) (.cse4 (<= ~a17~0 0)) (.cse0 (= 1 ~a7~0)) (.cse7 (= ~a16~0 5)) (.cse6 (not (= ~a8~0 13))) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a20~0 1)) (.cse2 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse1 .cse4 .cse5) (and .cse6 .cse4 .cse5) (and .cse4 .cse5 .cse3) (and .cse5 .cse3 .cse7) (and .cse6 .cse0 .cse5 .cse7) (and (and .cse6 .cse5) .cse2) (and (and .cse5 .cse3) .cse2))) [2019-11-16 00:40:22,564 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,564 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,564 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,564 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,565 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,565 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-16 00:40:22,565 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-16 00:40:22,565 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-16 00:40:22,565 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-16 00:40:22,566 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-16 00:40:22,566 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-16 00:40:22,566 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-16 00:40:22,566 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-16 00:40:22,566 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-16 00:40:22,566 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-16 00:40:22,567 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-16 00:40:22,567 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-16 00:40:22,567 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-16 00:40:22,567 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-16 00:40:22,567 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,567 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,567 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,567 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-16 00:40:22,568 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-16 00:40:22,569 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,570 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (not (= ~a16~0 6))) (.cse4 (<= ~a17~0 0)) (.cse0 (= 1 ~a7~0)) (.cse7 (= ~a16~0 5)) (.cse6 (not (= ~a8~0 13))) (.cse5 (= ~a21~0 1)) (.cse3 (= ~a20~0 1)) (.cse2 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse1 .cse4 .cse5) (and .cse6 .cse4 .cse5) (and .cse4 .cse5 .cse3) (and .cse5 .cse3 .cse7) (and .cse6 .cse0 .cse5 .cse7) (and (and .cse6 .cse5) .cse2) (and (and .cse5 .cse3) .cse2))) [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-16 00:40:22,571 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-16 00:40:22,572 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-16 00:40:22,573 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-16 00:40:22,574 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-16 00:40:22,575 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-16 00:40:22,576 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-16 00:40:22,576 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-16 00:40:22,576 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-16 00:40:22,576 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-16 00:40:22,576 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-16 00:40:22,576 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-16 00:40:22,576 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-16 00:40:22,576 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-16 00:40:22,577 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-16 00:40:22,578 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-16 00:40:22,578 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-16 00:40:22,578 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-16 00:40:22,578 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-16 00:40:22,578 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-16 00:40:22,578 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-16 00:40:22,578 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-16 00:40:22,578 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-16 00:40:22,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:40:22 BoogieIcfgContainer [2019-11-16 00:40:22,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:40:22,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:40:22,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:40:22,603 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:40:22,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:10" (3/4) ... [2019-11-16 00:40:22,608 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:40:22,645 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:40:22,649 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:40:22,913 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d84c8197-500d-4d3d-b36c-5a5206f7554b/bin/uautomizer/witness.graphml [2019-11-16 00:40:22,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:40:22,915 INFO L168 Benchmark]: Toolchain (without parser) took 15780.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.8 MB). Free memory was 943.4 MB in the beginning and 1.3 GB in the end (delta: -308.3 MB). Peak memory consumption was 86.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:22,916 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:40:22,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:22,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.93 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:22,917 INFO L168 Benchmark]: Boogie Preprocessor took 96.44 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:22,918 INFO L168 Benchmark]: RCFGBuilder took 1840.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 117.7 MB). Peak memory consumption was 117.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:22,919 INFO L168 Benchmark]: TraceAbstraction took 12550.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 992.5 MB in the beginning and 1.3 GB in the end (delta: -286.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:40:22,919 INFO L168 Benchmark]: Witness Printer took 310.69 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:22,923 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 866.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 110.93 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.44 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1840.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 117.7 MB). Peak memory consumption was 117.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12550.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 992.5 MB in the beginning and 1.3 GB in the end (delta: -286.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 310.69 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && !(a16 == 6)) && a17 == 1) || (1 == a7 && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((!(a8 == 13) && a17 <= 0) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || (((!(a8 == 13) && 1 == a7) && a21 == 1) && a16 == 5)) || ((!(a8 == 13) && a21 == 1) && a17 == 1)) || ((a21 == 1 && a20 == 1) && a17 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((1 == a7 && !(a16 == 6)) && a17 == 1) || (1 == a7 && a20 == 1)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || ((!(a8 == 13) && a17 <= 0) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || (((!(a8 == 13) && 1 == a7) && a21 == 1) && a16 == 5)) || ((!(a8 == 13) && a21 == 1) && a17 == 1)) || ((a21 == 1 && a20 == 1) && a17 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 12.4s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 649 SDtfs, 1722 SDslu, 75 SDs, 0 SdLazy, 4105 SolverSat, 714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=7, 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, 9 MinimizatonAttempts, 1574 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 197 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1946 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 262 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1680 NumberOfCodeBlocks, 1680 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1670 ConstructedInterpolants, 0 QuantifiedInterpolants, 629216 SizeOfPredicates, 1 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 793/797 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...