./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label03.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_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label03.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/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 79d76b935496dc6a959c1e4984dc143bd47f9882 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:57:02,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:57:02,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:57:02,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:57:02,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:57:02,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:57:02,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:57:02,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:57:02,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:57:02,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:57:02,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:57:02,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:57:02,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:57:02,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:57:02,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:57:02,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:57:02,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:57:02,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:57:02,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:57:02,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:57:02,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:57:02,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:57:02,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:57:02,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:57:02,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:57:02,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:57:02,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:57:02,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:57:02,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:57:02,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:57:02,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:57:02,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:57:02,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:57:02,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:57:02,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:57:02,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:57:02,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:57:02,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:57:02,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:57:02,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:57:02,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:57:02,331 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:57:02,363 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:57:02,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:57:02,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:57:02,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:57:02,365 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:57:02,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:57:02,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:57:02,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:57:02,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:57:02,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:57:02,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:57:02,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:57:02,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:57:02,367 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:57:02,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:57:02,368 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:57:02,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:57:02,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:57:02,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:57:02,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:57:02,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:57:02,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:57:02,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:57:02,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:57:02,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:57:02,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:57:02,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:57:02,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:57:02,371 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_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/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 -> 79d76b935496dc6a959c1e4984dc143bd47f9882 [2019-11-15 22:57:02,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:57:02,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:57:02,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:57:02,443 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:57:02,443 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:57:02,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label03.c [2019-11-15 22:57:02,520 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/data/bc3ed7e56/a812122cae044cad99ae8a9a02fe9346/FLAG976d4cf2a [2019-11-15 22:57:03,136 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:57:03,137 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/sv-benchmarks/c/eca-rers2012/Problem02_label03.c [2019-11-15 22:57:03,153 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/data/bc3ed7e56/a812122cae044cad99ae8a9a02fe9346/FLAG976d4cf2a [2019-11-15 22:57:03,367 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/data/bc3ed7e56/a812122cae044cad99ae8a9a02fe9346 [2019-11-15 22:57:03,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:57:03,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:57:03,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:57:03,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:57:03,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:57:03,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:57:03" (1/1) ... [2019-11-15 22:57:03,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3539856c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:03, skipping insertion in model container [2019-11-15 22:57:03,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:57:03" (1/1) ... [2019-11-15 22:57:03,389 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:57:03,440 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:57:03,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:57:03,973 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:57:04,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:57:04,093 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:57:04,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04 WrapperNode [2019-11-15 22:57:04,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:57:04,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:57:04,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:57:04,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:57:04,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... [2019-11-15 22:57:04,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... [2019-11-15 22:57:04,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:57:04,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:57:04,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:57:04,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:57:04,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... [2019-11-15 22:57:04,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... [2019-11-15 22:57:04,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... [2019-11-15 22:57:04,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... [2019-11-15 22:57:04,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... [2019-11-15 22:57:04,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... [2019-11-15 22:57:04,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... [2019-11-15 22:57:04,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:57:04,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:57:04,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:57:04,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:57:04,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/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-15 22:57:04,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:57:04,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:57:05,767 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:57:05,767 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:57:05,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:57:05 BoogieIcfgContainer [2019-11-15 22:57:05,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:57:05,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:57:05,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:57:05,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:57:05,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:57:03" (1/3) ... [2019-11-15 22:57:05,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2393b897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:57:05, skipping insertion in model container [2019-11-15 22:57:05,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:57:04" (2/3) ... [2019-11-15 22:57:05,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2393b897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:57:05, skipping insertion in model container [2019-11-15 22:57:05,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:57:05" (3/3) ... [2019-11-15 22:57:05,778 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label03.c [2019-11-15 22:57:05,788 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:57:05,797 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:57:05,809 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:57:05,854 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:57:05,854 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:57:05,854 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:57:05,854 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:57:05,855 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:57:05,855 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:57:05,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:57:05,857 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:57:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-15 22:57:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 22:57:05,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:05,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:57:05,912 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:05,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2099114005, now seen corresponding path program 1 times [2019-11-15 22:57:05,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:05,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464786160] [2019-11-15 22:57:05,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:05,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:05,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:06,549 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-15 22:57:06,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464786160] [2019-11-15 22:57:06,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:57:06,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:57:06,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741889452] [2019-11-15 22:57:06,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:57:06,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:06,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:57:06,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:57:06,578 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-15 22:57:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:08,573 INFO L93 Difference]: Finished difference Result 746 states and 1322 transitions. [2019-11-15 22:57:08,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:57:08,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-11-15 22:57:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:08,615 INFO L225 Difference]: With dead ends: 746 [2019-11-15 22:57:08,616 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 22:57:08,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:57:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 22:57:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 449. [2019-11-15 22:57:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 22:57:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 609 transitions. [2019-11-15 22:57:08,751 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 609 transitions. Word has length 129 [2019-11-15 22:57:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:08,754 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 609 transitions. [2019-11-15 22:57:08,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:57:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 609 transitions. [2019-11-15 22:57:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-15 22:57:08,771 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:08,772 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:57:08,773 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:08,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:08,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1254611531, now seen corresponding path program 1 times [2019-11-15 22:57:08,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:08,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724929774] [2019-11-15 22:57:08,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:08,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:08,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:57:08,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724929774] [2019-11-15 22:57:08,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:57:08,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:57:08,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499083661] [2019-11-15 22:57:08,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:57:08,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:08,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:57:08,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:57:08,917 INFO L87 Difference]: Start difference. First operand 449 states and 609 transitions. Second operand 3 states. [2019-11-15 22:57:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:09,639 INFO L93 Difference]: Finished difference Result 1040 states and 1422 transitions. [2019-11-15 22:57:09,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:57:09,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-15 22:57:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:09,644 INFO L225 Difference]: With dead ends: 1040 [2019-11-15 22:57:09,645 INFO L226 Difference]: Without dead ends: 593 [2019-11-15 22:57:09,647 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-15 22:57:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-11-15 22:57:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 592. [2019-11-15 22:57:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-15 22:57:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 767 transitions. [2019-11-15 22:57:09,671 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 767 transitions. Word has length 138 [2019-11-15 22:57:09,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:09,671 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 767 transitions. [2019-11-15 22:57:09,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:57:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 767 transitions. [2019-11-15 22:57:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-15 22:57:09,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:09,674 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:57:09,675 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash -393009665, now seen corresponding path program 1 times [2019-11-15 22:57:09,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:09,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674468868] [2019-11-15 22:57:09,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:09,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:09,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:57:09,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674468868] [2019-11-15 22:57:09,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:57:09,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:57:09,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669156276] [2019-11-15 22:57:09,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:57:09,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:09,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:57:09,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:57:09,750 INFO L87 Difference]: Start difference. First operand 592 states and 767 transitions. Second operand 3 states. [2019-11-15 22:57:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:10,433 INFO L93 Difference]: Finished difference Result 1324 states and 1736 transitions. [2019-11-15 22:57:10,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:57:10,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-11-15 22:57:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:10,439 INFO L225 Difference]: With dead ends: 1324 [2019-11-15 22:57:10,440 INFO L226 Difference]: Without dead ends: 734 [2019-11-15 22:57:10,441 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-15 22:57:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-11-15 22:57:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 733. [2019-11-15 22:57:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-11-15 22:57:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 918 transitions. [2019-11-15 22:57:10,462 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 918 transitions. Word has length 142 [2019-11-15 22:57:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:10,462 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 918 transitions. [2019-11-15 22:57:10,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:57:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 918 transitions. [2019-11-15 22:57:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-15 22:57:10,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:10,466 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:57:10,466 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash -82222576, now seen corresponding path program 1 times [2019-11-15 22:57:10,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:10,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394503151] [2019-11-15 22:57:10,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:10,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:10,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 22:57:10,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394503151] [2019-11-15 22:57:10,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:57:10,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:57:10,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840270187] [2019-11-15 22:57:10,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:57:10,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:57:10,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:57:10,573 INFO L87 Difference]: Start difference. First operand 733 states and 918 transitions. Second operand 3 states. [2019-11-15 22:57:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:11,370 INFO L93 Difference]: Finished difference Result 2025 states and 2561 transitions. [2019-11-15 22:57:11,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:57:11,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-15 22:57:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:11,380 INFO L225 Difference]: With dead ends: 2025 [2019-11-15 22:57:11,380 INFO L226 Difference]: Without dead ends: 1294 [2019-11-15 22:57:11,382 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-15 22:57:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-11-15 22:57:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2019-11-15 22:57:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-11-15 22:57:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1584 transitions. [2019-11-15 22:57:11,417 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1584 transitions. Word has length 150 [2019-11-15 22:57:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:11,418 INFO L462 AbstractCegarLoop]: Abstraction has 1294 states and 1584 transitions. [2019-11-15 22:57:11,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:57:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1584 transitions. [2019-11-15 22:57:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-15 22:57:11,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:11,422 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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-15 22:57:11,423 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1257335336, now seen corresponding path program 1 times [2019-11-15 22:57:11,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:11,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296028480] [2019-11-15 22:57:11,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:11,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:11,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:57:12,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296028480] [2019-11-15 22:57:12,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:57:12,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:57:12,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235652059] [2019-11-15 22:57:12,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:57:12,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:12,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:57:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:57:12,113 INFO L87 Difference]: Start difference. First operand 1294 states and 1584 transitions. Second operand 10 states. [2019-11-15 22:57:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:13,690 INFO L93 Difference]: Finished difference Result 3512 states and 4258 transitions. [2019-11-15 22:57:13,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:57:13,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2019-11-15 22:57:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:13,708 INFO L225 Difference]: With dead ends: 3512 [2019-11-15 22:57:13,709 INFO L226 Difference]: Without dead ends: 2220 [2019-11-15 22:57:13,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:57:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-11-15 22:57:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1653. [2019-11-15 22:57:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-11-15 22:57:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 1966 transitions. [2019-11-15 22:57:13,763 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 1966 transitions. Word has length 159 [2019-11-15 22:57:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:13,765 INFO L462 AbstractCegarLoop]: Abstraction has 1653 states and 1966 transitions. [2019-11-15 22:57:13,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:57:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1966 transitions. [2019-11-15 22:57:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 22:57:13,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:13,772 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:57:13,773 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1956209418, now seen corresponding path program 1 times [2019-11-15 22:57:13,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:13,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096975238] [2019-11-15 22:57:13,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:13,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:13,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-15 22:57:13,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096975238] [2019-11-15 22:57:13,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:57:13,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:57:13,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991230771] [2019-11-15 22:57:13,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:57:13,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:13,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:57:13,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:57:13,899 INFO L87 Difference]: Start difference. First operand 1653 states and 1966 transitions. Second operand 4 states. [2019-11-15 22:57:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:14,983 INFO L93 Difference]: Finished difference Result 4007 states and 4789 transitions. [2019-11-15 22:57:14,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:57:14,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-15 22:57:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:14,995 INFO L225 Difference]: With dead ends: 4007 [2019-11-15 22:57:14,996 INFO L226 Difference]: Without dead ends: 1924 [2019-11-15 22:57:14,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:57:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2019-11-15 22:57:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1922. [2019-11-15 22:57:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2019-11-15 22:57:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2124 transitions. [2019-11-15 22:57:15,060 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2124 transitions. Word has length 204 [2019-11-15 22:57:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:15,061 INFO L462 AbstractCegarLoop]: Abstraction has 1922 states and 2124 transitions. [2019-11-15 22:57:15,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:57:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2124 transitions. [2019-11-15 22:57:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 22:57:15,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:15,067 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:57:15,068 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:15,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1945288329, now seen corresponding path program 1 times [2019-11-15 22:57:15,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:15,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109790048] [2019-11-15 22:57:15,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:15,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:15,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:57:15,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109790048] [2019-11-15 22:57:15,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:57:15,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:57:15,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317120567] [2019-11-15 22:57:15,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:57:15,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:15,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:57:15,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:57:15,192 INFO L87 Difference]: Start difference. First operand 1922 states and 2124 transitions. Second operand 3 states. [2019-11-15 22:57:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:15,798 INFO L93 Difference]: Finished difference Result 4821 states and 5380 transitions. [2019-11-15 22:57:15,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:57:15,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-15 22:57:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:15,813 INFO L225 Difference]: With dead ends: 4821 [2019-11-15 22:57:15,813 INFO L226 Difference]: Without dead ends: 2198 [2019-11-15 22:57:15,817 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-15 22:57:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2019-11-15 22:57:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1918. [2019-11-15 22:57:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2019-11-15 22:57:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2093 transitions. [2019-11-15 22:57:15,882 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2093 transitions. Word has length 205 [2019-11-15 22:57:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:15,883 INFO L462 AbstractCegarLoop]: Abstraction has 1918 states and 2093 transitions. [2019-11-15 22:57:15,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:57:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2093 transitions. [2019-11-15 22:57:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-15 22:57:15,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:15,892 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:57:15,892 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash 233226314, now seen corresponding path program 1 times [2019-11-15 22:57:15,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:15,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267741834] [2019-11-15 22:57:15,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:15,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:15,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:57:16,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267741834] [2019-11-15 22:57:16,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:57:16,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:57:16,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809040007] [2019-11-15 22:57:16,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:57:16,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:16,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:57:16,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:57:16,012 INFO L87 Difference]: Start difference. First operand 1918 states and 2093 transitions. Second operand 3 states. [2019-11-15 22:57:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:16,551 INFO L93 Difference]: Finished difference Result 3832 states and 4182 transitions. [2019-11-15 22:57:16,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:57:16,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-15 22:57:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:16,565 INFO L225 Difference]: With dead ends: 3832 [2019-11-15 22:57:16,566 INFO L226 Difference]: Without dead ends: 1916 [2019-11-15 22:57:16,570 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-15 22:57:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2019-11-15 22:57:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1775. [2019-11-15 22:57:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-11-15 22:57:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 1906 transitions. [2019-11-15 22:57:16,614 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 1906 transitions. Word has length 218 [2019-11-15 22:57:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:16,615 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 1906 transitions. [2019-11-15 22:57:16,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:57:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 1906 transitions. [2019-11-15 22:57:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-15 22:57:16,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:57:16,621 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:57:16,622 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:57:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:57:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash -960693472, now seen corresponding path program 1 times [2019-11-15 22:57:16,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:57:16,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056069219] [2019-11-15 22:57:16,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:16,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:57:16,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:57:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:57:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 22:57:16,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056069219] [2019-11-15 22:57:16,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:57:16,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:57:16,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975191901] [2019-11-15 22:57:16,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:57:16,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:57:16,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:57:16,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:57:16,869 INFO L87 Difference]: Start difference. First operand 1775 states and 1906 transitions. Second operand 4 states. [2019-11-15 22:57:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:57:17,476 INFO L93 Difference]: Finished difference Result 3402 states and 3656 transitions. [2019-11-15 22:57:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:57:17,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-11-15 22:57:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:57:17,480 INFO L225 Difference]: With dead ends: 3402 [2019-11-15 22:57:17,481 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:57:17,484 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-15 22:57:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:57:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:57:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:57:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:57:17,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2019-11-15 22:57:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:57:17,486 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:57:17,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:57:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:57:17,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:57:17,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:57:17,841 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-15 22:57:18,128 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-15 22:57:18,130 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,130 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,130 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,130 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-15 22:57:18,130 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-15 22:57:18,130 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-15 22:57:18,131 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-15 22:57:18,132 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-15 22:57:18,132 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-15 22:57:18,132 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-15 22:57:18,132 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-15 22:57:18,132 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,132 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,132 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,132 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-15 22:57:18,132 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-15 22:57:18,133 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 559) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-15 22:57:18,134 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-15 22:57:18,135 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-15 22:57:18,136 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-15 22:57:18,137 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-15 22:57:18,138 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-15 22:57:18,139 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-15 22:57:18,140 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-15 22:57:18,140 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse6 (= ~a25~0 1))) (let ((.cse1 (not (= ~a28~0 11))) (.cse5 (not (= 1 ~a11~0))) (.cse2 (<= ~a19~0 0)) (.cse3 (not .cse6)) (.cse0 (= ~a19~0 1)) (.cse4 (= ~a11~0 1))) (or (and (= ~a17~0 8) .cse0 (= ~a21~0 1) .cse1) (and .cse2 .cse1) (and .cse3 (= 10 ~a28~0) .cse4) (and .cse5 .cse0 (not (= ~a28~0 9)) .cse1) (and .cse5 .cse2 .cse3) (and (<= 10 ~a28~0) .cse0 .cse4) (and (<= 11 ~a28~0) .cse0 .cse6) (and (= ~a28~0 7) .cse4)))) [2019-11-15 22:57:18,140 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,140 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,140 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-15 22:57:18,141 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-15 22:57:18,141 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-15 22:57:18,141 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-15 22:57:18,141 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-15 22:57:18,141 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-15 22:57:18,141 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-15 22:57:18,141 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,141 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,141 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-15 22:57:18,142 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-15 22:57:18,142 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-15 22:57:18,142 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-15 22:57:18,142 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-15 22:57:18,142 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-15 22:57:18,142 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-15 22:57:18,142 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-15 22:57:18,142 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-15 22:57:18,142 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,143 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,143 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-15 22:57:18,143 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-15 22:57:18,143 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-15 22:57:18,143 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-15 22:57:18,143 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-15 22:57:18,143 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-15 22:57:18,144 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse6 (= ~a25~0 1))) (let ((.cse1 (not (= ~a28~0 11))) (.cse5 (not (= 1 ~a11~0))) (.cse2 (<= ~a19~0 0)) (.cse3 (not .cse6)) (.cse0 (= ~a19~0 1)) (.cse4 (= ~a11~0 1))) (or (and (= ~a17~0 8) .cse0 (= ~a21~0 1) .cse1) (and .cse2 .cse1) (and .cse3 (= 10 ~a28~0) .cse4) (and .cse5 .cse0 (not (= ~a28~0 9)) .cse1) (and .cse5 .cse2 .cse3) (and (<= 10 ~a28~0) .cse0 .cse4) (and (<= 11 ~a28~0) .cse0 .cse6) (and (= ~a28~0 7) .cse4)))) [2019-11-15 22:57:18,144 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,144 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,144 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-15 22:57:18,144 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-15 22:57:18,144 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-15 22:57:18,144 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-15 22:57:18,144 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-15 22:57:18,144 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,145 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,145 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-15 22:57:18,145 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-15 22:57:18,145 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-15 22:57:18,145 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-15 22:57:18,145 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-15 22:57:18,145 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-15 22:57:18,145 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-15 22:57:18,145 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-15 22:57:18,146 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-15 22:57:18,146 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,146 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,146 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-15 22:57:18,146 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,146 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-15 22:57:18,146 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-15 22:57:18,146 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-15 22:57:18,147 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-15 22:57:18,147 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-15 22:57:18,147 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:57:18,147 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-15 22:57:18,147 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,147 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,147 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,147 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-15 22:57:18,148 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-15 22:57:18,148 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-15 22:57:18,148 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-15 22:57:18,148 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-15 22:57:18,148 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,148 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,148 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,149 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-15 22:57:18,149 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-15 22:57:18,149 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-15 22:57:18,149 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-15 22:57:18,149 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-15 22:57:18,149 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-15 22:57:18,149 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,149 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,150 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,150 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-15 22:57:18,150 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-15 22:57:18,150 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-15 22:57:18,150 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-15 22:57:18,150 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-15 22:57:18,150 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-15 22:57:18,150 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:57:18,151 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-15 22:57:18,151 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-15 22:57:18,151 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,151 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,151 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,151 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-15 22:57:18,151 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-15 22:57:18,152 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-15 22:57:18,152 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-15 22:57:18,152 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-15 22:57:18,152 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,152 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,152 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 22:57:18,152 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-15 22:57:18,152 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-15 22:57:18,153 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-15 22:57:18,153 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-15 22:57:18,153 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-15 22:57:18,153 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-15 22:57:18,153 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-15 22:57:18,153 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-15 22:57:18,153 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-15 22:57:18,153 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-15 22:57:18,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:57:18 BoogieIcfgContainer [2019-11-15 22:57:18,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:57:18,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:57:18,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:57:18,207 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:57:18,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:57:05" (3/4) ... [2019-11-15 22:57:18,211 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:57:18,253 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:57:18,255 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:57:18,414 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2f7d071e-ab2d-4e32-b0b4-94d28d4945f1/bin/uautomizer/witness.graphml [2019-11-15 22:57:18,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:57:18,417 INFO L168 Benchmark]: Toolchain (without parser) took 15045.26 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.2 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -208.2 MB). Peak memory consumption was 217.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:18,417 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-15 22:57:18,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:18,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:18,418 INFO L168 Benchmark]: Boogie Preprocessor took 94.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:18,419 INFO L168 Benchmark]: RCFGBuilder took 1464.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:18,420 INFO L168 Benchmark]: TraceAbstraction took 12435.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 294.1 MB). Free memory was 988.3 MB in the beginning and 1.2 GB in the end (delta: -191.9 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:18,420 INFO L168 Benchmark]: Witness Printer took 208.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:57:18,422 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 721.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 115.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1464.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12435.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 294.1 MB). Free memory was 988.3 MB in the beginning and 1.2 GB in the end (delta: -191.9 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. * Witness Printer took 208.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 559]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11)) || (a19 <= 0 && !(a28 == 11))) || ((!(a25 == 1) && 10 == a28) && a11 == 1)) || (((!(1 == a11) && a19 == 1) && !(a28 == 9)) && !(a28 == 11))) || ((!(1 == a11) && a19 <= 0) && !(a25 == 1))) || ((10 <= a28 && a19 == 1) && a11 == 1)) || ((11 <= a28 && a19 == 1) && a25 == 1)) || (a28 == 7 && a11 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11)) || (a19 <= 0 && !(a28 == 11))) || ((!(a25 == 1) && 10 == a28) && a11 == 1)) || (((!(1 == a11) && a19 == 1) && !(a28 == 9)) && !(a28 == 11))) || ((!(1 == a11) && a19 <= 0) && !(a25 == 1))) || ((10 <= a28 && a19 == 1) && a11 == 1)) || ((11 <= a28 && a19 == 1) && a25 == 1)) || (a28 == 7 && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 12.3s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 1184 SDtfs, 2155 SDslu, 216 SDs, 0 SdLazy, 4592 SolverSat, 899 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1922occurred in iteration=6, 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, 995 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 179 HoareAnnotationTreeSize, 3 FomulaSimplifications, 796 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 184 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1572 NumberOfCodeBlocks, 1572 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1563 ConstructedInterpolants, 0 QuantifiedInterpolants, 859256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 574/574 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...